Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2108 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2108 # by problem number
lcpy gen -s find_first_palindromic_string_in_the_array # by problem name
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.
Input: words = ["abc","car","ada","racecar","cool"]
Output: "ada"
Input: words = ["notapalindrome","racecar"]
Output: "racecar"
Input: words = ["def","ghi"]
Output: ""
1 <= words.length <= 1001 <= words[i].length <= 100words[i] consists only of lowercase English letters.class Solution:
# Time: O(total characters)
# Space: O(1)
def first_palindrome(self, words: list[str]) -> str:
for word in words:
if word == word[::-1]:
return word
return ""
| Time | Space |
|---|---|
| O(total characters) | O(1) |