Відео

class Solution { public boolean predictTheWinner(int[] nums) { int total=0; for(int num:nums)total+=num; int [][]dp=new int[nums.length][nums.length]; for(int []arr:dp)Arrays.fill(arr,-1); int p1=recursion(0,nums.length-1,nums,true,dp); int p2=total-p1; return p1>p2; } public int recursion(int start,int end,int []piles,boolean p1,int [][]dp) { if(start>end)return 0; if(dp[start][end]!=-1)return dp[start][end]; if(p1){ int stTake=piles[start]+recursion(start+1,end,piles,false,dp); int endTake=piles[end]+recursion(start,end-1,piles,false,dp); dp[start][end]=Math.max(stTake,endTake); } else{ int stTake=piles[start]+recursion(start+1,end,piles,true,dp); int endTake=piles[end]+recursion(start,end-1,piles,true,dp); dp[start][end]=Math.min(stTake,endTake); } return dp[start][end]; } } can anyone tell me why this doesnt work for this problem?

class Solution { public: vector<vector<int>> dpInc; vector<vector<int>> dpDec; int calculateInc(vector<int>& rating, int idx,int count) { if (count == 2) { return 1; } if(idx>=rating.size()) return 0; if(dpInc[idx][count] != -1) { return dpInc[idx][count]; } int total = 0; for (int i = idx+1; i < rating.size(); i++) { if (rating[idx] < rating[i]) { total +=calculateInc(rating, i, count+1); } } return dpInc[idx][count]=total; } int calculateDec(vector<int>& rating, int idx,int count) { if (count == 2) { return 1; } if(idx>=rating.size()) return 0; if(dpDec[idx][count] != -1) { return dpDec[idx][count]; } int total = 0; for (int i = idx+1; i < rating.size(); i++) { if (rating[idx] > rating[i]) { total +=calculateDec(rating, i, count+1); } } return dpDec[idx][count]=total; } int numTeams(vector<int>& rating) { dpInc.resize(rating.size(),vector<int>(4,-1)); dpDec.resize(rating.size(),vector<int>(4,-1)); int ans = 0; for(int i=0;i<rating.size();i++) { ans +=calculateInc(rating, i, 0) + calculateDec(rating,i,0); } return ans; } };

I guess space complexity is O(N)

❤

Congratulations 👏.

Rank teams by vote wale questions me doubt ek video uspar banao na pls sir

sir please make video on minimum number of operations to make string sorted

Bhai maza aa gaya kya solution samjhaya hai

❤❤❤

Bhaiya, what's the reason to have a array size of "n + 1" in bottom-up approach?? How can we find whether to have a "n" sized array or "n + 1" sized array ? By the way, very well explained ❤

hard one becomes easy :) when it's @CodestorywithMIK!!! definitely one day you will be the king in DSA world.

can i directly jump to sliding window soln and skipping that binary wala sol becoz that seems to be difficult?

Thank you ❤, your explanation skill is simply amazing. The problems others are struggling in making understandable, you made it very easy. Once again, thank you ❤.

It was a hard problem but clearly explained ❤

Level of explaination is top-notch.. Thanku Sir😊

smjh nahi aaya aaj bhai

Kabhi Kabhi lagta hai => Apun hi bhagwan hai .❌ Kabhi Kabhi lagta hai => Apse DSA samajkar , Apun Dhanya ho gaya.✅

Starting this on 26th August 2024..

Mere gharwalo ne bola tha bas itni si salary ,aur baki relatives se compare kiyq jaise dekh uska beta 1 lakh kama rha tu aur tu dekh ,kuch kr nahi paya ....😢not everyone parent is same some are mean and dumb like mine

It gives TLE when implementing in java

Respect <3

Bhaiya with the help of your video soon I will be placed and I will reach out to you to tell my steps ....

using 1 map class Solution { public: bool isIsomorphic(string s, string t) { unordered_map<char, char> mpp; // length same given int i = 0; while (i < s.length()) { if (mpp.find(s[i]) == mpp.end()) // not there { for (const auto& pair : mpp) { // as actual mapp is {key ,val} pair if (pair.second == t[i]) { return false; } } mpp[s[i]] = t[i]; } else if (mpp.find(s[i]) != mpp.end()) // there { // if already presmt and now we got different val if (mpp[s[i]] != t[i]) // value was not as expected then not isomorphic return false; } i++; } return true; } };

In October 1990, my dad got his first salary of 400 rupees as a trainee. He kept them in a cover, and he never used it. He kept that first cover as a token of memory and spent the entire first month without making any expenditure at all (company took care of food and hostel during training). I joined my first paid internship in December 2017, and in January, when I got paid (₹16000), I did the same. I took a bank statement with this record (didn't dare to withdraw because of the recently happened demonetization though), and kept it in a cover. It's now right next to my dad's cover back home. I spent the money on saree for mom and a shirt and formal pants for dad, but I decided to keep that amount in my bank always.

You are really a gem I am studying for my interview right now with your channel.... waiting for the day when I will take my parents to dinner with my first income and give all my 1st month salary to them ❤

Incredible Brother🫶🏻

I bought my mom her favourite sweet with my first salary. I still have a picture of her eating that sweet. Will cherish it forever

@MIK playlist kab aye gi?

❤❤❤

Like you , I will also pay my education loan debt and will feel that feeling like you did. ❤

Yeah The Education Loan ❤❤

Wooooow....just woww.....i watched this video and boom...i coded my self..thank u mik

why the following approach didnt work : class Solution { public: int maximumRequests(int n, vector<vector<int>>& requests) { vector<int>in(n,0); vector<int>out(n,0); for(auto & it:requests){ int from = it[0]; int to = it[1]; in[from]++; out[to]++; } int cnt=0; for(int i=0; i<n; i++){ cnt+= min(in[i], out[i]); } return cnt; } };

Bhaiya preorder and post order ka bhi code comment me reply kr do please

I tried to solve this question by myself. I tried for 2 days but finally I lost to this question & had to see you video.😢