Code-Yao

leetcode 2616 Minimize the Maximum Difference of Pairs | binary search

leetcode 3571 Find the Shortest Superstring II | suffix prefix matching

leetcode 3572 Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | heap

leetcode 1217 Minimum Cost to Move Chips to The Same Position | parity check

3445 Maximum Difference Between Even and Odd Frequency II | 2 pointer sliding window + bitmask

leetcode 3442 Maximum Difference Between Even and Odd Frequency I | dict and scan, or hp practice f

leetcode 3567 Minimum Absolute Difference in Sliding Submatrix brute force

leetcode 2929 Distribute Candies Among Children II

leetcode 3563 Lexicographically Smallest String After Adjacent Removals | DP + bitmask

leetcode 3373 Maximize the Number of Target Nodes After Connecting Trees II | dfs + graph coloring

leetcode 3557 Find Maximum Number of Non Intersecting Substrings | Dynamic Programming

leetcode 3557 Find Maximum Number of Non Intersecting Substrings | Greedy Construction

leetcode 3565 Sequential Grid Path Cover | recursive backtracking

leetcode 392 Is Subsequence | two pointer

leetcode 3551 Minimum Swaps to Sort by Digit Sum | sort + find

leetcode 3561 Resulting String After Adjacent Removals | stack

leetcode 408 Valid Word Abbreviation | two pointer sliding window

leetcode 3550 Smallest Index With Digit Sum Equal to Index | while loop or type conversion

leetcode 2131 Longest Palindrome by Concatenating Two Letter Words | dict and count

leetcode 3489 Zero Array Transformation IV | construct all possible decrements

leetcode 3489 Zero Array Transformation IV | dp with bitmask, two versions of the same idea

leetcode 3362 Zero Array Transformation III | two heaps

leetcode 3355 Zero Array Transformation I | line sweep

441 Arranging Coins | routine while loop, or binary search

leetcode 75 Sort Colors | three way partition

leetcode 2901 Longest Unequal Adjacent Groups Subsequence II | DP with path chasing

leetcode 205 Isomorphic Strings | index partition

leetcode 2900 Longest Unequal Adjacent Groups Subsequence I | index partition

leetcode 3545 Minimum Deletions for At Most K Distinct Characters | heap

leetcode 3335 Total Characters in String After Transformation I | queue shifting