Median Greedy¶
Table of Contents¶
- 462. Minimum Moves to Equal Array Elements II (Medium)
- 2033. Minimum Operations to Make a Uni-Value Grid (Medium)
- 2448. Minimum Cost to Make Array Equal (Hard)
- 2607. Make K-Subarray Sums Equal (Medium)
- 2967. Minimum Cost to Make Array Equalindromic (Medium)
- 1478. Allocate Mailboxes (Hard)
- 2968. Apply Operations to Maximize Frequency Score (Hard)
- 1703. Minimum Adjacent Swaps for K Consecutive Ones (Hard)
- 3086. Minimum Moves to Pick K Ones (Hard)
- 3441. Minimum Cost Good Caption (Hard)
- 296. Best Meeting Point (Hard) 👑
462. Minimum Moves to Equal Array Elements II¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, sorting
2033. Minimum Operations to Make a Uni-Value Grid¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, sorting, matrix
2448. Minimum Cost to Make Array Equal¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, greedy, sorting, prefix sum
2607. Make K-Subarray Sums Equal¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, greedy, sorting, number theory
2967. Minimum Cost to Make Array Equalindromic¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, binary search, greedy, sorting
1478. Allocate Mailboxes¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, sorting
2968. Apply Operations to Maximize Frequency Score¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, sliding window, sorting, prefix sum
1703. Minimum Adjacent Swaps for K Consecutive Ones¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, greedy, sliding window, prefix sum
3086. Minimum Moves to Pick K Ones¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, greedy, sliding window, prefix sum
3441. Minimum Cost Good Caption¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: string, dynamic programming
296. Best Meeting Point¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, sorting, matrix