1371. Find the Longest Substring Containing Vowels in Even Counts | Leetcode POTD Explained

[@codeby_naruto]

Code :-
class Solution {
public:
int findTheLongestSubstring(string s) {
unordered_map hash = {
{'a', 1}, {'e', 2}, {'i', 4}, {'o', 8}, {'u', 16}};
vector 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;
}
};

[@saisampath3872]

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

[@codeby_naruto]

Thank you ❤️❤️

[@yashpant8055]

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

[@codeby_naruto]

Thank you ❤️❤️, I will do..

[@shubhamjaiswal7645]

very nice explanation

[@codeby_naruto]

Thank you ❤️❤️

[@a3rdtierguy864]

Bhaiya please provide us solution of contest question solution please

[@codeby_naruto]

Yaa sure ❤️