add 2900

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -6,6 +6,7 @@
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
+| 2900 | [Longest Unequal Adjacent Groups Subsequence I](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2900.java)                                       |                                      | Easy                                     |
 | 2899 | [Last Visited Integers](https://leetcode.com/problems/last-visited-integers/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2899.java)                                       |                                      | Easy                                     |
 | 2894 | [Divisible and Non-divisible Sums Difference](https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2894.java)                                       |                                      | Easy                                     |
 | 2873 | [Maximum Value of an Ordered Triplet I](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2873.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/common/utils/CommonUtils.java

@@ -72,11 +72,11 @@ public static void print(int num) {
     }
 
     public static void print(List<String> list) {
-        System.out.println("----------------------------------------------------");
+        System.out.println("List of string is: ");
         for (String str : list) {
             System.out.print(str + ", ");
         }
-        System.out.println();
+        System.out.println("\n----------------------------------------------------");
     }
 
     public static void println(String message) {

src/main/java/com/fishercoder/solutions/thirdthousand/_2900.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2900 {
+    public static class Solution1 {
+        public List<String> getLongestSubsequence(String[] words, int[] groups) {
+            int longest = 0;
+            List<String> ans = new ArrayList<>();
+            for (int i = 0; i < words.length; i++) {
+                List<String> candidate = new ArrayList<>();
+                candidate.add(words[i]);
+                int lastBit = groups[i];
+                for (int j = i + 1; j < words.length; j++) {
+                    if (groups[j] != lastBit) {
+                        candidate.add(words[j]);
+                        lastBit = groups[j];
+                    }
+                }
+                if (candidate.size() > longest) {
+                    longest = candidate.size();
+                    ans = candidate;
+                }
+            }
+            return ans;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2900Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2900;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2900Test {
+    private static _2900.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2900.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList("s", "l", "r", "ypp", "ev", "fv", "qzk", "xlr", "w", "v"),
+                solution1.getLongestSubsequence(
+                        new String[]{"s", "l", "djl", "euy", "r", "lur", "u", "ypp", "ev", "fv", "we", "qzk", "q", "xlr", "w", "wc", "a", "sd", "o", "x", "v"},
+                        new int[]{0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1}));
+    }
+
+}