LeetCode

Longest Unequal Adjacent Groups Subsequence II

Count of Sub-Multisets With Bounded Sum

Find Indices With Index and Value Difference I

Shortest and Lexicographically Smallest Beautiful String

Find Indices With Index and Value Difference II

Construct Product Matrix

Maximum Profitable Triplets With Increasing Prices I

Minimum Sum of Mountain Triplets I

Minimum Sum of Mountain Triplets II

Minimum Number of Groups to Create a Valid Assignment

Minimum Changes to Make K Semi-palindromes

Number of Ways to Reach Destination in the Grid

Subarrays Distinct Element Sum of Squares I

Minimum Number of Changes to Make Binary String Beautiful

Length of the Longest Subsequence That Sums to Target

Subarrays Distinct Element Sum of Squares II

Find the K-or of an Array

Minimum Equal Sum of Two Arrays After Replacing Zeros

Minimum Increment Operations to Make Array Beautiful

Maximum Points After Collecting Coins From All Nodes

Maximum Profitable Triplets With Increasing Prices II

Market Analysis III

Find Champion I

Find Champion II

Maximum Score After Applying Operations on a Tree

Maximum Balanced Subsequence Sum

Distribute Candies Among Children III

Distribute Candies Among Children I

Distribute Candies Among Children II

Number of Strings Which Can Be Rearranged to Contain Substring

Maximum Spending After Buying Items

Maximum Strong Pair XOR I

High-Access Employees

Minimum Operations to Maximize Last Elements in Arrays

Maximum Strong Pair XOR II

Number of Equal Numbers Blocks

Make Three Strings Equal

Separate Black and White Balls

Maximum Xor Product

Find Building Where Alice and Bob Can Meet

Maximum GCD-Sum of a Subarray

Find Words Containing Character

Maximize Area of Square Hole in Grid

Minimum Number of Coins for Fruits

Find Maximum Non-decreasing Array Length

Matrix Similarity After Cyclic Shifts

Count Beautiful Substrings I

Make Lexicographically Smallest Array by Swapping Elements

Count Beautiful Substrings II

Number of Divisible Substrings