add 2057

fishercoder1534 · fishercoder1534 · commit b8bf1d8f3635 · 2021-10-31T07:59:29.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2057|[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) ||Easy||
 |2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) ||Medium||
 |2054|[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) ||Medium||
 |2053|[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2057.java b/src/main/java/com/fishercoder/solutions/_2057.java
@@ -0,0 +1,14 @@
+package com.fishercoder.solutions;
+
+public class _2057 {
+    public static class Solution1 {
+        public int smallestEqual(int[] nums) {
+            for (int i = 0; i < nums.length; i++) {
+                if (i % 10 == nums[i]) {
+                    return i;
+                }
+            }
+            return -1;
+        }
+    }
+}
