Відео

brother, your explanation style is great but one request give us a sample of java code also

bhaiya nodejs karna chaiye ya expressjs?

bhai nachna sa jayada batana ma dhayn dedeta usa sa jayada view aa sakta ha

Thank you so much brother

I don't understand how is it a graph question?

Nice❤

Preparation video link please

couldn't find a good video for this problem yet

Kon sa college se software engineering Kiya tha

Aap twins hai kya bhaiya

great explanation

worst explanation ever if not able to give intution then do not make the video for time pas

the best solutions videos on yt. no nonsense, to the point short sweet. thanks men, you guys deserve more subs!!

Wrong h bhai kya bakwas karta hai run karke bta bhai .

very nice explanation , bhaiya, thank you!!!

Bhai tum chhor do yaar padhana, aadhi chize to tum explain bhi nahi krte ho ki konsa variable kahan se initialize ho raha or kya initial value hai...

Fake as hell , the company every year in OA ask the same 3 qsn present on leetcode , the OA platform is dog shit , where if you will include bits/stdc++ no test cases will run , it will show empty , but if you include each header by its file then it will include , worst ever , their ctc breakup would also be scam 🤮🤮🤮🤢🤢

it fails for 10 9 8 as even if we takes 9 food daily we will not left with enough food to survive sunday

question wording dekhkke logic build nhi hota . dsa jm rha but cp nhi

khud ka hi revision chal raha tha

To everybody who is struggling #include<iostream> #include<vector> #include<algorithm> using namespace std; long long availableWood(vector<int> &arr , int n , int mid) { long long woodCount = 0; for (int i = 0 ; i<n ; i++) { if (arr[i] > mid) { woodCount += arr[i] - mid; } } return woodCount; } int maxHeight(vector<int> &arr , int n , int m) { int start = 0; int ans = 0; int end = *max_element(arr.begin(),arr.end()); while(start<=end) { int mid = start+(end-start)/2; if (availableWood(arr,n,mid) >= m) { ans = mid; start = mid + 1; } else { end = mid - 1; } } return ans; } int main() { int n,m; cin>>n>>m; vector<int> arr(n); for (int i = 0 ; i<n ; i++) { cin>>arr[i]; } cout<<maxHeight(arr,n,m); } This solution which I have written is 100 percent correct Your possible mistakes :: 1) use long long instead of int 2). use vector instead of array

Can students of different colleges participate together as a team members

you both lokes same

Informative

worst explanation just pasted the code from chat gpt, chat gpt has same code

😅😊

kya dikkat hai hindi me samjane me

My observation: here DP solution is not a good choice because at each step we are greedily returning either the max height or the max value

very good explanation , Thank you

Hi, is this building BLR26 or 27?

Hi Shailesh and Yogesh, love your videos! What's the best way to contact you?

the code provided in video is wrong. below is correct code. class Solution { boolean isSumTree(Node root) { boolean[] ans=new boolean[1]; ans[0]=true; int res=recurse(root,ans); return ans[0]; } static int recurse(Node root,boolean[] ans) { if (root==null) return 0; int left=recurse(root.left,ans); int right=recurse(root.right,ans); int sum=left+right; if (sum!=root.data && sum!=0) ans[0]=false; root.data+=sum; //System.out.println(root.data); return root.data; } }

bhaiya itna fast kyo bolte ho

for avoiding extra space due to recursive calls, we can use min-heap.

Thanks

great brother

Great video bro, understood in one go 👍

Please share your resume.

same thing by all the youtubers ...why you guys directly jump to the tabulation...you all should firstly tell recursive and memoized approach ....i know that they give TLE but you should tell that....isn't is ???

your approach is partially correct what if test case is "3 1 1 11 1 1 11" when traversed string"1111" from left and string "1111" from right will sum up to two in map but in real one is 11 and 1 on left and right and another one is 1 and 11. Actually yu need to add on space after every concatenation of root data to string so there will be difference between 11_1_1 and 1_1_11 here is corrected code -> unordered_map<string,int>m; string solve(Node*root){ if(!root) return "#"; string s=""; if(!root->left and !root->right){ s= s+to_string(root->data); s=s+"_"; return s; } s=s+to_string(root->data); s=s+"_"; s=s+solve(root->left); s=s+solve(root->right); m[s]++; return s; } int dupSub(Node *root) { // code here m.clear(); solve(root); for(auto x:m){ if(x.second>=2)return 1; } return 0; }

3 mins well spent

Time complexity O(n square)..

dicuss time and space complexity

Wrong 2 ko 1 se kaise join kra hai?

Bro, can you help with referral or how to apply @Amazon

Bhai question to padho row and column wise agar top to down and left to right usime ans dekhna he to gfg pe shi output diya he galat nahi😊

00:02 Exploration of finding minimum and maximum values in a BST 01:05 Exploring the two processes of approach and time to middle order of N in a BST 01:55 Finding min and max value in a BST 02:52 Understanding the properties of Binary Search Tree is crucial for finding min and max values. 04:33 Identifying min and max values in a Binary Search Tree 05:21 Understanding min and max value in a BST. 06:12 Find the minimum value in a BST 10:04 Finding min and max values in a Binary Search Tree (BST)

Nice🎉

BEST FR!

Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻