-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchallenges-60.js
40 lines (30 loc) · 1.08 KB
/
challenges-60.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// #Questiuon
// 2108. 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.
// 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.
// #Solution
function isPalindrome(word) {
return word === word.split("").reverse().join("");
}
var firstPalindrome = function (words) {
for (const word of words) {
if (isPalindrome(word)) {
return word;
}
}
return "";
};
firstPalindrome(["abc", "car", "ada", "racecar", "cool"]);