LeetCode

Good Subsequence Queries

Zigzag Level Sum of Binary Tree

Smallest Stable Index I

Smallest Stable Index II

Multi Source Flood Fill

Count Good Integers on a Grid Path

Count Smaller Elements With Opposite Parity

Valid Digit Number

Compare Sums of Bitonic Parts

Count Connected Subgraphs with Even Node Sum

K-th Smallest Remaining Even Integer in Subarray Queries

Valid Elements in an Array

Sort Vowels by Frequency

Minimum Operations to Make Array Non Decreasing

Maximum Sum of Alternating Subsequence With Distance at Least K

Number of ZigZag Arrays III

Count Indices With Opposite Parity

Sum of Primes Between Number and Its Reverse

Minimum Cost to Move Between Indices

Maximize Fixed Points After Deletions

Score Validator

Minimum Flips to Make Binary String Coherent

Minimum Generations to Target Point

Minimum Threshold Path With Limited Heavy Edges

Concatenate Array With Reverse

Count Valid Word Occurrences

Minimize Array Sum Using Divisible Replacements

Minimum Cost to Buy Apples II

Minimum Partition Score II

Power Update After K-th Largest Insertion II

Check Adjacent Digit Differences

Count K-th Roots in a Range

Largest Local Values in a Matrix II

Smallest Unique Subarray

Power Update After K-th Largest Insertion I

Minimum Swaps to Move Zeros to End

Minimum Operations to Make Array Modulo Alternating I

Maximum Path Intersection Sum in a Grid

Count Non Adjacent Subsets in a Rooted Tree

Limit Occurrences in Sorted Array

Password Strength

Minimum Operations to Sort a Permutation

Number of Pairs After Increment

Minimum Operations to Make Array Modulo Alternating II

Digit Frequency Score

Maximum Number of Items From Sale I

Maximum Number of Items From Sale II

Lexicographically Maximum MEX Array

Subtree Inversion Sum II

Exactly One Consecutive Set Bits Pair