update

Author: OneCodeMonkey

codeForces/Codeforces_1832C_Contrast_Value.java

@@ -0,0 +1,42 @@
+// Time: 796 ms 
+// Memory: 2400 KB
+// Greedy.
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_1832C_Contrast_Value {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), prev = -1, direction = 0, ret = 1;
+            for (int j = 0; j < n; j++) {
+                int a = sc.nextInt();
+                if (prev == -1) {
+                    prev = a;
+                    continue;
+                }
+                if (direction == 0) {
+                    if (a > prev) {
+                        direction = 1;
+                    } else if (a < prev) {
+                        direction = -1;
+                    }
+                } else if (direction == 1 && a < prev) {
+                    ret++;
+                    direction = -1;
+                } else if (direction == -1 && a > prev) {
+                    ret++;
+                    direction = 1;
+                }
+                if (direction != 0 && j == n - 1) {
+                    ret++;
+                }
+                prev = a;
+            }
+
+            System.out.println(ret);
+        }
+    }
+}

leetcode_solved/leetcode_3550_Smallest_Index_With_Digit_Sum_Equal_to_Index.java

@@ -0,0 +1,23 @@
+// Runtime 1 ms Beats 100.00% 
+// Memory 44.10 MB Beats 100.00%
+// .
+// T:O(nlogk), S:O(1)
+// 
+class Solution {
+    public int smallestIndex(int[] nums) {
+        int ret = -1;
+        for (int i = 0; i < nums.length; i++) {
+            int digitSum = 0;
+            while (nums[i] > 0) {
+                digitSum += nums[i] % 10;
+                nums[i] /= 10;
+            }
+            if (digitSum == i) {
+                ret = i;
+                break;
+            }
+        }
+
+        return ret;
+    }
+}