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 | LeetCode CH (Hard)
-
Tags: array, hash table, math, dynamic programming, backtracking, bit manipulation, bitmask
2741. Special Permutations¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, bit manipulation, bitmask
1681. Minimum Incompatibility¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
3283. Maximum Number of Moves to Kill All Pawns¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, bit manipulation, breadth first search, game theory, bitmask
3149. Find the Minimum Cost Array Permutation¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask