can we use sliding window for this question? for window size=k find smallest element

Hey you always have the best videos but do you have this problem in English translation? lol i tried watching this one but idk you're language, no disrespect.

JAVA CODE : public ArrayList findKthLargest(int[ ] arr, int k) { PriorityQueue minHeap=new PriorityQueue(); ArrayList ans=new ArrayList(); for(int x:arr){ minHeap.add(x); if(minHeap.size()>k) ans.add(minHeap.poll()); } while(minHeap.size()>0){ ans.add(minHeap.poll()); } return ans; }

Awesome explanation bhiya 😄😄 Just keep up the good work!!

sir aap kahan tthe aaj tak. Thanks a lot.

Great explanation!

looking more such interview series from you .. great !

can you exaplin why it is n log k please?

Shahana Alam

3 个月 前

Because we are comparing (sorting) only k elements at a time

can you still do this if k is unknown?

Bro i-k to i+k ,,,,,,so stack size should be 2k na????????????????????????

Aditya Raj

个月 前

Teetar ke do aage teetar, teetar ke do peeche teetar, bolo kitne teetar? --- Teen, not paanch Similarly, heap size should be k, not 2k.

Amit Kumar

2 个月 前

@Hunter Boi bro can u help me with the code

Hunter Boi

4 个月 前

No bro !....i-k to i+k is the region in which we will find the sorted element. Size of the stack will be k as we go on popping the elements when it reaches k

#include #include using namespace std; int main() { //priority_queue Q; priority_queue Q; int n,k; cin>>n>>k; int a[n]; for(int i=0;i>a[i]; for(int i=0;ik) { a[i-k]=Q.top(); Q.pop(); } } for(int i=0;i

#include #include #include int sortK(int arr[], int n, int k) { std::priority_queue pq(arr,arr+k+1); int index = 0;// for the new array where the final answer is stored. for(int i=k+1;i

Is using STL/ STANDARD LIBRARY and PRIORITY QUEUE acceptable in coding rounds ???? The idea of understanding the implementation part of some of the tough algorithms scares the shit out of me !! :( expecting replies from the IT and software professionals .....

Yeeroj Sinha

4 个月 前

Yes STL is allowed

Awesome bro

If k is 2 then the first value will be 3 instead of 2. Kindly cover this case!!!

Hunting Nirvana

5 个月 前

I think if K is changed, so will the Input array. The input array in this question is designed for k=3.

Sir, please tell how to implement heap in java.

EK HunterZ

13 天 前

@DINESH KUMAR why you pass Collections.reverseOrder() inside the constructor of priorityQueue ?

DINESH KUMAR

5 个月 前

For MinHeap use PriorityQueueminH = new PriorityQueue(); For MaxHeap use PriorityQueuemaxH = new PriorityQueue(Collections.reverseOrder());

can you explain the question of trapping rainwater II based on minHeap - leetcode.com/problems/trapping-rain-water-ii/

Can we do this questions in O(1) space complexity??

SHASHI KUMAR

6 个月 前

yup,with insertion sort with timr complexity O(n*k)

Nice explaination !!

Thank you 😊

Great explaination by u😊😊

Excellent Explanation!!!! totally out of context question Bro are you from UP??

Aditya Raj

个月 前

MP, most probably. UP people don't say "Hum" as "Uppan".

divyesh srivastava

6 个月 前

Bareily sa hain

Bro very Nice Tutorial. Love the way you explain and share knowledge. I am looking in heap question, Please can you make a video on this question of the Heap leetcode.com/discuss/interview-question/542597/ I don't know how to apply your same technique here that you teach on the heap. Please help in this one, I will be thankful to you.

Pushpender Sharma

3 个月 前

Heap can we used to sort the Map by value in Java if you are using Priority Queue

Thank you so much bro for this valuable content.so happy to learn

#include #include #include using namespace std; void sort_nearly_sorted(int *arr, int n, int k) { priority_queue p; int j = 0; for (int i = 0; i { p.push(arr[i]); if (p.size() > k) { arr[j] = p.top(); p.pop(); ++j; } } while (p.size() > 0) { arr[j] = p.top(); p.pop(); ++j; } } void print_Arr(int arr[], int n) { for (int i = 0; i cout

bro code ka video hai?

''' Heap -> createHeap() top() push() pop() ''' # creating heap def createHeap(): heap = [] return heap # return the top element def top(heap): if len(heap) == 0: return -1 else: return heap[len(heap)-1] # Min.heap # push def push(heap,x): if len(heap) == 0: heap.append(x) elif len(heap) > 0 and x heap.append(x) elif len(heap) > 0 and x > top(heap): heap.insert(0,x) # pop def pop(heap): if len(heap) == 0: return -1 else: heap.pop() # prob logic def sort_k_sorted(arr,n,k): sort_list = [] h = createHeap() for i in range(0,n): push(h,arr[i]) if len(h) > k: sort_list.append(h.pop()) return sort_list + sorted(h) if __name__ =="__main__": arr = [3,2,1,5,6,4] n = len(arr) k = 2 print(sort_k_sorted(arr,n,k))

3:49

Your explanations are awsome. I got stuck in this question "Smallest range in K lists" can you please make a video on this.

It’s May ,waiting for backtracking, greedy, graphs, trees patiently. 😊😊

ROHIT gaming

10 天 前

yes

ROHIT gaming

10 天 前

@Dhruvil Bhuptani usne kuch ni padaya dsa drame marta hai bs

Dhruvil Bhuptani

个月 前

babbar love babbar ka video dekho jake beta.

Vikrant Prasad

7 个月 前

@ravi ashwin I think due to lockdown he is not able to make any new videos

ravi ashwin

8 个月 前

@markos webinar on backtracking by coding ninjas and graph by coding blocks is available in youtube

Perfect🤩

merci

Aditya Verma

9 个月 前

bienvenu

//ide.geeksforgeeks.org/CfUURWtG7j //Ascending Order Min-heap...descending Order Max Heap.....🤘

Practice problem link : practice.geeksforgeeks.org/problems/nearly-sorted-algorithm/0

#include #include #include using namespace std; int main() { vector A = {6, 5, 3, 2, 8, 10, 9}; int n = A.size(); priority_queue minHeap; int k = 3; // Push k elements in min heap for (int i=0; i

Ankoor Bhagat

个月 前

@24K_ Gold std::priority_queue class implements a minheap by default. This problem needs maxheap so I am pushing negative of integers... 10 in the example is largest so I want it to be on top so I push -10 since -10 is smallest it will be on top...later I just apply negative in front to get correct number...

24K_ Gold

个月 前

bro what is the logic behind -minHeap.top(), i mean what is the significance of minus here! waiting for your kind rply'

bhai how did you identify that we should use min heap?

Dayamoy Adhikari

9 个月 前

@Jagrit Bhupal Agreed! I think one must identify the type of heap based on what is required.. Since we require the ascending order of elements, take the min-heap. It's unlike Kth largest/smallest where type of heap used is opposite to the requirement because we're eliminating the smallest/largest element i.e. it's a different thought process than this question.

Jagrit Bhupal

9 个月 前

Here, we need to print array in ascending order so smallest element in k range will come first, that is top of min heap. If we need to print array in descending order, I think we will use max-heap.

Aditya Verma

9 个月 前

Brother, I have covered that already in the starting videos of the series, please refer them