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 | 力扣

• Tags: Dynamic Programming, Greedy, Bit Manipulation, Memoization

2998. Minimum Number of Operations to Make X and Y Equal

• LeetCode | 力扣

• Tags: Dynamic Programming, Breadth First Search, Memoization

2059. Minimum Operations to Convert Number

• LeetCode | 力扣

• Tags: Array, Breadth First Search

991. Broken Calculator

• LeetCode | 力扣

• Tags: Math, Greedy

1553. Minimum Number of Days to Eat N Oranges

• LeetCode | 力扣

• Tags: Dynamic Programming, Memoization

3377. Digit Operations to Make Two Integers Equal

• LeetCode | 力扣

• Tags: Math, Graph, Heap Priority Queue, Number Theory, Shortest Path

Comments