LeetCode

Find the Maximum Length of Valid Subsequence I

Find the Maximum Length of Valid Subsequence II

Find Minimum Diameter After Merging Two Trees

Bitwise User Permissions Analysis

Maximum Array Hopping Score I

Alternating Groups I

Maximum Points After Enemy Battles

Alternating Groups II

Number of Subarrays With AND Value of K

Find the Encrypted String

Generate Binary Strings Without Adjacent Zeros

Count Submatrices With Equal Frequency of X and Y

Construct String with Minimum Cost

Year on Year Growth Rate

Count Triplets with Even XOR Set Bits II

Lexicographically Smallest String After a Swap

Delete Nodes From Linked List Present in Array

Minimum Cost for Cutting Cake I

Minimum Cost for Cutting Cake II

Odd and Even Transactions

Maximum Array Hopping Score II

Find the Winning Player in Coin Game

Minimum Length of String After Operations

Minimum Array Changes to Make Differences Equal

Maximum Score From Grid Operations

Number of Bit Changes to Make Two Integers Equal

Vowels Game in a String

Maximum Number of Operations to Move Ones to the End

Minimum Operations to Make Array Equal to Target

Customer Purchasing Behavior Analysis

Minimum Number of Increasing Subsequence to Be Removed

Find if Digit Game Can Be Won

Find the Count of Numbers Which Are Not Special

Count the Number of Substrings With Dominant Ones

Check if the Rectangle Corner Is Reachable

CEO Subordinate Hierarchy

Alt and Tab Simulation

Find the Number of Winning Players

Minimum Number of Flips to Make Binary Grid Palindromic I

Minimum Number of Flips to Make Binary Grid Palindromic II

Time Taken to Mark All Nodes

Design Neighbor Sum Service

Shortest Distance After Road Addition Queries I

Shortest Distance After Road Addition Queries II

Alternating Groups III

Premier League Table Ranking

Number of Subsequences with Odd Sum

Snake in Matrix

Count the Number of Good Nodes

Find the Count of Monotonic Pairs I