LeetCode

Sum of Good Subsequences

Count K-Reducible Numbers Less Than N

Minimum Total Operations

Make Array Elements Equal to Zero

Zero Array Transformation I

Zero Array Transformation II

Minimize the Maximum Adjacent Element Difference

Books with NULL Ratings

Find Sorted Submatrices With Maximum Element at Most K

Stone Removal Game

Shift Distance Between Two Strings

Zero Array Transformation III

Find the Maximum Number of Fruits Collected

Minimum Positive Sum Subarray

Rearrange K Substrings to Form Target String

Minimum Array Sum

Maximize Sum of Weights after Edge Removals

First Letter Capitalization

Design an Array Statistics Tracker

Smallest Number With All Set Bits

Identify the Largest Outlier in an Array

Maximize the Number of Target Nodes After Connecting Trees I

Maximize the Number of Target Nodes After Connecting Trees II

First Letter Capitalization II

Minimum Operations to Make Array Values Equal to K

Minimum Time to Break Locks I

Digit Operations to Make Two Integers Equal

Count Connected Components in LCM Graph

Transformed Array

Maximum Area Rectangle With Point Constraints I

Maximum Subarray Sum With Length Divisible by K

Maximum Area Rectangle With Point Constraints II

Minimum Runes to Add to Cast Spell

Team Dominance by Pass Success

Minimum Time to Break Locks II

Button with Longest Push Time

Maximize Amount After Two Days of Conversions

Count Beautiful Splits in an Array

Minimum Operations to Make Character Frequencies Equal

Longest Team Pass Streak

Design a 3D Binary Matrix with Efficient Layer Tracking

Count Subarrays of Length Three With a Condition

Count Paths With the Given XOR Value

Check if Grid can be Cut into Sections

Subsequences with a Unique Middle Mode I

Minimum Number of Operations to Make Elements in Array Distinct

Maximum Number of Distinct Elements After Operations

Smallest Substring With Identical Characters I

Smallest Substring With Identical Characters II

Maximum Number of Matching Indices After Right Shifts