Min queries (l..r, v) to decrease nums by v to 0 #medium #line_sweep
https://leetcode.com/problems/zero-array-transformation-ii/description/
https://leetcode.com/problems/zero-array-transformation-ii/description/
👍2
Distribute candies to k equal buckets #medium #binary_search
https://leetcode.com/problems/maximum-candies-allocated-to-k-children/description/
https://leetcode.com/problems/maximum-candies-allocated-to-k-children/description/
👍1🔥1
Min-max of non-adjucents in array #medium #binary_search
https://leetcode.com/problems/house-robber-iv/description/
https://leetcode.com/problems/house-robber-iv/description/
🔥2👍1
Min rank[i] * count^2 to fix all cars #medium #binary_search #heap
https://leetcode.com/problems/minimum-time-to-repair-cars/description
https://leetcode.com/problems/minimum-time-to-repair-cars/description
👍3
All numbers in pairs #easy #counting #sorting
https://leetcode.com/problems/divide-array-into-equal-pairs/description/
https://leetcode.com/problems/divide-array-into-equal-pairs/description/
👍1
Max window of all pairs AND zero #medium #two_pointers #bit_manipulation
https://leetcode.com/problems/longest-nice-subarray/description/
https://leetcode.com/problems/longest-nice-subarray/description/
👍1🔥1
Min AND of path weights #hard #bit_manipulation #union-find
https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description
https://leetcode.com/problems/minimum-cost-walk-in-weighted-graph/description
👍2🔥1
Valid recipes from supplies #medium #dfs #dp
https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description/
https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/description/
👍1🔥1
Count fully connected components #medium #union-find #graph
https://leetcode.com/problems/count-the-number-of-complete-components/description/
https://leetcode.com/problems/count-the-number-of-complete-components/description/
👍3
Count optimal paths from 0 to n - 1 #medium #dijkstra #bellman_ford
https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/description/
https://leetcode.com/problems/number-of-ways-to-arrive-at-destination/description/
👍2
Days of non-intersecting intervals #medium #line_sweep
https://leetcode.com/problems/count-days-without-meetings/description
https://leetcode.com/problems/count-days-without-meetings/description
👍4
3 non-intersecting ranges on x or y axis #medium #line_sweep
https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/description/
https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/description/
👍2
Min sum of differences of x times #medium #math #quickselect
https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/description/
https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/description/
👍2
Min split index to have equal majority elements #medium #counting
https://leetcode.com/problems/minimum-index-of-a-valid-split/description/
https://leetcode.com/problems/minimum-index-of-a-valid-split/description/
👍2
Running queries of increasing BFS #hard #bfs #heap
https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description/
https://leetcode.com/problems/maximum-number-of-points-from-grid-queries/description/
👍1
Multiply
https://leetcode.com/problems/apply-operations-to-maximize-score/description
k
numbers with max prime factor count #hard #monotonic_stackhttps://leetcode.com/problems/apply-operations-to-maximize-score/description
👍2
Split string into separate chars sets #medium
https://leetcode.com/problems/partition-labels/description
https://leetcode.com/problems/partition-labels/description
👍2
https://leetcode.com/problems/put-marbles-in-bags/description/
Max split sum - min split sum of borders #hard #sort
Max split sum - min split sum of borders #hard #sort
👍2
Max sum of (points, skip_next) pairs #medium #dp
https://leetcode.com/problems/solving-questions-with-brainpower/description
https://leetcode.com/problems/solving-questions-with-brainpower/description
👍2
https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/description/
Max (a[i] - a[j]) * a[k] #easy
Max (a[i] - a[j]) * a[k] #easy
👍3