Update

Author: MuhtasimTanmoy

1962-remove-stones-to-minimize-the-total/1962-remove-stones-to-minimize-the-total.cpp

@@ -0,0 +1,32 @@
+
+int main() {
+    int leftmost = -1; 
+    int left = 0, right = nums.length - 1;
+    while (left <= right) {
+        mid = (left + right) / 2; 
+        if (nums[mid] < target) {
+            left = mid + 1; 
+        } else if (nums[mid] > target) {
+            right = mid - 1; 
+        } else {
+            // binary search for leftmost index 
+            leftmost = mid; 
+            right = mid - 1; 
+        }
+    }
+
+    left = 0; right = nums.length - 1;
+    int rightmost = -1; 
+    while (left <= right) {
+        mid = (left + right) / 2; 
+        if (nums[mid] < target) {
+            left = mid + 1; 
+        } else if (nums[mid] > target) {
+            right = mid - 1; 
+        } else {
+            // binary search for rightmost index
+            rightmost = mid; 
+            left = mid + 1; 
+        }
+    }
+}

2129-capitalize-the-title/2129-capitalize-the-title.cpp

@@ -12,7 +12,8 @@ class UnionFind {
         int rootY = find(y);
         if (rootX != rootY)
             for (int i = 0; i < root.size(); i++) 
-                if (root[i] == rootY) root[i] = rootX;
+                if (root[i] == rootY) 
+                    root[i] = rootX;
     }
 
     bool connected(int x, int y) {