Math Greedy Basics¶
Table of Contents¶
- 2160. Minimum Sum of Four Digit Number After Splitting Digits (Easy)
- 2578. Split With Minimum Sum (Easy)
- 2244. Minimum Rounds to Complete All Tasks (Medium)
- 2870. Minimum Number of Operations to Make Array Empty (Medium)
- 1217. Minimum Cost to Move Chips to The Same Position (Easy)
- 3091. Apply Operations to Make Sum of Array Greater Than or Equal to k (Medium)
- 397. Integer Replacement (Medium)
2160. Minimum Sum of Four Digit Number After Splitting Digits¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: math, greedy, sorting
2578. Split With Minimum Sum¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: math, greedy, sorting
2244. Minimum Rounds to Complete All Tasks¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, greedy, counting
2870. Minimum Number of Operations to Make Array Empty¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, hash table, greedy, counting
1217. Minimum Cost to Move Chips to The Same Position¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: array, math, greedy
3091. Apply Operations to Make Sum of Array Greater Than or Equal to k¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, greedy, enumeration
397. Integer Replacement¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, greedy, bit manipulation, memoization