5 ай бұрын
Пікірлер
@ashok2089 10 сағат бұрын
Nikhil, Can you please do a video on Merge K Sorted List?
@bxp_bass 12 сағат бұрын
That optimization only works in python or other interpreted languages, where sorting is much cheaper than a loop. In golang or c or c++ it's much faster to do loops, so you don't need to spend O(n log n) on sorting
@MayankSinghania 19 сағат бұрын
jab movie ka naam yaad nahi rehta to ye codes kaun yaad rakhega?
@MayankSinghania 19 сағат бұрын
Which was the best version according to you?
@oknokok 19 сағат бұрын
Nice explanation, setup and video quality 📸
@MayankSinghania 19 сағат бұрын
How to override this exception when need complete silence but need phone without switched off
@MayankSinghania 19 сағат бұрын
helpful!
@MayankSinghania 19 сағат бұрын
Android automatically detects passport, cards etc. without need of captions :P Good for ios though
@kanaramjangid8563 22 сағат бұрын
Sir i have been learning dsa from last 4 months and practice on my vs code . Can i now upload my solutions to leedcode account sooner or later
@AkashReddy-e6j 23 сағат бұрын
one that stood out 🔥🔥
@niko9338 Күн бұрын
any resource on building this basic type of binary tree? i find it harder to build it than binary search trees that split the values based on their size to left and right subtrees
@shwetasdhake7986 Күн бұрын
Your Code: Checks for empty Set during iteration and incorrectly initializes the Set with letters 'a' to 'z'. Instead, we can directly adds characters from the sentence to the Set and checks if the Set contains all 26 letters at the end.
@mohitramana Күн бұрын
The brute force method you mentioned here, not sure if that can be implemented without using recursion or using queue. And if recursion or queue is being used, then how does it remain a brute force. It would be nice if you can provide some reference to brute force somewhere.
@surajsidar3280 Күн бұрын
hash[letter] -- >0 was confusing for me. I thought it might be some new operator introduced in Java. Later I searched on Meta AI and found that hash[letter]-- is a decrement operator
@vpmismayil101 Күн бұрын
Thx❤
@ashok2089 Күн бұрын
Nice explanation!
@paulooliveira8919 Күн бұрын
you rock!
@AyushSharma-tj1kp Күн бұрын
why did we compare string at i-1 and j-1 ??
@appikeeru5785 Күн бұрын
Y in his videos very less viewers😢
@replymadhug Күн бұрын
Amazing explaination
@akankshasonkar6846 Күн бұрын
Thanks Nikhil such amazing solution :)
@engineermind1651 Күн бұрын
your way to explain theoritical is good but explain the code you more improve please.
@shreyaskhatavkar9976 2 күн бұрын
<3 sir
@prapulganeshkrishna8229 2 күн бұрын
Great content man !!!!!!!!!!!!!!!!!
@thenormalpen1900 2 күн бұрын
Wow, that is such a clear soln, thanks!
@floatingfortress721 2 күн бұрын
Wait... Isn't the time complexity of the optimal solution O(n.lgM), where n = piles.length and M = max(piles) is the size of the search range?
@debjanidas5786 2 күн бұрын
finally understood after watching your video
@Homelander_30 2 күн бұрын
Hey bro,Will you please make a video on collection framework?? Much needed one.
@Adeetisharma-nu8jg 2 күн бұрын
thankyou so much
@nibeditadas4182 2 күн бұрын
Great explanation , need more such videos on different Leet code problems.
@jayeshpatil5757 2 күн бұрын
19:25 ,10 July watching Jump game leetcode searched.
@jayeshpatil5757 2 күн бұрын
19:04, 10 July , watching. Red cloth washed at 18:53,10 July.
@sudheeri1171 2 күн бұрын
You are amazing at presenting the DSA. Could you please sort the DSA questions based on Blind 75 or Interview 150 or some other sheet? It would be great for revision or for learning quickly in a couple of months
@sharonpushparaj2857 3 күн бұрын
Finally it worked Tnx bro
@meghasingh9170 3 күн бұрын
Why is the while loop condition : "while even and even.next" and not "while odd and odd.next"?
@engineermind1651 3 күн бұрын
I love pdf is best
@ritikasingh6298 3 күн бұрын
Thankyou so much you made building logic so easy !
@PrinceSingh-rs4ed 3 күн бұрын
unparalleled explanation, specially with the that visual.
@ardrajithendran9303 3 күн бұрын
Your class is amazing 🤩
@ravi.m4954 3 күн бұрын
Hi Nikhil thanks for knowledge sharing.I have one question if my array contains odd number of duplicates like 3 times then xor output same number right .this case how to handle with xor?
@nikoo28 3 күн бұрын
A XOR A = 0 0 XOR A = A
@ravi.m4954 3 күн бұрын
@@nikoo28 thanks for reply.My question is if I use xor on input which non repeated element and duplicate element with 3 times occurence ex [a,b,b,b] in this xor will give both a and b right .but expected is only a since non duplicate. Can you tell me xor will work in this input scenario
@kartikluthra6621 3 күн бұрын
🙇🏻♂
@kriss452 4 күн бұрын
Literally the best Leetcode/DataStructure tutor in youtube especially for java programmers! You are amazing!
@horizonenjoy2323 4 күн бұрын
why arr[j+1] = key
@allroundgyaan2786 4 күн бұрын
Awesome explanation
@PhotonUzumaki 4 күн бұрын
explanation is best but this solution is not working it gives error of "getListLength"
@akashskumar6389 5 күн бұрын
i usually used to check videos with shortest time, but since I started watching your approaches I ended up looking if your videos are there for the questions on priority
@FARDEENAHMED-vh4th 5 күн бұрын
I still didn't understand
@urvashichaurasia6284 5 күн бұрын
Please upload more videos on hard leetcode problem
@savin1999 5 күн бұрын
Level order traversal technique can be simplified a bit by using queue<pair<TreeNode*, int>> data structure.
@patelg6759 5 күн бұрын
You told my story in first 20 seconds