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

https://leetcode.com/problems/count-substrings-that-can-be-rearranged-to-contain-a-string-ii/description/ Tag: Two Pointer typedef long long ll; class Solution { public: long long validSubstringCount(string word1, string word2) { int n

https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/description/ class Solution { public: int ans; void dfs(TreeNode *cur, vector<int> &cnt) { if (cur == NULL) return;