Find the 'Kth' max and min element of an array | Q3 | Love Babbar DSA Sheet

#coding #competitiveprogramming #interviewquestions #dsaseries

In this video I have explained the 3rd problem in the sheet with 2 approaches and the link of the other approach is given below.

Hope you like it. If have any doubt then just comment down below.

LIKE | SHARE | SUBSCRIBE

[nehalpradhan]

thank you. it was so simple.
all the solutions from other websites looked so complex for beginners and were kind of discouraging.

[funky_manyt]

I am comfertable with English 🤩.
Love your videos😇♥️

[tusharchamp]

sir expected time complexity is O(n) and you are solving this problem in O(nlogn) time sir i am come here in your video to see the solution in O(n) so my request is that please make a video that the solution takes order of n time

[nivedithaniveditha]

Bro, Can u please do a video in partition approach as well? Also english is fine.

[oqant]

the time complexity for the second approach in pushing the elments into heap is nlogn ...isnt it????

[shreyasingh]

Can u please explain a little more on how the complexity is n+klogn for approach-2 . I think the pushing into priority queue will give us nlogn+ k times pop is klogn hence complexity is nlogn+klogn.plz let me know where I'm going wrong

[royharper]

Liked the explaination! Can you please also make a video, in which you show how you have set up your CodeEditoe. It will be a great help

[SM-ehvz]

Continue in English bro...and thanks for your efforts 🤩😀🥰

[AtulKumar-eonx]

how to transfer to gfg from sublime text
(1st approach)

[ShivamKumar-ercu]

please explain it in java also as many of the viewers are doing code in java

[prateekbajpai]

Good morning sir, sir will you kindly explain me the logic:
int ans, i=1;
while(!p.empty()){
if(i==k){
ans = p.top();
break;
}
i++;
p.pop();
}
this is for Kth element in matrix question.

[ashwinvarma]

please make use of vectors instead of arrays

[ryan-boxi]

can you explanin why using the mean heap takes N+Klog(N). I am presuming N for bulding the heap and Log(n) for calling minelement K times.

[ajitkumaryadav]

As you link provided in the description geeksforgeeks is claim that it worst case time complexity is O(N), but you told that in this video it will take O(N) in best case and O(N^2 ) in worst case. i am just confused?? if you get it please tell how to select pivot randomly while doing so...

[chanduchandrakanth]

Bro n+klogn so we consider it o(n), because we ignore klogn

[yashsoni-mfcd]

Before coding please explain the concept.

[vinayakrastogi]

the approach is good but its showing time limit exceeded please make a video on more optimized approach

[rohandevaki]

explain the time complexity please
it should be O(n+log(n)) right?

Creating a heap takes O(n) time while inserting into a heap (or priority queue) takes O(log(n)) time.

[deekshithpranav]

yes we want in English there are lot of other videos for dsa babbar in HINDI.

[rwiteshbera]

Brother, your are doing well. Can you make some videos for beginners? I am a freshers of your college.