Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
Biggest even palindrom
//Title of this code #include <iostream> using namespace std; bool isPalindrom(const string& s, int i, int j) { while (i < j) { if (s[i] != s[j]) return false; ++i; --j; } return true; } inline bool even(int n) { if (n & 1) return false; return true; } int biggestEvenPalindrom(const string& s) { int biggest = 0; for (int i = 0; i < s.length(); ++i) for (int j = s.length() - 1; j > i; --j) if (even(j - i + 1) && (j - i + 1 > biggest) && isPalindrom(s, i, j)) { biggest = j - i + 1; } return biggest; } int main() { cout << biggestEvenPalindrom("AABBcAADcAAc"); }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
replace-30-Seconds-of-C++
max subsequence of array
Kishan_Basic_Geometry
next permutation leetcode
Networked path_dp
Kth Smallest Element (with extra space)
PyramidTransitionMatrix_recursive
Addition of two matrix **Part 2
shared_ptr deleter
ONP
Please log in to post a comment.