Video

Sir web development ka price 4000 kar dijiye

Nice video rohit sir

amazing lecture

Asahan hai

sir in question of n meetings if there are multiple meetings with the same end time, we should consider their start times to break the tie i think if we change function of comp to this static bool comp(const pair<int, int>& a, const pair<int, int>& b) { if (a.second == b.second) { return a.first < b.first; // Sort by start time if end times are equal } return a.second < b.second; // Otherwise, sort by end time }

sir what is the name of platform which you are using which looks like leetcode

Chamak gaya Sir g

leftmax[0]=height[0] , rightmax[n-1] = height[n-1]; leftmax[i] = max(leftmax[i-1],height[i]); not height[i-1] same as for right max in extra array method

❤🙏🏻❤️❤️❤️🙏🏻

best video and detailed video for avl tree

best DP Lecture

best lecture

2nd que me hum ek traversal me hi kr skte hai na bhaiya agar me map use kru answer k liye aur LEFT SIDE VIEW video wali technique lagau to

Veryyy nice content

Bhaiya hum top view prblm wala hi approach lagaye 1st question me b , aur root node ka index : left mostt index*-1 krke dede aur phir level order traversal lagaye to hum ek hi 2d array me kr skte hai na que ko?? Aur wo jyada easy nhi hoga answer me store krna?

Thank you very much sir for making India's most comprehensive and best course on DSA

great i understand it very easily thanks sir

outstanding bhaiya....but my faculty is crying in corner..

Thank you bhaiya or Bhaiya Reciever k pass sender ka hashCode kha sai aata hai??????????????????????????????

best dp course pehele kar deta hoon bad mein bhool jaunga❤

Bhaiyya please continue this never stop you're best teacher of dsa ❤

this problem is same as the generate paranthesis lecture 61 but little bit modification.... chamak gaya bhaiya....

46:45 47:03 56:35 1:02:16 1:05:24

Broooooo.................HATSOFF AND SALUTE BRO.............❤❤❤❤👌👌👌👌..............NOONE LITERALLY NOONE EXPLAINS IN SUCH DEPTH....................COMMENTING AFTER SEEING YOU GETTING COUGH AT THE LAST................SALUTE TO YOUR SKILL...............AND TO YOUR KIND HEARTEDNESS

Day 5/ 180 complete Sir Homework Problem Solution 1.int i; // for (i = 280; i >= 250; i--) // { // cout << i << endl; // } // 2.char ch; // for (ch = 'A'; ch <= 'Z'; ch++) // { // cout << ch << endl; // } // 3.char ch; // for (ch = 'Z'; ch >= 'A'; ch--) // { // cout << ch << endl; // } // 4.int i; // for (i = 200; i <= 730; i = i + 7) // { // cout << i << endl; // } // 5.int n; // cin >> n; // n = n * (n + 1) / 2; // cout << n; // 6.int n, i, cube; // int sum = 0; // cin >> n; // for (i = 1; i <= n; i++) // { // cube = pow(i, 3); // sum = sum + cube; // cout << sum; // } // 7.int a = 0; // int b = 1; // int n; // cin >> n; // cout << a << " " << b << " "; // for (int i = 1; i <= n; i++) // { // int nextnumber = a + b; // cout << nextnumber << " "; // a = b; // b = nextnumber; // } #180daysofcode