add 2855

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -10,6 +10,7 @@
 | 2869 | [Minimum Operations to Collect Elements](https://leetcode.com/problems/minimum-operations-to-collect-elements/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2869.java)                                       |                                      | Easy                                     |
 | 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2864.java)                                       |                                      | Easy                                     |Greedy
 | 2859 | [Sum of Values at Indices With K Set Bits](https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2859.java)                                       |                                      | Easy                                     |
+| 2855 | [Minimum Right Shifts to Sort the Array](https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2855.java)                                       |                                      | Easy                                     |
 | 2839 | [Check if Strings Can be Made Equal With Operations I](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2839.java)                                       |                                      | Easy                                     |
 | 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java)                                       |                                      | Easy                                     |
 | 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2828.java)                                       |                                      | Easy                                     |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2855.java

@@ -0,0 +1,38 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2855 {
+    public static class Solution1 {
+        public int minimumRightShifts(List<Integer> nums) {
+            int shifts = 0;
+            do {
+                if (sorted(nums)) {
+                    return shifts;
+                }
+                nums = shiftByOne(nums);
+                shifts++;
+            } while (shifts < nums.size());
+            return -1;
+        }
+
+        private List<Integer> shiftByOne(List<Integer> list) {
+            List<Integer> shifted = new ArrayList<>();
+            shifted.add(list.get(list.size() - 1));
+            for (int i = 0; i < list.size() - 1; i++) {
+                shifted.add(list.get(i));
+            }
+            return shifted;
+        }
+
+        private boolean sorted(List<Integer> nums) {
+            for (int i = 0; i < nums.size() - 1; i++) {
+                if (nums.get(i) >= nums.get(i + 1)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2855Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2855;
+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 _2855Test {
+    private static _2855.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2855.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minimumRightShifts(Arrays.asList(3, 4, 5, 1, 2)));
+    }
+
+}