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

• Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask

3376. Minimum Time to Break Locks I

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Depth First Search, Bitmask

1879. Minimum XOR Sum of Two Arrays

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Bit Manipulation, Bitmask

2850. Minimum Moves to Spread Stones Over Grid

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Breadth First Search, Matrix

1947. Maximum Compatibility Score Sum

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask

1799. Maximize Score After N Operations

• LeetCode | 力扣

• Tags: Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask

2172. Maximum AND Sum of Array

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Bit Manipulation, Bitmask

2992. Number of Self-Divisible Permutations 👑

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask

2403. Minimum Time to Kill All Monsters 👑

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Bit Manipulation, Bitmask

1066. Campus Bikes II 👑

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask