Heap - 3: Find Kth Largest Value in given array | Using Min Heap | Using Max Heap

[@surajgrandhi6742]

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

[@CodingSimplified]

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.

[@surajgrandhi6742]

Thank you, Learning a lot from ur videos,
Mainly knowing new techniques

[@Sujith0369]

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

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@ghostslinger3148]

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?

[@reshmah1497]

BEST explanation,thanks....This problem is of what level in interview? Easy/medium/hard?

[@CodingSimplified]

This is Medium problem.

[@Anicienttimes]

best series of heap on youtbe

[@jatinchoubey6053]

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

[@lukebarry1417]

You're correct. It is O(NLogN) plus constant time for single array access, so O(NLogN)

[@bhaskar1210]

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

[@ananthasubramanian7355]

Good explanation...Thank you...!!

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@ranjitasahu19]

Thank you so much

[@tamannatyagi6285]

best explaination ever

[@Anicienttimes]

it will be more better if you paste the leetcode link of question also bro and thanks

[@jatinbhardwaj9020]

I Have A Doubt In Clavax Technologies Code Question Explain Next Time.

[@deepjyotidebnath4122]

Nice explanation bro🧡🧡

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@arulajith9507]

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?

[@yaminimathur2390]

Java 8 onwards, PriorityQueue's Comparator uses lambda expressions, right? Is that the reason why? Not sure.

[@analogtheory7185]

How is creating a max heap O(N) and not O(NlogN) but creating a min heap is O(klogk)?

[@manasvijain7458]

yes I do have the same doubt

[@sujithgoud3535]

Ty sir

[@CodingSimplified]

Thanks. Keep Watching.

[@yatri6329]

3Rd video dekh rha hu ab.

[@CodingSimplified]

Thanks. Keep watching.