https://leetcode.com/problems/count-the-number-of-ideal-arrays/description/
Arrays a[i] % a[i - 1] == 0, i..n, a[i]..max #hard #combinatorics
Arrays a[i] % a[i - 1] == 0, i..n, a[i]..max #hard #combinatorics
👍3
https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description
Subarrays with min=minK, max=maxK #hard #two_pointers
Subarrays with min=minK, max=maxK #hard #two_pointers
👍3
https://leetcode.com/problems/count-subarrays-with-score-less-than-k/description/
Subarrays sum * cnt <= k #hard #two_pointers
Subarrays sum * cnt <= k #hard #two_pointers
👍4
Tasks can be done by workers with pills #hard #binary_search
https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/description
https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/description
👍3
Permutations of even-odd position sums equal #hard #dp #math
https://leetcode.com/problems/count-number-of-balanced-permutations/description/
https://leetcode.com/problems/count-number-of-balanced-permutations/description/
👍2
t
steps to convert char into next nums[c] chars #hard #dp #mathhttps://leetcode.com/problems/total-characters-in-string-after-transformations-ii/description
👍2
https://leetcode.com/problems/painting-a-grid-with-three-different-colors/description
Ways to 3-color m*n grid, no adjucents #hard #dp #matrix
Ways to 3-color m*n grid, no adjucents #hard #dp #matrix
👍3
https://leetcode.com/problems/find-the-maximum-sum-of-node-values/description/
Max sum by k-xoring edges #hard #tree #dp
Max sum by k-xoring edges #hard #tree #dp
👍2
https://leetcode.com/problems/largest-color-value-in-a-directed-graph/description/
Max color freq path #hard #dp #toposort
Max color freq path #hard #dp #toposort
👍2🔥1
Max even-edged siblings after merging trees #hard #graph
https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description
https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description
👍1