Видео

Like always, loved your explanation, liked the video, and added a comment as gratitude! 💝

int setBits(int& a) { int cnt = 0; int temp = a; while (temp) { if (temp & 1)cnt++; temp = temp >> 1; } return cnt; }

Thank you so much for this great explanation!

Thank you, ma'am. I love your approach to studying the problem statement & come up with the observations to determine the next steps to solution

Thank you so much for such a great explanation, ma'am! 🙌

Good Explanation keep it up

Thank you so much for such a great explanation ♥!

good explanation

Very good explanation How to learn explain like u

Thank you 👍

Thank you 🙏

Thank you very much, alternative startswith & endswith methods also work here!

Do NOT discontinue doing this please

Thank you, ma'am. I understood your explanation and went ahead with solving it with Set for efficiency in lookup, let me share: - Sort the array by length - Convert the sorted list into a Set - Run a for loop for each word inside words list - Pop the item we are searching from the Set - Lookup into the Set and try to find that word's existence as a sub-sequence in the remainder of words - Apply break once found a match and append the word into the output/result array

❤

❤❤

Thank you 🙏

❤

how am I suppose to come up with this in an interview ??? luck game it is.

class Solution { public: string shiftingLetters(string s, vector<vector<int>>& shifts) { string temp=s; for(int i=0;i<shifts.size();i++) { int start=shifts[i][0]; int end=shifts[i][1]; int direction=shifts[i][2]; if(direction) { for(int j=start;j<=end;j++) { int x=temp[j]; if(x=='z') temp[j]='a'; else temp[j]++; } } else { for(int j=start;j<=end;j++) { int x=temp[j]; if(x=='a') temp[j]='z'; else temp[j]--; } } } return temp; } }; brute force. gives TLE. So i am here

I can understand the problem but i donno how to implement it in code😢.

Thank you 😊

♥♥♥♥

Great!

♥♥♥

Thank you, ma'am!

❤❤

Thank you, and happy new year, ma'am. The Greatest aspect of your videos is how awesome you explain the problem statement and gradually proceed towards building the solution!

Loved your explanation ❤

❤

Thank you so much, ma'am!

Happy new year ❤🎉

Thank you so much for this great explanation & keeping the implementation simple, ma'am!

Thank you, ma'am. I think the regular recursive approach to solve a big problem and memoization of the sub-problems is the Top-down approach & the Bottom-up approach basically indicates solving all subproblems iteratively with Tabulation. In summary: - Top-Down: Recursive + Memoization - Bottom-Up: Iterative + Tabulation

Thank you, ma'am!

Thanks for explaining. Instead of pure DP, I went ahead with DP+Greedy approach by initially preparing the max sub-array sum similar to what you explained here. However, next I built a left max sub-array & right sub-array; Furthermore, the solution was retrieved by optimally choosing the middle sub-array! Anyway, I have plan to learn the approach that you explained too.

thanks for helping.

Well Explained!!

Thank you so much!

Nhi samjha :(

Thanks so much for covering recursive approach alongside optimizing it by memoization & dynamic programming, Wow!

my recusive solution class Solution { int tryAllWays(int index,int &cnt,vector<int>& nums,int sum,int target) { if(index==nums.size()) { if(sum==target) { cnt+=1; return cnt; } return cnt; } // sum+=nums[index]; tryAllWays(index+1,cnt,nums,sum+nums[index],target); tryAllWays(index+1,cnt,nums,sum-nums[index],target); return cnt; } public: int findTargetSumWays(vector<int>& nums, int target) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int cnt=0; return tryAllWays(0,cnt,nums,0,target); } };

Jump game solution was so elegant 😍

I am struggling with DP questions. Any sources you wanna mention from where you learnt it ? Last question Target sum I was able come up with the recursion solution but not the dp one. 😢

👍

Really appreciate your effort to explain the problem statement and solutions in small breakdowns 😇

Thank you so much!

Thank you so much for the explanation!

Thank you for the explanation, however, I went ahead with DFS for this problem!

❤