Merge K sorted Lists - Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA
Vložit
- čas přidán 1. 08. 2020
- Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain the solution to Merge K sorted Lists in Hashmap.
For a better experience and more exercises, VISIT: www.pepcoding.com/resources/o...
#pepcoding #java #programming
Have a look at our result: www.pepcoding.com/placements
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Join us on Telegram: t.me/joinchat/UVTjJE83a-zFnPB
Bro dropped the best explanation for priority Queue and think we won't notice.
is it only me, or the audio sounds a bit jittery? very light distortion in audio
We need more teachers like you sir...!!(Who will never let the students get bored)......agar ese teacher mil gaye to India a future bright h
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
@subham right brother.
This is some whole other level 😲😲😲😲
Kabhi socha bhi nahi hoga ki ayese bhi koi samjha sakta hai!
WOW! your way of implementing code with explaining clear thought process is legendary. .
That's Mind Blowing 💯💯
next level explanation with the help of this solution i did it merge K LinkedList problem
5 days back this question was asked to me in VMWARE coding round
epic man, no one tells how internally comareTo works !
The best.......................sir❤
Literally NO WORDS...😮 FOR YOUR EXPLAINATION ❤
Sir ap bhagvan hai aise koi samjha hi nai skta hai
No content is upto this level in any platform for DSA i bet
Man this is so good, I regret founding this channel so late.
Hope we help you but for better experience and well organised content visit - nados.io 🚀
⚠️ You can also post your queries on community tab.
Great explanation as always.
next level explanation , thank you : )
Thank you so much. Keep learning
Woww, this is amazing.
just to the point :) thank you
Glad it helped!
Splendid Explanation.
Thankyou beta!
I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/How-do-I-start-learning-or-strengthen-my-knowledge-of-data-structures-and-algorithms )
Sir, not able to find fractional knapsack problem on channel. Could you please share the link, since you mentioned in this video. Thanks!
thanks sir...
Nice explanation sir
instead or writing comparator or comparable ,use this
PriorityQueue pq=new PriorityQueue((p,q)->{
return p.val-q.val;
});
Great Explanation sir get multiple topics (Interface) also 👌🔥
Glad to know that you liked the content and thank you for appreciating. If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc
great sir
understood it very well.......very informative video...........
Thankyou beta!
I am glad you liked it. I also hope that you are watching till end.
Will you like to write a few words about us here (www.quora.com/Which-is-the-best-online-course-to-learn-data-structures)
@@Pepcoding Sir it says page not found
Explanation level
If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
sir to implement an interface in java in android studio we need to annotate the function ( which is declared inside interface ) with @override.
Isn't that required for java programs outside android studio ?
@override is not mandatory beta. Not even in android.
@@Pepcoding ok thankyou sir
Amazing!
Thank you! Cheers!
can anyone please give me the link of fractional knapsak i'm unable to find it..
majha aa gya sir✨✨✨✨
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
very well explained
Glad you think so and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
awesome explanation
Glad it was helpful!
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
Can't we just store all values in the Prority Queue First and remove them one by one and print them while removing?
❤
Sir what if we add all the elements of all the arrays in priority queue and then peek and remove them all?
hey..are you following the babbar bhaiya DSA sheet??
Complexity will be high if you do so because inserting an element in pq takes log(n). For k^2 element it will be k^2 log k + k^2 iterations for inserting in pq
i have used hashmap + priority queue
Unda!
Thankyou beta!
Keep learning and keep watching😊
OP level explanation
Glad to know, that you love the explanation, for better experience and precisely arranged videos.
Visit - nados.pepcoding.com and sign up to NADOS.
Don't forget to follow us on Instagram instagram.com/pepcoding/
what if we add all the elements into a priority queue and simply remove elements from priority queue and just return it
its working for me
but I guess the time complexity will increase?is it?
Nah not sure about the time complexity but the space complexity is goona get O(sum of size of all arrays ) compared to O(k)
Visit - nados.pepcoding.com and sign up to NADOS.
You can ask your doubts on community tab. There are lots of programmers and mentors who can help you out with such doubts.
Don't forget to follow us on Instagram instagram.com/pepcoding/
Sir, u have not uploaded fractional knapsack?
beta daal denge.
what about :
for(int i = 0;i
TC: nlogn where n is the length of all lists combined, using heaps/pq tc gets reduced to nlogk where k is the size of lists array
Sir Fractional knapsack ki video nhi dali hai apne?
pure content video
sirf kaam ki chize karte ho aur logo ki tarah bakwas nahi
luv the video
Thankyou beta!
I am glad. Your kind words are the kind of motivation that truly help me in making more and more content. Especially, these days, not everybody is generous with motivating anybody either. It means a lot.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Keep learning and keep loving Pepcoding😊
@@Pepcoding yeah sure
public static ArrayList mergeKSortedLists(ArrayList list)
{
ArrayList rv = new ArrayList();
PriorityQueue pq=new PriorityQueue();
for(int i=0;i0)
{
rv.add(pq.remove());
}
return rv;
}
sir can we do like this.
compare to k andar pair other kya h? this to pair class ka value hai but other?
\
For clearing all your doubts and for best experience, visit on nados.pepcoding.com
Don't forget to follow us on Instagram instagram.com/pepcoding/
Sir cant we simply add all list in a priority queue and then print the priority queue ??
space jyada lag jaega. O(k) space allowed tha
PriorityQueue pq = new PriorityQueue();
for(int i=0;i
Sir, why didn't u use this simple method?
public static ArrayList mergeKSortedLists(ArrayList lists){
PriorityQueue pq = new PriorityQueue();
for(ArrayList ls : lists){
for(int num : ls){
pq.offer(num);
}
}
ArrayList rv = new ArrayList();
while(pq.size() != 0){
rv.add(pq.poll());
}
return rv;
}
Can anyone please help me telling that what will be complexities of this solution? Btw best video
Nlogk
Can we do all this in O(1) memory ?
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
@@Pepcoding cool, I'll ask over there.
Sir when are you uploading level up?
beta ek week baad
Bhai foundation toh pura krne de sir ko bhut cheez baki h
Sir C++ mein objects ki priority queue k liye comparable kaise likhte hai?
wahan operator overloading ek rasta hai, doosra functor hota hai. Operator overloading is the usual way.
Thank you for the reply sir.
class Pair
{
public:
int li;
int di;
int data;
Pair(int li,int di,int data)
{
this->li=li;
this->di=di;
this->data=data;
}
};
class FunctorCompare
{
public:
bool operator()(Pair a,Pair b)
{
return a.data>b.data;
}
};
priority_queue pq;
@@umangchhabra9678 Can you share your C++ code for this question, I wrote a code but it is not working bcoz of some errors
Sir fractional knapsack ka vedio nhi hai pepcoding ka ....
aditya verma ka dekh lo video
@@sauravdas7591 fractional greedy se hota hai wo nahi padhaya aditya verma ne
sir heaps ke questions mein confidence nhi aaya, i hope we will do atleast 20 more problems in LU+IP
we have a lot many in lu + ip. i think 100 ke kareeb hain, hashmap aur heaps mila ke
It is bfs
Kindoff
Ye other ki value kaha se aa rhi h. Compare this ko kis se karega samajh nahi aa rha
For better insight, visit nados.pepcoding.com, post your doubts, community will help you out there.
I have solved this by using stream API in Java 8
ArrayList result = lists.stream.flatMap(x->x.stream()).sorted.collect(Collectors.toCollection(ArrayList::new));
Sir iski complexity kya hogi?
nlogk
@@Pepcoding where n is total number of elements in all the arrays, correct?
@@hdang1997 where n is the number of elements in the longest list and logk is for the priority queue (enque/deque)
ignoring the number of list i.e since k
Sir, u have not uploaded fractional knapsack?
hanji beta, hashmap-heaps ke liye chodda tha firr choot he gya. karna hai
@@Pepcoding ok sir