LeetCode

Special Array I

Special Array II

Sum of Digit Differences of All Pairs

Find Number of Ways to Reach the K-th Stair

Maximum Number of Upgradable Servers

Employee Task Duration and Concurrent Tasks

Find the Level of Tree with Minimum Sum

Find the XOR of Numbers Which Appear Twice

Find Occurrences of an Element in an Array

Find the Number of Distinct Colors Among the Balls

Block Placement Queries

Find the Number of Good Pairs I

String Compression III

Find the Number of Good Pairs II

Maximum Sum of Subsequence With Non-adjacent Elements

Calculate Parking Fees and Duration

Better Compression of String

Minimum Number of Chairs in a Waiting Room

Count Days Without Meetings

Lexicographically Minimum String After Removing Stars

Find Subarray With Bitwise OR Closest to K

Second Day Verification

Bitwise OR of Adjacent Elements

Clear Digits

Find The First Player to win K Games in a Row

Find the Maximum Length of a Good Subsequence I

Find the Maximum Length of a Good Subsequence II

Find the Child Who Has the Ball After K Seconds

Find the N-th Value After K Seconds

Maximum Total Reward Using Operations I

Maximum Total Reward Using Operations II

Find Top Scoring Students

The Number of Ways to Make the Sum

Count Pairs That Form a Complete Day I

Count Pairs That Form a Complete Day II

Maximum Total Damage With Spell Casting

Peaks in Array

Find Top Scoring Students II

Minimum Moves to Get a Peaceful Board

Find Minimum Operations to Make All Elements Divisible by Three

Minimum Operations to Make Binary Array Elements Equal to One I

Minimum Operations to Make Binary Array Elements Equal to One II

Count the Number of Inversions

Minimum Average of Smallest and Largest Elements

Find the Minimum Area to Cover All Ones I

Maximize Total Cost of Alternating Subarrays

Find the Minimum Area to Cover All Ones II

Find Cities in Each State

Count Triplets with Even XOR Set Bits I

Maximum Height of a Triangle