class Solution:
    def firstPalindrome(self, words):
        for word in words:
            if word == word[::-1]: return word
        return ""
class Solution {
    public String firstPalindrome(String[] words) {
        for (String s : words) {
            StringBuilder sb = new StringBuilder(s);
            if (s.equals(sb.reverse().toString())) {
                return s;
            }
        }
        return "";
    }
}
Find First Palindromic String in the Array
Given an array of strings words, return the first palindromic string in the array. If there is no such string, return an empty string "".

A string is palindromic if it reads the same forward and backward.

&nbsp;
Example 1:

Input: words = ["abc","car","ada","racecar","cool"]
Output: "ada"
Explanation: The first string that is palindromic is "ada".
Note that "racecar" is also palindromic, but it is not the first.


Example 2:

Input: words = ["notapalindrome","racecar"]
Output: "racecar"
Explanation: The first and only string that is palindromic is "racecar".


Example 3:

Input: words = ["def","ghi"]
Output: ""
Explanation: There are no palindromic strings, so the empty string is returned.


&nbsp;
Constraints:


	1 &lt;= words.length &lt;= 100
	1 &lt;= words[i].length &lt;= 100
	words[i] consists only of lowercase English letters.


var firstPalindrome = function(words) {
    for (const word of words) {
        if (word === word.split('').reverse().join('')) return word;
    }
    
    return '';
};
class Solution {
    bool isPalindrome(string str){
        int i=0 ;
        int j=str.length()-1;
        while( i<= j ){
            if( str[i] != str[j] )
                return false;
            i++;
            j--;
        }
        return true;
    }
public:
    string firstPalindrome(vector<string>& words) {

        for(int i=0 ; i<words.size() ; i++){
            if(isPalindrome(words[i]))
                return words[i];
        }
        return "";
    }
};