If you're watching the series, till this point, you are among the top 10%
@TheHariPutraOfficially
2 жыл бұрын
Bhaiyya ne friend function sikhaya hai kya
@rishabhsharma2046
2 жыл бұрын
@@TheHariPutraOfficially homework dia tha
@poisonaddict
2 жыл бұрын
when does this course finish ????
@unboxtheuniverse5336
2 жыл бұрын
now I m on lecture 75 😃 📌🚨📌🚨 Hello guys mene ek Tele👌gram grp banaya he jisme DSA busted ka HomeWork aur doubt discuss krege !! Grp is Public so anyone can chat. So if you want so you can join. Name 👉 Coding Aura {DSA Busted} discussion 👌...
@unboxtheuniverse5336
2 жыл бұрын
@Anurag correction in your calculation ... Only 3-4 % people yaha tak he
@ashutosh7133
Жыл бұрын
He is the only youtuber who kept his consistency and hard work, only youtuber to teach DSA as it should be taught!!!
@dushyantjakhar1716
9 ай бұрын
minmum of of ropes = use this test case [6,4,4,6] , with your logic the cost is 42 but if you pick 6 and 4 fist = [10,4,6] then again pick 4 and 5 = [10,10] then [20] then the ans is 40
@inter3988
3 ай бұрын
@@dushyantjakhar1716 "N ropes of different lengths"
@sakshamsharma3156
Жыл бұрын
Another approach for 1st question ::: int kthSmallest(int arr[], int l, int r, int k) { priority_queue q; for (int i = l ; i < r+1 ; i++){ q.push(arr[i]); } while (q.size() > k){ q.pop(); } return q.top(); }
@ravikumarmeena1547
Жыл бұрын
Nice
@shashwatdhingra3580
Жыл бұрын
here the space will be O(n) I think.?
@sakshamsharma3156
Жыл бұрын
@@shashwatdhingra3580 yes In that way sir's solution is better
@shashwatdhingra3580
Жыл бұрын
@@sakshamsharma3156 Yup Buddy! By the way, What are you doing now after completeing this Course?
@akashkumarsingh1296
Жыл бұрын
Time complexity is O(N log (k)) here but sir solution time complexity is O(K log(K)) .
@siddharthsingh5510
Жыл бұрын
In Question 3, Merge 2 binary max heaps, the following code is one another easy method. First make one vector c and push -1 inside it to make it one based indexing heap and then push all vector a elements inside it. After that put vector b elements in vector c using for loop, then this new element is transferred into its valid position according to heap using while loop. Time comlexity is O(mlogn) and space complexity is O(m+n). class Solution{ public: vector mergeHeaps(vector &a, vector &b, int n, int m) { vectorc; c.push_back(-1); for(int i=0; i
@sunilBhai-qn1ll
6 күн бұрын
It is easy but when you push b in a or merge them into a no extra space is used Also, Time complexity of building heap from a will be O(m+n) so tc is O(m+n) and sc O(1) also try to do question with 0 base indexing it is most commonly used in questions
@DilipKumar-si4ww
Жыл бұрын
One of the Best DSA course I have seen... OP NEXT LEVEL!!!
@yogeshsharma24
2 жыл бұрын
Let's welcome again with best DSA lecture
@meme_eternity
2 жыл бұрын
watched till heap on apni kaksha now watching heap and further from here wonderful explanation bhaiya
minmum of of ropes = use this test case [6,4,4,6] , with your logic the cost is 42 but if you pick 6 and 4 fist = [10,4,6] then again pick 4 and 5 = [10,10] then [20] then the ans is 40
@user-ho6br9um3p
6 ай бұрын
@@dushyantjakhar1716 length of ropes are different
@RohitRana-tz2lr
2 жыл бұрын
Thanks, bhaiya for all the efforts and hard work which you are doing for us... hats off to you..consistency++
@preetomadityapranoy429
9 ай бұрын
This series is just great. Keep up the good work. I'm gaining confident watching this series. This is best.
@smartcoding174
2 жыл бұрын
mind blowing explanation.... No words for thanking you.... still thanks a lot 🙏🙏🙏
@shivkumar-og4ow
2 жыл бұрын
Present guru ji Consistency ++ Thank you for your Hard work bhaiya
@sunnykumarpal9679
Жыл бұрын
Thank you bhaiya for providing this amazing content .It helped me a lot to learn heaps concept.
@prashantbirajdar9271
2 жыл бұрын
wahh bhiyaa mzaa a gya subkuch samaj bhi a gyaa niceee...
@parthsharma5966
2 жыл бұрын
Consistency high hai bhaiya welcome back.... Thanks.
@roshni9320
2 жыл бұрын
you are such a hard working person...wish to be like hard worker like you💓
@hamzamustafa9364
Жыл бұрын
Hello Love Babbar bhaiya , wanted to thank you from bottom of my heart for this course . I am a BCA student from Bangalore , college never taught 10 percent of what you have taught in this full course . I was struggling to find free course regarding DSA and luckily i landed upon code help , it's been around four months with DSA and never felt stuck , seeing each video of your's and then trying to solve problems on my own has been an amazing journey . Thank you sir , what all i have learnt is because of this channel. Have written comment here with the intention you will reply 😂. May your channel keep growing 🥰🥰and you reach out to entire world. Love from Bangalore❤❤❤....
@Vivek-yadav-
2 жыл бұрын
best DSA course so far❤
@ankushagarwal5926
2 жыл бұрын
Great video sir. Thank you so much !!!
@adityanigam8373
2 жыл бұрын
Thank You bhaiya for this amazing Course
@harpratapsinhnakoom3540
2 жыл бұрын
feels good to be consistent
@haiderali0801
2 жыл бұрын
Thankyou bhaiya for this DSA course ✨
@rky3057
2 жыл бұрын
bhaiya aapka study karane ka tarika bahut aacha hai . kaise solve karna hai problem ko ,approach kya hai ye bahut aacha btatate ho aap. thankyou bhaiya
@yashgupta4866
2 жыл бұрын
Bhaiya thanku for this amazing course
@AS-gf3ci
11 ай бұрын
Better Approach for finding kth largest/smallest : For kth Largest Element : (instead of running 2 loops, we can do it in a single traversal) //Create Min Heap priority_queue pq; for(int i=0; i k) pq.pop(); } return pq.top();
@26-tycm-i-durveshjagtap26
9 ай бұрын
Good optimization
@arpityadav8902
9 ай бұрын
Nope in your Code Time complexity will Be O(N*LOgN) . But if you are using two Loop s From Zero to k TC - O (K *LogN) And from k to n Tc - O (N-K)*LoGN Overall TC Will be max of above two, which will be lesser than O (N LogN)
@amanrehman8281
8 ай бұрын
@@arpityadav8902 Using the 2 loops the TC would be O(K + (N-K)LogK) actually.
@govindsuryavanshi6653
11 ай бұрын
First I have completed all DSA series and now conclude this is Greatest ever DSA series to exists on youtube or paid courses. Your contribution will be remembered. You're God of DSA for us🙇♂ Thanks you.
@9852963775aaa
2 жыл бұрын
Thankyou so much bhaiya amazing content
@uditpanjiyar3203
10 ай бұрын
last question concept is mind blowing👍👍
@ravivishvas3676
2 жыл бұрын
T.C. of kth smallest element is O(nlogK)
@gantakailashnath
10 ай бұрын
How time complexity is O(logk). Can you explain
@BereniceVirginis
2 ай бұрын
In "Is Binary Tree Heap" problem, in isMaxOrder function, we have to use = sign for comparing parent node value to it's children, because the heap condition (max heap) is "child
tabiat bohot kharab hone k karad puri padai bich me ruk gyi thi, vapis aake ye playlist continue krke acha laga
@fenil_panseriya9691
2 жыл бұрын
👌👌💪 maja aa raha hee 👍🔥🔥
@kapilramwani8417
2 жыл бұрын
Best Explanation for heap
@anuptewary3016
2 жыл бұрын
Present bhaiya and maja aa rahe hai bhaiya ❤️
@vaibhavagarwal4564
2 жыл бұрын
Thanks for this useful video
@avishkarpatil5871
5 ай бұрын
18:32 // Kth Smallest element: Time Complexity - O(r Log k) In which, r = total no. of elements, k = size of priority queue
@sanketswaroop3519
5 ай бұрын
yeah correct.
@pabitra344
Ай бұрын
O((r-k)LogK) hoga na
@sherebanoburhani8939
2 жыл бұрын
Present Bhaiya Loving the videos
@aaravkumar1308
2 жыл бұрын
bhaiya aapki consistancy ki daat deni pdegi ! tysm
@KratosProton
2 жыл бұрын
Great explaination
@muhammadsuleman8936
11 ай бұрын
Amazing lecture brother
@aniketpanchal1382
2 жыл бұрын
your consistency is op bhaiya
@anuragraut5101
2 жыл бұрын
mast video tha, 1 week se dsa nhi kar paya kyuki college ke exams the ,aaj se firse dsa chalu;😤
@Omgupta520
Ай бұрын
thank you so much for providing so valuable content
@naveensingh_0735
2 жыл бұрын
Thank you for this
@yashasvic2429
Жыл бұрын
Thank You So Much Brother 👍
@malikaamalhotra8397
Жыл бұрын
thanks bhaiya great content;
@sjcreations2490
2 жыл бұрын
attendance marked bhaiya. nice👍
@focus.placement5589
2 жыл бұрын
waaaah bhaiyaa thanks a lot 😍😍😍😍
@akankshapandey9773
2 жыл бұрын
Thanku Sir 🙏🏻
@AmrutanshuMishra-dp1mf
9 ай бұрын
amazing video as always!!!!!!
@utkarshsingh1457
2 жыл бұрын
Loved the content
@kamyaverma3010
Жыл бұрын
love the series!!!
@komaldewnani5747
2 жыл бұрын
Thank you so much bhaiya ☺
@ranasaad2035
11 ай бұрын
love this dsa course
@sportsclub725
Жыл бұрын
Best lecture 😀
@VinodKumar-hm6do
2 жыл бұрын
Amazing 🔥
@TechUprise-by-Jyoti
2 жыл бұрын
Thanks bhaiya😇
@praveennawal6918
Ай бұрын
duniya hila denge.
@slayer8792
Жыл бұрын
great video bhaiya
@priyanshugoyal2539
2 жыл бұрын
Present Bhaiya Ji ❤️ Background change😄
@raghavmanish24
4 ай бұрын
i'm here after completing the previous all videos thanku bhaiya g
@sunnysingh1267
2 жыл бұрын
Question 1 using min heap if anyone is interested :- priority_queue pq; for(int i=l;i
@shailesh9820
2 жыл бұрын
time complexcity of this solution is high
@vedantchaudhari2672
Жыл бұрын
consistency wah wah
@deepakgshorts100
8 күн бұрын
Learn a lot sir thank you ❤❤❤❤
@BornHubisLive
Жыл бұрын
Thanks a lot BHAIYA.........
@sailendrachettri8521
2 жыл бұрын
Let's go for next VDO
@user-yo7sg2ei7b
11 ай бұрын
you are best bhaiya
@DP-lk9kp
Жыл бұрын
sir salute to you
@shubhamkumarsingh8818
9 ай бұрын
thank you bhaiya
@063himanshumishra4
2 жыл бұрын
Bhaiya moj kr dii
@Ram_sujan_rajak
9 ай бұрын
maja aya bhaiya 👍👍🔥🔥
@kushh7550
Жыл бұрын
Thanks bhaiya!
@amishapandey6875
Жыл бұрын
Present Bhaiya!
@ERROR-os9wm
Жыл бұрын
Here Is the Code for Last Question void convert(BinaryTreeNode* root,vector &inorder){ if(root == NULL){ return; } convert(root->left,inorder); //Left Call inorder.push_back(root->data); //Root Data convert(root->right,inorder); //Right Call } void fill_pre(BinaryTreeNode* root,vector &inorder,int &index){ if(root == NULL){ return; } root->data = inorder[index++]; fill_pre(root->left,inorder,index); //Left Call fill_pre(root->right,inorder,index); //Right call } BinaryTreeNode* convertBST(BinaryTreeNode* root) { vector inorder; int i=0; convert(root,inorder); fill_pre(root,inorder,i); return root; }
@prakashnandan7337
Жыл бұрын
thanks
@saurabhagrahari7800
Жыл бұрын
This approach gives TLE on the geeks for geeks, for bst into max heap
@peddabeeramadhuri2343
Жыл бұрын
@@saurabhagrahari7800 yeah! did u figure out y?
@saurabhagrahari7800
Жыл бұрын
@@peddabeeramadhuri2343 Not yet, I left and moved on to the other questions. I will look into this later once I cover all the topic. BTW If you get why it is so, please let me know
@itsmepratham2712
11 ай бұрын
@@saurabhagrahari7800 For Max Heap Conversion we need to change the order in both when finding inorder and when changing the data so the below code will work at that moment /* void inorder(Node* root,vector &store){ //base case if(root==NULL) return; inorder(root->right,store); store.push_back(root->data); inorder(root->left,store); } void solve(Node* root,vector &store,int &index){ if(root==NULL) return ; root->data=store[index++]; solve(root->right,store,index); solve(root->left,store,index); } void convertToMaxHeapUtil(Node* root) { vector store; inorder(root,store); int index=0; solve(root,store,index); } */
@suchetapal713
Жыл бұрын
For 1st question, time complexity is O(n logk)
@ayushgoel4145
2 жыл бұрын
Thankyou Bhaiya
@nayanjaiswal
2 жыл бұрын
Present sir 🙏
@vaibhavagarwal1479
8 ай бұрын
Crazy approach last question
@shivshankarkumarchaudhary6903
9 ай бұрын
Another solution for this question int kthSmallest(int arr[], int l, int r, int k) { priority_queuepq; for(int i=0; i
@aparnamanna1369
2 жыл бұрын
Lecture op Attendance op Babbar bhaiya op
@jaylandge7517
11 ай бұрын
class Solution { public: int findKthLargest(vector& nums, int k) { sort(nums.begin(),nums.end()); return nums[nums.size()-k]; } }; This is a two liner for the first question if we have to to in space complexity = O(1) time complexity = O(n*logn)
@rishabhsharma2046
2 жыл бұрын
Present ❤️ Bhaiya updated dsa sheet plz 🥺
@jogindrasingh6139
2 жыл бұрын
dhanyvaad bhaiya
@rachit_joshi
Ай бұрын
Thank You So Much BHRATA SHREE !!!!!!!
@Rahul-ls4ju
2 жыл бұрын
thanks bhaiya..
@sagarprajapati6026
10 ай бұрын
consistency++ bhaiyaa
@harmankour1711
3 ай бұрын
we can also merge the two binary heaps by using priority queue.
@ashishsulakhe3894
2 жыл бұрын
In the kth smallest element question, why are we not solving the question using minHeap priority queue, we just need to get the top and pop and then check the k value... priority_queue minHeap; for(int i=l;i
@aryanmaurya3261
2 жыл бұрын
here space complexity increases to O(n) instead of O(k)
@MEBNAMANAGRAWAL
2 жыл бұрын
t.c. of your approach is nlog(n) and s.c. is o(n) but the bhaiya's approach having t.c. as o(nlog(k)) and s.c. as o(k).
@ashishsulakhe3894
2 жыл бұрын
@@MEBNAMANAGRAWAL Thanks for clearing the doubt
@supersuperhero2449
11 ай бұрын
@@MEBNAMANAGRAWALbhaiya, babber bhaiya tc , is nlogk, how? First loop tc is klogk and 2nd loop tc is (r-k) log(r-k) , how their sum becomes nlogk?
Пікірлер: 414