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) {

2515-shortest-distance-to-target-string-in-a-circular-array/NOTES.md

@@ -3,7 +3,7 @@ class Solution {
     int minStoneSum(vector<int>& piles, int k) {
         long long int sum = accumulate(piles.begin(), piles.end(), 0);
         priority_queue<int> pq(piles.begin(), piles.end());
-        while(k--) {
+        while (k--) {
             auto top = pq.top(); pq.pop();
             auto substract = top >> 1;
             sum -= substract;

2520-count-the-digits-that-divide-a-number/NOTES.md

@@ -1,21 +1,36 @@
+// class Solution {
+// public:
+//     string capitalizeTitle(string title) {
+//         stringstream ss(title);
+//         string word;
+//         string res = "";
+//         while(ss >> word) {
+//             bool first = word.size() >= 3 ? true: false;
+//             for (auto &c: word) {
+//                 if (first) {
+//                     c = toupper(c);
+//                     first = false;
+//                 } else c = tolower(c);
+//             }
+//             res+= word;
+//             res+= ' ';
+//         }
+//         res.pop_back();
+//         return res;
+//     }
+// };
+
 class Solution {
 public:
     string capitalizeTitle(string title) {
-        stringstream ss(title);
-        string word;
-        string res = "";
-        while(ss >> word) {
-            bool first = word.size() >= 3 ? true: false;
-            for (auto &c: word) {
-                if (first) {
-                    c = toupper(c);
-                    first = false;
-                } else c = tolower(c);
-            }
-            res+= word;
-            res+= ' ';
+        stringstream ss(title); string res = "";
+        auto shouldCap = [](string& s) { return s.size() > 2; };
+        for (string word; ss >> word;) {
+            transform(word.begin(), word.end(), word.begin(), ::tolower);
+            if (shouldCap(word)) word[0] = toupper(word[0]);
+            res += word; res += " ";
         }
-        res.pop_back();
+        if (res.size()) res.pop_back();
         return res;
     }
 };