Network Flow¶
Table of Contents¶
- 3376. Minimum Time to Break Locks I (Medium)
- 1947. Maximum Compatibility Score Sum (Medium)
- 2850. Minimum Moves to Spread Stones Over Grid (Medium)
- 1879. Minimum XOR Sum of Two Arrays (Hard)
- 1349. Maximum Students Taking Exam (Hard)
- 2172. Maximum AND Sum of Array (Hard)
- 3276. Select Cells in Grid With Maximum Score (Hard)
- 1595. Minimum Cost to Connect Two Groups of Points (Hard)
- 3257. Maximum Value Sum by Placing Three Rooks II (Hard)
- 1820. Maximum Number of Accepted Invitations (Medium) 👑
- 2403. Minimum Time to Kill All Monsters (Hard) 👑
- 3385. Minimum Time to Break Locks II (Hard) 👑
- 1066. Campus Bikes II (Medium) 👑
- 2123. Minimum Operations to Remove Adjacent Ones in Matrix (Hard) 👑
- 2463. Minimum Total Distance Traveled (Hard)
3376. Minimum Time to Break Locks I¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, depth first search, bitmask
1947. Maximum Compatibility Score Sum¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
2850. Minimum Moves to Spread Stones Over Grid¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, breadth first search, matrix
1879. Minimum XOR Sum of Two Arrays¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
1349. Maximum Students Taking Exam¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
2172. Maximum AND Sum of Array¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
3276. Select Cells in Grid With Maximum Score¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
1595. Minimum Cost to Connect Two Groups of Points¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, matrix, bitmask
3257. Maximum Value Sum by Placing Three Rooks II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, matrix, enumeration
1820. Maximum Number of Accepted Invitations¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, depth first search, graph, matrix
2403. Minimum Time to Kill All Monsters¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, bitmask
3385. Minimum Time to Break Locks II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, depth first search, graph
1066. Campus Bikes II¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, backtracking, bit manipulation, bitmask
2123. Minimum Operations to Remove Adjacent Ones in Matrix¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, graph, matrix
2463. Minimum Total Distance Traveled¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, sorting