DP Permutation Type Adjacent Related

Table of Contents

• 996. Number of Squareful Arrays (Hard)
• 2741. Special Permutations (Medium)
• 1681. Minimum Incompatibility (Hard)
• 3283. Maximum Number of Moves to Kill All Pawns (Hard)
• 3149. Find the Minimum Cost Array Permutation (Hard)

996. Number of Squareful Arrays

• LeetCode | 力扣

• Tags: Array, Hash Table, Math, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask

2741. Special Permutations

• LeetCode | 力扣

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

1681. Minimum Incompatibility

• LeetCode | 力扣

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

3283. Maximum Number of Moves to Kill All Pawns

• LeetCode | 力扣

• Tags: Array, Math, Bit Manipulation, Breadth First Search, Game Theory, Bitmask

3149. Find the Minimum Cost Array Permutation

• LeetCode | 力扣

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

Comments