วีดีโอ

Today potd please

Jeevesh bhai...aap writing interface kaunsa use karte ho??

Nice Explanation, method of prefix creation is awesome, I have done this using substr() function, but this one is vrery very much better

very good explanation

nice one

how this red line is reflecting .. let me know if possible; like I was searching for a while for this query

good explanation sir ji

bhai jara bolne ke speed ko kam kar or sath ke sath hopeless mat ho , kabhi kabhi kudh hi confuse lag rhe ho

you have described well but don't be in hurry.Overall good explanation.

Awesome Approach, Bro! 💯👏

perfect bro

ye aap kon se board par padhate ho please can you share some details kyoki ye wala marker mere ko milta hi nahi maine bahut sare online board use kar liye please share some details related to software components nad hardware also. jisase padha sake online

acha explain kiya hai , bus ek bar dry run kar te toh aur acha

def lexicalOrder(self, n: int) -> List[int]: return list(map(int, sorted(list(map(str, range(1, n+1)))))) bro is this approach valid??

Absolutely the Best Explanation, Bro! 🔥

I solved using brute force which is O( N)^2, it passed all the tests cases but Leetcode did not raise TLE, why?

no worries... we got your point... sometime it happens .... everything except the lps part was 100% correct .... shoutout to you for your consistency

Sorry Everyone When s[i]!=s[j] then i need to fill longPal[j] = 0 but i fill longPal[j] = prev value Correct one is [0 1 0 0 0 1 2 2 0 1 2 2 3 4 5 6 7 0]

Your dry run was completely wrong! I checked it using testcase on leetcode.

Hey! you consistency is really amazing

Solution was easy to follow and articulated well! Thanks

Amazing explanation !!

Very nice explanation

Thank you for the explanation

nice explanation

very nice solution brother ...i have subscribed your channel

You can also upload gfg POTD

Great today u provide source code in git hub ❤❤

bhaiya custom sort ka utna syntax dekar fill nhi aa rha ye to kuch true false karke work karta hai jaise hm ordering defined comparator in priority queue bhaiya ek video please banao comparator, string important function like istringstream and different function and custom sort aur acche se samjhane ke liye please

Unable to build up the approach today approach aa gya tha user defined sorting ka syntaax nhi pta tha so here

Source code provide kro subscriber boom karenge ❤❤❤❤❤❤

Make video of how to understand constraints ❤

1 number

Code :- class Solution { public: vector<string> uncommonFromSentences(string A, string B) { unordered_map<string, int> count; istringstream iss(A + " " + B); while (iss >> A) count[A]++; vector<string> res; for (auto w : count) if (w.second == 1) res.push_back(w.first); return res; } };

very nice explanation

Code :- class Solution { public: int findMinDifference(vector<string>& T) { vector<int> ans; for (auto time : T) { string hour = time.substr(0, 2), minute = time.substr(3); int TotalMin = stoi(hour) * 60 + stoi(minute); ans.push_back(TotalMin); } sort(ans.begin(), ans.end()); // Adding the difference between the first and last times accounting for // wrap-around ans.push_back(ans[0] + 24 * 60); int minDiff = INT_MAX; for (int i = 1; i < ans.size(); ++i) { minDiff = min(minDiff, ans[i] - ans[i - 1]); } return minDiff; } };

Wow nice approach please explain intuition. After hearing you for 5 mins i was able to solve it. Thanks bhai!!!

Bhaiya please provide us solution of contest question solution please

You explain nice from others make more video on other important question

@codeby_naruto can you plz tell me what is wrong in my approach class Solution { public: int maxi=INT_MIN; void checkforeven(unordered_map<char,int>&mp,unordered_map<char,int>&mp1,int i){ int v=INT_MIN; for(auto it:mp){ if((it.second%2!=0)){ v=max(v,mp1[it.first]); } } if(v!=INT_MIN){ maxi=max(maxi,(i-v)); } else maxi=i+1; } int findTheLongestSubstring(string s) { unordered_map<char,int>mp,mp1; for(int i=s.size()-1;i>=0;i--){ if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u'){ mp[s[i]]=i; } } for(int i=0;i<s.size();i++){ if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u'){ mp1[s[i]]++; } checkforeven(mp1,mp,i); } return maxi; } };

very nice explanation

Code :- class Solution { public: int findTheLongestSubstring(string s) { unordered_map<char, int> hash = { {'a', 1}, {'e', 2}, {'i', 4}, {'o', 8}, {'u', 16}}; vector<int> bitset(32, -1); int mask = 0, maxLen = 0; for (int i = 0; i < s.size(); i++) { mask = mask ^ hash[s[i]]; if (mask != 0 && bitset[mask] == -1) bitset[mask] = i; maxLen = max(maxLen, i - bitset[mask]); } return maxLen; } };

very good

Code :- class Solution { public: int longestSubarray(vector<int>& nums) { int x = *max_element(nums.begin(), nums.end()); int ans = 0, len = 0; for (int num : nums) { if (num == x) ans = max(ans, ++len); else len = 0; } return ans; } };

good solution

Code :- class Solution { public: vector<int> xorQueries(vector<int>& A, vector<vector<int>>& queries) { vector<int> res; for (int i = 1; i < A.size(); ++i) A[i] ^= A[i - 1]; for (auto& q : queries) res.push_back(q[0] > 0 ? A[q[0] - 1] ^ A[q[1]] : A[q[1]]); return res; } };

very nice approach

Code :- class Solution { public: int countConsistentStrings(string allowed, vector<string>& words) { int res = words.size(); bool alpha[26] = {}; for (char c : allowed) alpha[c - 'a'] = true; for (string word : words) { for (char c : word) { if (!alpha[c - 'a']) { res--; break; } } } return res; } };

very good explanation

Code :- class Solution { public: int minBitFlips(int start, int goal) { int X = (start ^ goal); int count = 0; while (X) { if (X % 2) count++; X /= 2; } return count; } };