DP Transform X to Y¶
Table of Contents¶
- 397. Integer Replacement (Medium)
- 2998. Minimum Number of Operations to Make X and Y Equal (Medium)
- 2059. Minimum Operations to Convert Number (Medium)
- 991. Broken Calculator (Medium)
- 1553. Minimum Number of Days to Eat N Oranges (Hard)
- 3377. Digit Operations to Make Two Integers Equal (Medium)
397. Integer Replacement¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, greedy, bit manipulation, memoization
2998. Minimum Number of Operations to Make X and Y Equal¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, breadth first search, memoization
2059. Minimum Operations to Convert Number¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, breadth first search
991. Broken Calculator¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, greedy
1553. Minimum Number of Days to Eat N Oranges¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, memoization
3377. Digit Operations to Make Two Integers Equal¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, graph, heap priority queue, number theory, shortest path