I wish i would have found this channel at starting of lockdown. If so i will become a good programmer . Can u please tell me some tips I have only 15 days left for my placements. I have to get good programming skills & good job
Thanks Suraj for your nice feedback. If you've less time, I would say just solve important questions from each topic. Especially array, string, binary tree. Mainly questions are asked from these topics in interviews.
The Best Channel i have seen till date on java Great Explaination Sir keep going and thanks for the content especially for max heap as it is not direct function in java
Best tutorial I've found so far! Great video! Regarding the max heap and min heap. max heap: complexity O(N) + k Log N min heap: complexity k log k + (N-K) log k which one is faster? i assume k log k should be faster than O(N) if k is a small number and k log N should be faster than N log k, am I right?
one thing i can not digest is, why you need to traverse 'k' times after sorting in order to find the kth largest element. Isnt the element already at kth index ? @1:37
if the input array has duplicates this will not work. example : {3,2,3,1,2,4,5,5}. I feel like we have to add duplicate condition while adding the element to the Heap
sir in implementation of max heap i am getting error in the Collections.reverseOrder(). But if i remove the Collection.reverseOrder() there is no error would u explain?
I wish i would have found this channel at starting of lockdown. If so i will become a good programmer .
Can u please tell me some tips I have only 15 days left for my placements. I have to get good programming skills & good job
Thanks Suraj for your nice feedback. If you've less time, I would say just solve important questions from each topic. Especially array, string, binary tree. Mainly questions are asked from these topics in interviews.
Thank you, Learning a lot from ur videos,
Mainly knowing new techniques
The Best Channel i have seen till date on java Great Explaination Sir keep going and thanks for the content especially for max heap as it is not direct function in java
Thanks for your nice feedback. Keep Watching.
Best tutorial I've found so far! Great video!
Regarding the max heap and min heap.
max heap: complexity O(N) + k Log N
min heap: complexity k log k + (N-K) log k
which one is faster?
i assume k log k should be faster than O(N) if k is a small number
and k log N should be faster than N log k, am I right?
BEST explanation,thanks....This problem is of what level in interview? Easy/medium/hard?
This is Medium problem.
best series of heap on youtbe
one thing i can not digest is, why you need to traverse 'k' times after sorting in order to find the kth largest element. Isnt the element already at kth index ? @1:37
You're correct. It is O(NLogN) plus constant time for single array access, so O(NLogN)
if the input array has duplicates this will not work.
example : {3,2,3,1,2,4,5,5}.
I feel like we have to add duplicate condition while adding the element to the Heap
Good explanation...Thank you...!!
Thanks for your nice feedback. Keep Watching.
Thank you so much
best explaination ever
it will be more better if you paste the leetcode link of question also bro and thanks
I Have A Doubt In Clavax Technologies Code Question Explain Next Time.
Nice explanation bro🧡🧡
Thanks for your nice feedback. Keep Watching.
sir in implementation of max heap i am getting error in the Collections.reverseOrder(). But if i remove the Collection.reverseOrder() there is no error would u explain?
Java 8 onwards, PriorityQueue's Comparator uses lambda expressions, right? Is that the reason why? Not sure.
How is creating a max heap O(N) and not O(NlogN) but creating a min heap is O(klogk)?
yes I do have the same doubt
Ty sir
Thanks. Keep Watching.
3Rd video dekh rha hu ab.
Thanks. Keep watching.