2108. Find First Palindromic String in the Array

Description

Difficulty: Easy

Related Topics: Array, Two Pointers, String

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.

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.

Constraints:

• 1 <= words.length <= 100
• 1 <= words[i].length <= 100
• words[i] consists only of lowercase English letters.

Solution

Language: Java

class Solution {
    public String firstPalindrome(String[] words) {
        
        for(String word:words){
            
            int s = 0;
            int e = word.length()-1;
            boolean isTrue = true;
            while(s<e){
                if(word.charAt(s)!=word.charAt(e)){
                    isTrue = false;
                    break;
                }
                s++;
                e--;
            }
            if(isTrue) return word;
        }
        
        return "";
    }
}