DP Permutation Type Adjacent Unrelated¶
Table of Contents¶
- 526. Beautiful Arrangement (Medium)
- 3376. Minimum Time to Break Locks I (Medium)
- 1879. Minimum XOR Sum of Two Arrays (Hard)
- 2850. Minimum Moves to Spread Stones Over Grid (Medium)
- 1947. Maximum Compatibility Score Sum (Medium)
- 1799. Maximize Score After N Operations (Hard)
- 2172. Maximum AND Sum of Array (Hard)
- 2992. Number of Self-Divisible Permutations (Medium) 👑
- 2403. Minimum Time to Kill All Monsters (Hard) 👑
- 1066. Campus Bikes II (Medium) 👑
526. Beautiful Arrangement¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
3376. Minimum Time to Break Locks I¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, depth first search, bitmask
1879. Minimum XOR Sum of Two Arrays¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
2850. Minimum Moves to Spread Stones Over Grid¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, breadth first search, matrix
1947. Maximum Compatibility Score Sum¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
1799. Maximize Score After N Operations¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, backtracking, bit manipulation, number theory, bitmask
2172. Maximum AND Sum of Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
2992. Number of Self-Divisible Permutations¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
2403. Minimum Time to Kill All Monsters¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
1066. Campus Bikes II¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask