LeetCode

Find Circular Gift Exchange Chains

Minimum Operations to Make Columns Strictly Increasing

Find the Lexicographically Largest String From the Box I

Count Special Subsequences

Count the Number of Arrays with K Matching Adjacent Elements

Find the Lexicographically Largest String From the Box II

Substring Matching Pattern

Design Task Manager

Longest Subsequence With Decreasing Adjacent Difference

Maximize Subarray Sum After Removing All Occurrences of One Element

Maximum Subarray With Equal Products

Find Mirror Score of a String

Maximum Coins From K Consecutive Bags

Maximum Score of Non-overlapping Intervals

Find Products with Three Consecutive Digits

Subsequences with a Unique Middle Mode II

Zigzag Grid Traversal With Skip

Maximum Amount of Money Robot Can Earn

Minimize the Maximum Edge Weight of Graph

Count Non-Decreasing Subarrays After K Operations

Find Students Who Improved

Minimum Operations to Make Subarray Elements Equal

Maximum Difference Between Adjacent Elements in a Circular Array

Minimum Cost to Make Arrays Identical

Longest Special Path

Manhattan Distances of All Arrangements of Pieces

Sum of Variable Length Subarrays

Maximum and Minimum Sums of at Most Size K Subsequences

Paint House IV

Maximum and Minimum Sums of at Most Size K Subarrays

Minimum Unlocked Indices to Sort Nums

Count Partitions with Even Sum Difference

Count Mentions Per User

Maximum Frequency After Subarray Operation

Frequencies of Shortest Supersequences

Find Valid Emails

Permutations III

Find Valid Pair of Adjacent Digits in String

Reschedule Meetings for Maximum Free Time I

Reschedule Meetings for Maximum Free Time II

Minimum Cost Good Caption

Maximum Difference Between Even and Odd Frequency I

Maximum Manhattan Distance After K Changes

Minimum Increments for Target Multiples in an Array

Maximum Difference Between Even and Odd Frequency II

Sort Matrix by Diagonals

Assign Elements to Groups with Constraints

Count Substrings Divisible By Last Digit

Maximize the Minimum Game Score

Maximum Students on a Single Bench