2108. Find First Palindromic String in the Array

Complexity
Time complexity :
O(n.m)
(n is the number of words in the input array and m is the maximum length of a word)

Space complexity:
O(1)

------------------------------------------------------------------------------------------------


class Solution {
public:
    string firstPalindrome(vector<string>& words) {
        for (string str : words) 
            if (isPal(str)) return str;
        return "";
    }
    bool isPal(string s) {
        int j = s.size() - 1;
        for (int i = 0;i < s.size() / 2;i++) 
            if (s[i] != s[j - i]) return false;
        return true;
    }
};