409. Longest Palindrome | Hash Table | Greedy | Hot Interview Question

[@mugdhashrivastava]

hehe that ki haal chaal in intro every time is kinda cute

[@Saurabh_Shukla31]

class Solution { public: int longestPalindrome(string s) { int n = s.length(); int ans = 0; bool isodd = false; vector mpp(256, 0); for (int i = 0; i < n; i++) { mpp[s[i]]++; } for (int i = 0; i < mpp.size(); i++) { if (mpp[i] % 2 == 0) { ans += mpp[i]; } else { ans += mpp[i] - 1; isodd = true; } } if (isodd) { ans += 1; } return ans; } };

[@Manishgupta200]

Almost done by me. Good explaination

[@cdjamse3944]

worked for 46 test cases for me

[@ishan_19]

I don't know why I chose a lengthy approach of generating subsequences and checking the longest palindrome :) This is way better and much simpler to implement

[@anonymousanonymous7507]

ur original code?

[@spaceadvanture6458]

"aacc" ka kya, ye tho palindrome bhi nh hai,aur question mai diya nhi hai ki substrig palindrome hoga hi..

[@aizad786iqbal]

i did a similar approach and i got the result as 17 ms, is this just a leet code thing? one suggestion, start doing live coding instead, it'll be more helpful imo

[@tushar404]

yes it is although mera 100 % aagaya tha pehla attempt me hi

[@sanjivaniburma6171]

bhai ki x hai

[@UECAshutoshKumar]

Thank you

[@mayankshakya9200]

// isme kyu accept nhi ho rha?? class Solution { public: int longestPalindrome(string s) { int n=s.size(); unordered_mapmp; for(int i=0;i

[@tushar404]

bhai x ki mkc🤬😡 (3:00)