• Mar 12, 2026 •prakhar.dev101-263b
0 likes • 2 views
class Solution { public: bool isGoodLength(int len, string& s) { } string longestPalindrome(string s) { int l = 1; // a string of length 1 can always be a pallindrome int r = s.length() + 1; // it is impossible to find a string of length s.length() + 1, leave alone pallindromic while(r > l + 1) { int mid = l + (r - l) / 2; if(isGoodLength(mid, s)) { l = mid; } else { r = mid; } } } };
• Aug 7, 2024 •naiferomar366-60ef
aaaa
• Mar 29, 2023 •Helper
1 like • 3 views
test
• Feb 21, 2025 •leafboo
0 likes • 1 view
console/log
• Aug 17, 2025 •shekhar771
dzdzvcsd,v sd,.v, v,. ,.v , ,,vd,v dv
• Jun 1, 2025 •abeRodrz99
0 likes • 3 views
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Document</title> </head> <body> </body> </html>