GFG LONGEST PALINDROMIC SUBSTRING (BRUTE FORCE)

#include <bits/stdc++.h>
using namespace std;

void printSubStr(string str, int low, int high) {
    for (int i = low; i <= high; ++i)
        cout << str[i];
}

int longestPalSubstr(string str) {
    int n = str.size();
    int maxLength = 1, start = 0;

    // Nested loop to mark start and end index
    for (int i = 0; i < str.length(); i++) {
        for (int j = i; j < str.length(); j++) {
            int flag = 1;

            // Check palindrome
            for (int k = 0; k < (j - i + 1) / 2; k++)
                if (str[i + k] != str[j - k])
                    flag = 0;

            // Palindrome
            if (flag && (j - i + 1) > maxLength) {
                start = i;
                maxLength = j - i + 1;
            }
        }
    }

    cout << "Longest palindrome substring is: ";
    printSubStr(str, start, start + maxLength - 1);
    return maxLength;
}

int main() {
    string str = "forgeeksskeegforgeeks";
    cout << "\nLength is: " << longestPalSubstr(str);
    return 0;
}