LC-2108 Easy LeetCode

2108. Find First Palindromic String in the Array

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 84% Topics: Array, Two Pointers, String

Reading material

Arrays & Hashing 12 min Two Pointers 9 min Strings 12 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def firstPalindrome(self, words):
        """
        :type words: List[str]
        :rtype: str
        """
        def is_palindrome(s):
            i, j = 0, len(s)-1
            while i < j:
                if s[i] != s[j]:
                    return False
                i += 1
                j -= 1
            return True

        for w in words:
            if is_palindrome(w):
                return w
        return ""

 
# Time:  O(n)
# Space: O(l), l is the max length of words
class Solution2(object):
    def firstPalindrome(self, words):
        """
        :type words: List[str]
        :rtype: str
        """
        return next((x for x in words if x == x[::-1]), "")

Solution from kamyu104/LeetCode-Solutions · MIT