https://leetcode.com/problems/count-the-number-of-winning-sequences/description/ Tag: DP typedef long long ll; class Solution { public: int countWinningSequences(string s) { ll mod = 1e9 + 7; int n

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}