LeetCode

Hopper Company Queries III

Defuse the Bomb

Minimum Deletions to Make String Balanced

Minimum Jumps to Reach Home

Distribute Repeating Integers

Design an Ordered Stream

Determine if Two Strings Are Close

Minimum Operations to Reduce X to Zero

Maximize Grid Happiness

Correct a Binary Tree

Average Time of Process per Machine

Check If Two String Arrays are Equivalent

Smallest String With A Given Numeric Value

Ways to Make a Fair Array

Minimum Initial Energy to Finish Tasks

Change the Root of a Binary Tree

Fix Names in a Table

Maximum Repeating Substring

Merge In Between Linked Lists

Design Front Middle Back Queue

Minimum Number of Removals to Make Mountain Array

Richest Customer Wealth

Find the Most Competitive Subsequence

Minimum Moves to Make Array Complementary

Minimize Deviation in Array

Lowest Common Ancestor of a Binary Tree IV

Product's Worth Over Invoices

Goal Parser Interpretation

Max Number of K-Sum Pairs

Concatenation of Consecutive Binary Numbers

Minimum Incompatibility

Longest Palindromic Subsequence II

Invalid Tweets

Count the Number of Consistent Strings

Sum of Absolute Differences in a Sorted Array

Stone Game VI

Delivering Boxes from Storage to Ports

Count of Matches in Tournament

Partitioning Into Minimum Number Of Deci-Binary Numbers

Stone Game VII

Maximum Height by Stacking Cuboids

Count Ways to Distribute Candies

Daily Leads and Partners

Reformat Phone Number

Maximum Erasure Value

Jump Game VI

Checking Existence of Edge Length Limited Paths

Number of Distinct Substrings in a String

Number of Calls Between Two Persons

Number of Students Unable to Eat Lunch