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¶
3376. Minimum Time to Break Locks I¶
-
Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Depth First Search, Bitmask
1879. Minimum XOR Sum of Two Arrays¶
2850. Minimum Moves to Spread Stones Over Grid¶
1947. Maximum Compatibility Score Sum¶
1799. Maximize Score After N Operations¶
-
Tags: Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask