https://leetcode.com/problems/minimum-increments-for-target-multiples-in-an-array/description/ Tag: DP typedef long long ll; class Solution { public: int minimumIncrements(vector<int>& nums, vector<

https://leetcode.com/problems/find-the-count-of-monotonic-pairs-i/description/ Tag: DP Rate: 1897 typedef long long ll; class Solution { public: int countOfPairs(vector<int>& nums)

https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/description/?envType=daily-question&envId=2025-01-18 Tag: 0-1 BFS class Solution { public: int dr[5] = {0, 0, 0, 1, -1}

https://leetcode.com/problems/minimum-array-sum/description/ Tag: DP class Solution { public: int twoOp(int num, int k) { if (ceil(1.0 * num / 2) < k)

https://leetcode.com/problems/peaks-in-array/description/ Tag: Segment Tree Rate: 2154 class Solution { public: int seg[100010 << 2]; void update(int node, int