daily update

Author: aucker

daily/25-Feb12.cc

@@ -0,0 +1,31 @@
+#include <vector>
+using namespace std;
+
+class Solution {
+ public:
+  /**
+   * @brief Time: O(NlogU), U = max(nums)
+   * Space: O(1)
+   *
+   * @param nums
+   * @param maxOperations
+   * @return int
+   */
+  int minimumSize(vector<int>& nums, int maxOperations) {
+    auto check = [&](int m) -> bool {
+      long long cnt = 0;
+      for (int x : nums) {
+        cnt += (x - 1) / m;
+      }
+      return cnt <= maxOperations;
+    };
+
+    int left = 0;
+    int right = ranges::max(nums);
+    while (left + 1 < right) {
+      int mid = left + (right - left) / 2;
+      (check(mid) ? right : left) = mid;
+    }
+    return right;
+  }
+};

daily/25-Feb15.cc

@@ -0,0 +1,31 @@
+#include <vector>
+using namespace std;
+
+class Solution {
+ public:
+  /**
+   * @brief 1706: Where will the ball fall
+   * Time: O(row * col), Space: O(1)
+   *
+   * @param grid
+   * @return vector<int>
+   */
+  vector<int> findBall(vector<vector<int>>& grid) {
+    int n = grid[0].size();
+    vector<int> ans(n);
+    for (int j = 0; j < n; j++) {
+      int cur_col = j;
+      for (auto& row : grid) {
+        int d = row[cur_col];
+        cur_col += d;
+
+        if (cur_col < 0 || cur_col == n || row[cur_col] != d) {
+          cur_col = -1;
+          break;
+        }
+      }
+      ans[j] = cur_col;
+    }
+    return ans;
+  }
+};

daily/25-Feb19.cc

@@ -0,0 +1,47 @@
+#include <unordered_map>
+#include <vector>
+using namespace std;
+
+class RangeFreqQuery {
+  unordered_map<int, vector<int>> pos;
+
+ public:
+  RangeFreqQuery(vector<int>& arr) {
+    for (int i = 0; i < arr.size(); i++) {
+      pos[arr[i]].push_back(i);
+    }
+  }
+
+  int query(int left, int right, int value) {
+    auto it = pos.find(value);
+    if (it == pos.end()) {  // not found
+      return 0;
+    }
+
+    auto& a = it->second;
+    return ranges::upper_bound(a, right) - ranges::lower_bound(a, left);
+  }
+};
+
+class Solution {
+ public:
+  /**
+   * @brief LC 624: Max Distance in Arrays
+   * Time: O(len), Space: O(1)
+   *
+   * @param arrays
+   * @return int
+   */
+  int maxDistance(vector<vector<int>>& arrays) {
+    int ans = 0;
+    int mn = INT_MAX / 2, mx = INT_MIN / 2;
+
+    for (auto& array : arrays) {
+      ans = max({ans, array.back() - mn, mx - array[0]});
+      mn = min(mn, array[0]);
+      mx = max(mx, array.back());
+    }
+
+    return ans;
+  }
+};

daily/25-Feb20.cc

@@ -0,0 +1,41 @@
+#include <vector>
+using namespace std;
+
+class Solution {
+  enum Bits {
+    bit0 = 0b0000000001,
+    bit1 = 0b0000000010,
+    bit2 = 0b0000000100,
+    bit3 = 0b0000001000,
+    bit4 = 0b0000010000,
+    bit5 = 0b0000100000,
+    bit6 = 0b0001000000,
+    bit7 = 0b0010000000,
+    bit8 = 0b0100000000,
+    bit9 = 0b1000000000,
+  };
+
+ public:
+  /**
+   * @brief LC2595: Number of Even and Odd Bits
+   * Time: O(1), Space: O(1)
+   * Bit operation is really fast, haha <3
+   *
+   * @param n
+   * @return vector<int>
+   */
+  vector<int> evenOddBit(int n) {
+    vector<int> ans(2, 0);
+    Bits mybits[] = {bit0, bit1, bit2, bit3, bit4, bit5, bit6, bit7, bit8, bit9};
+    int sentinel = 0;
+    for (auto bit : mybits) {
+      if ((bit & n) != 0 && sentinel % 2 == 0) {
+        ans[0]++;
+      } else if ((bit & n) != 0 && sentinel % 2 == 1) {
+        ans[1]++;
+      }
+      sentinel++;
+    }
+    return ans;
+  }
+};

daily/Aug18.cc

@@ -11,6 +11,6 @@ class Solution {
    * @return true, false
    */
   bool checkRecord(string s) {
-    return ranges::counts(s, 'A') && s.find("LLL") == string::npos;
+    return ranges::count(s, 'A') && s.find("LLL") == string::npos;
   }
-};
+};