add 2108

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2108|[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2108.java) ||Easy||
 |2103|[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2103.java) ||Easy||
 |2099|[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) ||Easy||
 |2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2108.java

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions;
+
+public class _2108 {
+    public static class Solution1 {
+        public String firstPalindrome(String[] words) {
+            for (String word : words) {
+                if (isPal(word)) {
+                    return word;
+                }
+            }
+            return "";
+        }
+
+        private boolean isPal(String word) {
+            int left = 0;
+            int right = word.length() - 1;
+            while (left < right) {
+                if (word.charAt(left) != word.charAt(right)) {
+                    return false;
+                } else {
+                    left++;
+                    right--;
+                }
+            }
+            return true;
+        }
+    }
+}