Відео

You said there is no recursive extra space used but in the editorial they mentioned that there will be O(N) extra space for recursive stack could you clarify that ?

new fear unlocked learning DSA after seeing this DSW algorithm as a beginner🥲🥲

Maksad pura ho gya 👍

dp without any additional flags/states: dp[i + 1] = max(dp[i + 1], dp[i] + a[i]); dp[i + 2] = max(dp[i + 2], dp[i] + a[i] - a[i + 1]);

bhai ive watched at;east 10 15 videos on lps kmp but could'nt get the intuition for some time i could mug up..but forget after some time...this time i got the proper intuition thanks so much

💀😂

You and neetcode both rock🤟🤟🤟

@18:47 in the example u took in the code it should be parent->left = temp , and this code works in the final code beacuse we are doing left rotations only in the right subtrees of the skewed vinetree .

please explain when i am taking vector<int> arr for storing the values in sorted order , and then making tree from the arr is taking 762ms while vector<TreeNode*> arr is talking 62ms . why the time is differed this much ?

Some hints 😊: 1. gather into list 2. use partition to divide on equal parts

Have they asked AVL Tree by using confusing language?

The level motivation this guy has is astounding

how are you this much consistent bro😱😱

very nice explanation. I appreciate your efforts brother. I also have an ques, in the video you said that we "assume" that this is gonna give us a perfect tree, so i wanna know that does this algorithm have a fail or that was your way of teaching?

Simpil bro, simpil)

I guess the 2nd approach fails for this testcases like "***(((" as the approach will return true but its not.

waiting for today's dc in place modification approach 🥲

don't try to over act plz explain the solutions calmly.

how are you considering the fact that if we are going on to a node B via a node(lets say A) such that to reach that A the disapperaing time was okay for A but how can you say that if we go to B the node A still present there. In short how are you sure that to go to some far nodes how the closer noodes are gonna be still not disappeared.

easy ko tough bana dete ho bhai

awesome explanation

floyd warshall

❤

my dumbass thought vertical order traversal to get the sum of all the right nodes

first time hindi me suna apko

Great explanation!

today i learned how to use inputs for our advantage, and also learned the beautiful technique of flipping of bits without actually flipping them, but by just knowing the fact that "a bit flipped even times will remain same and flipping it odd times will change it". thanks aryan bhaiya

I am getting Memory Limit Exceeded, #define ll long long int class Solution { public: vector<vector<vector<ll>>> dp; ll solve( vector<int> nums, int i, int start, int sign ) { if( i == nums.size() ) return 0; if( dp[i][start][sign] != -1e15 ) return dp[i][start][sign]; ll answer = -1e15; if( start == 0 ) answer = max( answer, nums[i] + solve( nums, i+1, 1, sign^1 ) ); else { if( sign == 0 ) answer = max( answer, nums[i] + solve( nums, i+1, 1, sign^1 ) ); else answer = max( answer, -nums[i] + solve( nums, i+1, 1, sign^1 ) ); answer = max( answer, solve( nums, i, 0, 0 ) ); } return dp[i][start][sign] = answer; } ll maximumTotalCost(vector<int>& nums) { dp = vector<vector<vector<ll>>>(nums.size()+1, vector<vector<ll>>(2, vector<ll>(2, -1e15))); return solve(nums, 0, 0, 0); } }; Can anyone help me please?

thanks aryan GOAT

nice solution and great explaination Just want to ask if partition DP will work on it or not?

Bro 4th question kahan hai?

this code is failing on the last test case on leetcode

how does code figure out sub nodes are called leftNode and rightNode?

Can you make a playlist for 150 leetcode interview questions

can you please explain how recursive is using O(n) space , in itertative it's because of stack

remember cheaters you have to sit in an interview. No telegram or youtube is gonna help you there all you guys who cheat are doing nothing but demotivating average programmer like me who works hard and don't have enough money to buy solutions like you. like other humans i am also not too honest but cheating on a regular basis is never gonna help you.

I can't believe myself that i done this problem without watching this video . Because it's my first tree problem ,I just saw GFG how to traverse tree and came up with solution which passed all testcase in single run with time complexity O(N) class Solution { public: int sum=0; void update(TreeNode* node){ if(node==nullptr){ return; } update(node->right); sum+=node->val; node->val=sum; update(node->left); } TreeNode* bstToGst(TreeNode* root) { update(root); return root; } };

I didn't do any tree question till now should i do this ?

awesome video bro.. could you please upload the other parts as well😊

Bhai 34th test case ne pahd diya 🤣🤣

very very good

Please someone tell me whats wrong in my code; int n = arr.size() , m = brr.size() , gp = 0; map < ll ,ll > factors; for(int i = 0; i < m; i++) factors[brr[i]]++; for(int i = 0; i < n; i++){ if(arr[i] % k != 0) continue; int x = arr[i] / k; for(int j = 1; j * j <= x; j++){ if(factors.find(j) != factors.end()) gp += factors[j]; if(j != (x / j) && factors.find(x / j) != factors.end()) gp += factors[x / j]; } } return gp;

great content......now i get why this guy is a gold medalist in NIT

Great explanation!!

1st two was coming in this Biweekly Contest...

Contest ke questions Bhi saath mein ho gaye

a doubt: changing the input array (making element = 2) will still count as O(n) space, how/why?

absolutely loved your explanation and the consistent uploads. its baffling how you don't have more audience, wishing you all the very best! and thanks alot!

Thank you bro You are genius.

Can you try to explain your dry runs in a more concise manner? I feel like you are trying to spoon-feed the logic which makes the explanation unnecessarily difficult to understand.