LeetCode

Compute Alternating Sum

Longest Subsequence With Non-Zero Bitwise XOR

Remove K-Balanced Substrings

Count No-Zero Pairs That Sum to N

Find Golden Hour Customers

Maximum Distance Between Unequal Words in Array II

Equal Score Substrings

Longest Fibonacci Subarray

Design Exam Scores Tracker

Maximum Partition Factor

Maximum Transactions Without Negative Balance

Sum of Elements With Frequency Divisible by K

Longest Balanced Substring I

Longest Balanced Substring II

Sum of Perfect Square Ancestors

Find Churn Risk Customers

Minimum Operations to Make the Array Beautiful

Smallest Missing Multiple of K

Longest Balanced Subarray I

Lexicographically Smallest Permutation Greater Than Target

Longest Balanced Subarray II

Lexicographically Smallest String After Reverse

Maximize Sum of Squares of Digits

Minimum Operations to Transform Array

Count Ways to Choose Coprime Integers from Rows

Remove Zeros in Decimal Representation

Maximum Alternating Sum of Squares

Stable Subarrays With Equal Boundary and Interior Sum

Count Distinct Subarrays Divisible by K in Sorted Array

Maximum Calories Burnt from Jumps

Find Missing Elements

Maximum Product of Three Elements After One Replacement

Minimum Time to Complete All Deliveries

Lexicographically Smallest Palindromic Permutation Greater Than Target

Lexicographically Smallest String After Reverse II

Minimum Moves to Equal Array Elements III

Count Subarrays With Majority Element I

Longest Non-Decreasing Subarray After Replacing at Most One Element

Count Subarrays With Majority Element II

Minimum Distance Between Three Equal Elements I

Minimum Distance Between Three Equal Elements II

Maximum Path Score in a Grid

Maximize Cyclic Partition Score

Find Kth Character in Expanded String

Maximize Expression of Three Elements

Minimum String Length After Balanced Removals

Count Distinct Integers After Removing Zeros

Count Stable Subarrays

Evaluate Valid Expressions

Minimum Number of Flips to Reverse Binary String