Glad it helped! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
If I used low as 1 and high as n-2 initially, it gave me wrong answer but if I use low=0 and high=n-1, it gives ne right answer Any explanation why so?
We are glad that you love our explanation. For better experience visit- nados.pepcoding.com Don't forget to follow us on Instagram instagram.com/pepcoding/
After 12 mins of your video explanation, I was able to solve it myself. Great work. It was a tricky one.
Glad it helped! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
respect for pepcoding.....
your explanation is so good that I was able to code just after your intuition......
thank u so much
Best explanation on the internet, in this Problem.... Genius
thanks for this easy explanation!
Thank you
@manisha, tu school mein bhi acha smjhati thi aur yha bhi :)
Ma'am maza aa gya kya mst explaination kiya h apne
Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
What is the tiime compileixty of the solution in this video ?
@@freshcontent3729 O(logn)
Crystal clear explanation mam.. Thank you so much...
What is the tiime compileixty of the solution in this video ?
Thanks for explaining such complex question in such a simple way to .
Glad it helped!
For better experience, visit nados.io, where you will get well curated content and career opportunities.
Parnaam🙏🏻
Thank you Mam(Channel is getting popular in California)
what a explaination. maza*💯 ho gaya.
nice explanation maam!!
What is the tiime compileixty of the solution in this video ?
@@freshcontent3729 logn
@@freshcontent3729 where n is the number of elements
THANK U SO MUCH
Done!
nice explanation
clear.
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
What is the tiime compileixty of the solution in this video ?
log n
op explanation ma'am
how to code the O(n) approach pls tell..
use hashmap or use xor
🥰🥰🥰🥰🥰🥰
If I used low as 1 and high as n-2 initially, it gave me wrong answer but if I use low=0 and high=n-1, it gives ne right answer
Any explanation why so?
great explanation but why its not working on leet
We are glad that you love our explanation.
For better experience visit- nados.pepcoding.com
Don't forget to follow us on Instagram
instagram.com/pepcoding/
after while loop return nums[lower bound] not -1.
Just take xor of all the elements
We have to do it in O(logn)
@@manishapawar3471 Sorry I didn't check the constrains.Binary search would work in this case.