Find Beautiful Indices in the Given Array II


Maximum Subtree of the Same Color


Count Prefix and Suffix Pairs II


Mark Elements on Array by Performing Queries


Find the Maximum Sum of Node Values


Apply Operations to Make String Empty


Count Prefix and Suffix Pairs I


Count the Number of Houses at a Certain Distance II


Ant on the Boundary


Number of Changing Keys


Maximum Strength of K Disjoint Subarrays


Most Frequent Prime


Maximum Number of Intersections on the Chart


Find the Sum of Subsequence Powers


Maximum Palindromes After Operations


Maximum Number of Operations With the Same Score II


Maximum Number of Operations With the Same Score I


Type of Triangle


Maximum Number of Removal Queries That Can Be Processed I


Split the Array


Find the Largest Area of Square Inside Two Rectangles


Count Pairs of Connectable Servers in a Weighted Tree Network


Minimum Moves to Pick K Ones


Apply Operations to Make Sum of Array Greater Than or Equal to k


Find the Length of the Longest Common Prefix


Modify the Matrix


Minimum Operations to Exceed Threshold Value I


Minimum Operations to Exceed Threshold Value II


Find Pattern in Infinite Stream I


Apple Redistribution into Boxes


Minimum Operations to Write the Letter Y on a Grid


Water Bottles II


Count Substrings Starting and Ending with Given Character


Count Submatrices with Top-Left Element and Sum Less Than k


Top Percentile Fraud


Snaps Analysis


Count Numbers With Unique Digits II


Minimize Manhattan Distances


Find the Sum of the Power of All Subsequences


Lexicographically Smallest String After Operations With Constraint


Distribute Elements Into Two Arrays I


Minimum Cost Walk in Weighted Graph


Maximum Length Substring With Two Occurrences


Distribute Elements Into Two Arrays II


Maximize Happiness of Selected Children


Find Pattern in Infinite Stream II


Existence of a Substring in a String and Its Reverse


Replace Question Marks in String to Minimize Its Value


Minimum Levels to Gain More Points


Shortest Uncommon Substring in an Array


Employees Project Allocation


Friends With No Mutual Friends


Linked List Frequency


Minimum Deletions to Make String K-Special


Latest Time You Can Obtain After Replacing Characters


Find the Median of the Uniqueness Array


Most Frequent IDs


Minimum Sum of Values by Dividing Array


Find All Unique Email Domains


User Activities within Time Bounds


Find the Sum of Encrypted Integers


Winner of the Linked List Game


Calculate Trapping Rain Water


Guess the Number Using Bitwise Questions I


Harshad Number


Longest Strictly Increasing or Strictly Decreasing Subarray


Maximum Prime Difference


Count Alternating Subarrays


Kth Smallest Amount With Single Denomination Combination


Longest Common Suffix Queries


Maximum Increasing Triplet Value


Score of a String


Shortest Subarray With OR at Least K II


Shortest Subarray With OR at Least K I


Find the Number of Subarrays Where Boundary Elements Are Maximum


Taking Maximum Energy From the Mystic Dungeon


Minimum Number of Operations to Make Word K-Periodic


Match Alphanumerical Pattern in Matrix I


Find Edges in Shortest Paths


Minimum Operations to Make Median of Array Equal to K


Right Triangles


Minimum Time to Visit Disappearing Nodes


Minimum Rectangles to Cover Points


Maximum Difference Score in a Grid


Find Trending Hashtags


Make String Anti-palindrome


Minimum Array End


Minimum Length of Anagram Concatenation


Valid Word


Find the Integer Added to Array I


Make a Square with the Same Color


Find the Integer Added to Array II


Find Bursty Behavior


Guess the Number Using Bitwise Questions II


Minimum Cost to Equalize Array


Minimum Substring Partition of Equal Character Frequency


Minimum Number of Operations to Satisfy Conditions


Count the Number of Special Characters II


Find All Possible Stable Binary Arrays I


Find All Possible Stable Binary Arrays II


Count the Number of Special Characters I


Find Trending Hashtags II


Find Longest Self-Contained Substring


Find Products of Elements of Big Array


Permutation Difference between Two Strings


Find The First Player to win K Games in a Row


Find Number of Ways to Reach the K-th Stair


Check if Grid Satisfies Conditions


Sum of Digit Differences of All Pairs


Find the Index of Permutation


Count Pairs That Form a Complete Day II


Maximum Points Inside the Square


Find Occurrences of an Element in an Array


Count Pairs That Form a Complete Day I


Find the N-th Value After K Seconds


Maximum Sum of Subsequence With Non-adjacent Elements


Friday Purchase III


Maximum Number of Potholes That Can Be Fixed


Minimum Number of Chairs in a Waiting Room


Special Array II


Find the XOR of Numbers Which Appear Twice


Special Array I


Count Days Without Meetings


Find the Minimum Cost Array Permutation


Find Longest Calls


Maximum Number That Makes Result of Bitwise AND Zero


Find the Number of Distinct Colors Among the Balls


Block Placement Queries


Find Subarray With Bitwise OR Closest to K


Maximum Total Damage With Spell Casting


Peaks in Array


Find Minimum Diameter After Merging Two Trees


Server Utilization Time


Equalize Strings by Adding or Removing Characters at Ends


Maximum Total Reward Using Operations I


Maximum Total Reward Using Operations II


Find the Number of Good Pairs II


Lexicographically Minimum String After Removing Stars


Find the Number of Good Pairs I


Clear Digits


Consecutive Available Seats II


Maximum Hamming Distances


Find the Child Who Has the Ball After K Seconds


String Compression III


Find the Maximum Length of a Good Subsequence II


Generate Binary Strings Without Adjacent Zeros


Minimum Operations to Make Array Equal to Target


Minimum Length of String After Operations


Find the Maximum Length of a Good Subsequence I


Invalid Tweets II


Maximum Number of Upgradable Servers


Find the Minimum Area to Cover All Ones II


Count the Number of Inversions


Find the Minimum Area to Cover All Ones I


Vowels Game in a String


Alternating Groups I


Maximize Total Cost of Alternating Subarrays


Employee Task Duration and Concurrent Tasks


Number of Subarrays With AND Value of K


Find the Level of Tree with Minimum Sum


Find the Encrypted String


Maximum Height of a Triangle


Maximum Score From Grid Operations


Minimum Average of Smallest and Largest Elements


Bitwise OR of Adjacent Elements


Calculate Parking Fees and Duration


Better Compression of String


Minimum Operations to Make Binary Array Elements Equal to One I


Find Minimum Operations to Make All Elements Divisible by Three


Minimum Operations to Make Binary Array Elements Equal to One II


Check if the Rectangle Corner Is Reachable


Count the Number of Substrings With Dominant Ones


Construct String with Minimum Cost (Easy)


Second Day Verification


Construct String with Minimum Cost


Alternating Groups II


Lexicographically Smallest String After a Swap


Maximize Score of Numbers in Ranges


Count the Number of Good Nodes


Find Maximum Removals From Source String


Find Top Scoring Students


The Number of Ways to Make the Sum


Find the Maximum Length of Valid Subsequence I


Find the Maximum Length of Valid Subsequence II


Count Submatrices With Equal Frequency of X and Y


Maximum Number of Operations to Move Ones to the End


Minimum Cost for Cutting Cake I


K-th Nearest Obstacle Queries


Minimum Number of Seconds to Make Mountain Height Zero


Find the Last Marked Nodes in Tree


Minimum Array Changes to Make Differences Equal


Count Substrings With K-Frequency Characters II


Minimum Cost for Cutting Cake II


Delete Nodes From Linked List Present in Array


Count Substrings With K-Frequency Characters I


Find Top Scoring Students II


Minimum Moves to Get a Peaceful Board


Find Cities in Each State


Count Triplets with Even XOR Set Bits I


Find the Count of Numbers Which Are Not Special


Number of Bit Changes to Make Two Integers Equal


K-th Largest Perfect Subtree Size in Binary Tree


Maximize the Total Height of Unique Towers


Find the Winning Player in Coin Game


Bitwise User Permissions Analysis


Maximum Array Hopping Score I


Shortest Distance After Road Addition Queries II


Find if Digit Game Can Be Won


Design Neighbor Sum Service


Shortest Distance After Road Addition Queries I


Maximum Multiplication Score


Find the Number of Winning Players


Year on Year Growth Rate


Count Triplets with Even XOR Set Bits II


Find the Power of K-Size Subarrays I


Find the Power of K-Size Subarrays II


Minimum Number of Flips to Make Binary Grid Palindromic II


Maximum Energy Boost From Two Drinks


Minimum Number of Flips to Make Binary Grid Palindromic I


Alternating Groups III


Reach End of Array With Max Score


Maximum Array Hopping Score II


Odd and Even Transactions


Minimum Amount of Damage Dealt to Bob


Time Taken to Mark All Nodes


Snake in Matrix


Count Almost Equal Pairs I


Find the Count of Monotonic Pairs I


Find the Count of Monotonic Pairs II


Number of Subsequences with Odd Sum


Alt and Tab Simulation


Customer Purchasing Behavior Analysis


Hash Divided String


Report Spam Message


Maximum Value Sum by Placing Three Rooks II


Count Substrings That Satisfy K-Constraint I


Count Almost Equal Pairs II


Minimum Number of Increasing Subsequence to Be Removed


Count Substrings That Satisfy K-Constraint II


Find the Count of Good Integers


CEO Subordinate Hierarchy


Maximum Value Sum by Placing Three Rooks I


Maximum XOR Score Subarray Queries


Find the Largest Palindrome Divisible by K


Check if Two Chessboard Squares Have the Same Color


Premier League Table Ranking


Final Array State After K Multiplication Operations I


Final Array State After K Multiplication Operations II


Minimum Number of Valid Strings to Form Target II


Find a Safe Walk Through a Grid


Minimum Number of Valid Strings to Form Target I


Maximum Number of Moves to Kill All Pawns


Remove Methods From Project


Maximum Score of Non-overlapping Intervals


Select Cells in Grid With Maximum Score


Premier League Table Ranking II


Minimize Connected Groups by Inserting Interval


Find the Sequence of Strings Appeared on the Screen


Convert Date to Binary


Find the Key of the Numbers


Count of Substrings Containing Every Vowel and K Consonants II


Count of Substrings Containing Every Vowel and K Consonants I


Length of the Longest Increasing Path


Count Substrings That Can Be Rearranged to Contain a String II


Count Substrings That Can Be Rearranged to Contain a String I


Find Overlapping Shifts


Find the Maximum Sequence Value of Array


Find Subtree Sizes After Changes


Convert Doubly Linked List to Array I


Construct 2D Grid Matching Graph Layout


Maximum Possible Number by Binary Concatenation


Find the Occurrence of First Almost Equal Substring


The Two Sneaky Numbers of Digitville


Find Indices of Stable Mountains


Sorted GCD Pair Queries


Find the Lexicographically Smallest Valid Sequence


Find Overlapping Shifts II


Constructing Two Increasing Arrays


Maximum Points Tourist Can Earn


Count The Number of Winning Sequences


Find Candidates for Data Scientist Position II


Maximum Total Area Occupied by Pistons


Shift Distance Between Two Strings


Find X-Sum of All K-Long Subarrays II


Find the Maximum Factor Score of Array


Identify the Largest Outlier in an Array


Rearrange K Substrings to Form Target String


Find the K-th Character in String Game I


Find the K-th Character in String Game II


Sum of Consecutive Subarrays


Check if DFS Strings Are Palindromes


Find the Number of Possible Ways for an Event


Construct the Minimum Bitwise Array I


Minimum Element After Replacement With Digit Sum


Minimum Division Operations to Make Array Non Decreasing


Find the Number of Subsequences With Equal GCD


Calculate Product Final Price


Find X-Sum of All K-Long Subarrays I


Construct the Minimum Bitwise Array II


Adjacent Increasing Subarrays Detection I


Maximize Amount After Two Days of Conversions


Find the Number of K-Even Arrays


Convert Doubly Linked List to Array II


Make Array Elements Equal to Zero


Find the Original Typed String I


Find the Original Typed String II


Adjacent Increasing Subarrays Detection II


Maximum Number of Distinct Elements After Operations


Minimum Operations to Make Array Values Equal to K


Maximum Frequency of an Element After Performing Operations I


Sum of Consecutive Subsequences


Find Top Performing Driver


Stone Removal Game


Smallest Divisible Digit Product I


Find Minimum Time to Reach Last Room I


Find Minimum Time to Reach Last Room II


Total Characters in String After Transformations I


Total Characters in String After Transformations II


Count K-Reducible Numbers Less Than N


Button with Longest Push Time


Maximize the Number of Target Nodes After Connecting Trees I


Find Mirror Score of a String


Smallest Divisible Digit Product II


Check Balanced String


Count Number of Balanced Permutations


Minimum Operations to Make Character Frequencies Equal


Zero Array Transformation I


Maximum Frequency of an Element After Performing Operations II


Premier League Table Ranking III


Zero Array Transformation II


Minimum Positive Sum Subarray


Maximize the Number of Target Nodes After Connecting Trees II


Sum of Good Subsequences


Zero Array Transformation III


Find the Maximum Number of Fruits Collected


Minimum Time to Break Locks I


Find Cities in Each State II


Transformed Array


Find Sorted Submatrices With Maximum Element at Most K


Maximum Subarray Sum With Length Divisible by K


Minimum Array Sum


Digit Operations to Make Two Integers Equal


Minimum Number of Operations to Make Elements in Array Distinct


Check if Grid can be Cut into Sections


Minimize the Maximum Adjacent Element Difference


Count Paths With the Given XOR Value


Second Highest Salary II


Count Non-Decreasing Subarrays After K Operations


Maximize Sum of Weights after Edge Removals


Smallest Number With All Set Bits


Maximum Amount of Money Robot Can Earn


Design Task Manager


Maximum Sized Array


Count Connected Components in LCM Graph


Maximum Area Rectangle With Point Constraints I


Count the Number of Arrays with K Matching Adjacent Elements


Find the Lexicographically Largest String From the Box I


Substring Matching Pattern


Count Subarrays of Length Three With a Condition


Count Beautiful Splits in an Array


Longest Special Path


Maximize Subarray Sum After Removing All Occurrences of One Element


Maximum Area Rectangle With Point Constraints II


Smallest Substring With Identical Characters I


Minimum Operations to Make Columns Strictly Increasing


Shortest Matching Substring


Minimum Time to Break Locks II


Minimum Total Operations


Books with NULL Ratings


Count Substrings Divisible By Last Digit


Minimum Increments for Target Multiples in an Array


Minimum Operations to Make Subarray Elements Equal


Count Special Subsequences


Subsequences with a Unique Middle Mode I


Minimum Cost Good Caption


Maximum Subarray With Equal Products


First Letter Capitalization


Count Partitions with Even Sum Difference


Find the Largest Almost Missing Integer


Smallest Substring With Identical Characters II


Find the Most Common Response


Zigzag Grid Traversal With Skip


Find Special Substring of Length K


Design an Array Statistics Tracker


First Letter Capitalization II


Minimum Cost to Make Arrays Identical


Frequencies of Shortest Supersequences


Maximum and Minimum Sums of at Most Size K Subsequences


Maximum Coins From K Consecutive Bags


Longest Subsequence With Decreasing Adjacent Difference


Minimum Operations to Make Elements Within K Subarrays Equal


Minimum Runes to Add to Cast Spell


Team Dominance by Pass Success


Minimize the Maximum Edge Weight of Graph


Count Mentions Per User


Sum of K Subarrays With Length at Least M


Sum of Good Numbers


Maximum and Minimum Sums of at Most Size K Subarrays


Longest Team Pass Streak


Unit Conversion I


Sum of Variable Length Subarrays


Calculate Score After Performing Instructions


Length of Longest V-Shaped Diagonal Segment


Design a 3D Binary Matrix with Efficient Layer Tracking


Find Valid Pair of Adjacent Digits in String


Paint House IV


Make Array Non-decreasing


Manhattan Distances of All Arrangements of Pieces


Maximum Number of Matching Indices After Right Shifts


Reschedule Meetings for Maximum Free Time II


Reschedule Meetings for Maximum Free Time I


Minimum Operations to Make Array Elements Zero


Find Circular Gift Exchange Chains


Maximum Difference Between Adjacent Elements in a Circular Array


Sort Matrix by Diagonals


Find the Lexicographically Largest String From the Box II


Closest Equal Element Queries


Maximum Frequency After Subarray Operation


Unit Conversion II


Maximum Difference Between Even and Odd Frequency I


Maximum Manhattan Distance After K Changes


Maximum Product of First and Last Elements of a Subsequence


Subsequences with a Unique Middle Mode II


Find Products with Three Consecutive Digits


Minimum Unlocked Indices to Sort Nums


Choose K Elements With Maximum Sum


Assign Elements to Groups with Constraints


Maximum Difference Between Even and Odd Frequency II


Maximize the Minimum Game Score


Separate Squares I


Maximum Sum With at Most K Elements


Minimum Cost to Divide Array Into Subarrays


Maximum Median Sum of Subsequences of Size 3


Find Students Who Improved


Check If Digits Are Equal in String After Operations I


Lexicographically Smallest Generated String


Select K Disjoint Special Substrings


Minimum Pair Removal to Sort Array II


Minimum Pair Removal to Sort Array I


Check If Digits Are Equal in String After Operations II


Separate Squares II


Find Minimum Cost to Remove Array Elements


Maximum Product of Subsequences With an Alternating Sum Equal to K


Transform Array by Parity


Eat Pizzas!


Permutations III


Maximize the Distance Between Points on a Square


Find Valid Emails


Permutations IV


Longest Common Prefix of K Strings After Removal


Find the Number of Copy Arrays


Longest Palindromic Subsequence After at Most K Operations


Maximum Students on a Single Bench


Maximum Unique Subarray Sum After Deletion


Maximize Subarrays After Removing One Conflicting Pair


Fruits Into Baskets II


Fruits Into Baskets III


Find Invalid IP Addresses


Longest Palindrome After Substring Concatenation I


Find the Minimum Amount of Time to Brew Potions


Zero Array Transformation IV


Longest Common Prefix After at Most One Removal


Design Spreadsheet


Longest Special Path II


Unique 3-Digit Even Numbers


Longest Common Prefix Between Adjacent Strings After Removals


Count Beautiful Numbers


Find Products with Valid Serial Numbers


Maximize Active Section with Trade II


Maximize Active Section with Trade I


Maximum Coin Collection


Find Maximum Value in a Constrained Sequence


Longest Palindrome After Substring Concatenation II


Properties Graph


Count Numbers with Non-Decreasing Digits


Reverse Degree of a String


Smallest Palindromic Rearrangement I


Smallest Palindromic Rearrangement II


Find Time Required to Eliminate Bacterial Strains


Sum of Largest Prime Substrings


DNA Pattern Recognition


Maximum Containers on a Ship


Maximize Profit from Task Assignment


Count Covered Buildings


Number of Unique XOR Triplets II


Count Cells in Overlapping Horizontal and Vertical Substrings


Fill a Special Grid


Count Islands With Total Value Divisible by K


Number of Unique XOR Triplets I


Apply Substitutions


Maximum Profit from Valid Topological Order in DAG


Implement Router


Analyze Organization Hierarchy


Shortest Path in a Weighted Tree


Find Closest Person


Find X Value of Array I


Minimum Cost to Reach Every Position


Merge Operations for Minimum Travel Time


Minimum Operations to Convert All Elements to Zero


Count Partitions With Max-Min Difference at Most K


Phone Number Prefix


Grid Teleportation Traversal


Path Existence Queries in a Graph I


Maximize Score After Pair Deletions


Find X Value of Array II


Concatenated Divisibility


Number of Ways to Assign Edge Weights II


Partition Array into Two Equal Product Subsets


Number of Ways to Assign Edge Weights I


Maximum Sum of Edge Values in a Graph


Minimum Operations to Make Array Sum Divisible by K


Minimum Swaps to Sort by Digit Sum


Analyze Subscription Conversion


Equal Sum Grid Partition I


Equal Sum Grid Partition II


Find Sum of Array Product of Magical Sequences


Path Existence Queries in a Graph II


Minimum Weighted Subgraph With the Required Paths II


Maximum Profit from Trading Stocks with Discounts


Make a Positive Array


Maximum Weighted K-Edge Path


Find Maximum Number of Non Intersecting Substrings


Subtree Inversion Sum


Maximum Product of Two Digits


Resulting String After Adjacent Removals


Minimum Threshold for Inversion Pairs Count


Range XOR Queries with Subarray Reversals


Power Grid Maintenance


Count the Number of Computer Unlocking Permutations


Find Product Recommendation Pairs


Minimum Steps to Convert String with Operations


Lexicographically Smallest String After Adjacent Removals


Find Maximum Area of a Triangle


Smallest Index With Digit Sum Equal to Index


Minimum Moves to Clean the Classroom


Minimum Deletions for At Most K Distinct Characters


Find Most Frequent Vowel and Consonant


Subsequence Sum After Capping Elements


Maximum Good Subtree Score


Transform Array to All Equal Elements


Two-Letter Card Game


Maximize Count of Distinct Primes After Split


Find Minimum Log Transportation Cost


Minimum Time to Visit All Houses


Minimize Maximum Component Cost


Partition Array for Maximum XOR and AND


Multiply Two Polynomials


Minimum Absolute Difference in Sliding Submatrix


Count Special Triplets


Count Number of Trapezoids I


Minimum Cost Path with Edge Reversals


Maximize Subarray GCD Score


Minimum Cost Path with Teleportations


Smallest Subarray to Sort in Every Sliding Window


Find Category Recommendation Pairs


Best Time to Buy and Sell Stock V


Generate Tag for Video Caption


Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values


Minimum Time to Transport All Individuals


Count Number of Trapezoids II


Seasonal Sales Analysis


Sequential Grid Path Cover


Find Weighted Median Node in Tree


Maximize Spanning Tree Stability with Upgrades


Inverse Coin Change


Minimum Adjacent Swaps to Alternate Parity


Partition String


Kth Smallest Path XOR Sum


Count Prime-Gap Balanced Subarrays


Minimum Time for K Connected Components


Minimum Increments to Equalize Leaf Paths


Find Books with No Available Copies


Find the Shortest Superstring II


Hexadecimal and Hexatrigesimal Conversion


Partition Array to Minimize XOR


Check if Any Element Has Prime Frequency


Maximum Product of Two Integers With No Common Bits


Minimum Time to Reach Destination in Directed Graph


Check Divisibility by Digit Sum and Product


Network Recovery Pathways


Minimum Stability Factor of Array


Find Consistently Improving Employees


Minimum Moves to Reach Target in Grid


Count Odd Letters from Number


Minimum Cost Path with Alternating Directions I


Minimum Cost Path with Alternating Directions II


Split and Merge Array Transformation


Subarrays with XOR at Least K


Longest Palindromic Path in Graph


Process String with Special Operations I


Find COVID Recovery Patients


Minimum Jumps to Reach End via Prime Teleportation


Coupon Code Validator


Once Twice


Split Array by Prime Indices


Number of Integers With Popcount-Depth Equal to K I


Twisted Mirror Path Count


Process String with Special Operations II


Number of Integers With Popcount-Depth Equal to K II


Find Drivers with Improved Fuel Efficiency


Find Overbooked Employees


Minimum Time to Activate String


Minimum Sensors to Cover Grid


Find Maximum Balanced XOR Subarray Length


Balanced K-Factor Decomposition


Maximum Number of Subsequences After One Inserting


Minimum Number of Primes to Sum to Target


Maximum K to Sort a Permutation


Next Special Palindrome Number


Trionic Array I


Minimum Discards to Balance Inventory


Maximum Balanced Shipments


Threshold Majority Queries


Trionic Array II


Sum of Perfect Square Ancestors


Minimum Removals to Balance Array


Maximum Total from Optimal Activation Order


Number of Student Replacements


Find Students with Study Spiral Pattern


Number of ZigZag Arrays I


Number of Perfect Pairs


Number of ZigZag Arrays II


Earliest Finish Time for Land and Water Rides I


Minimum Sum After Divisible Sum Deletions


Earliest Finish Time for Land and Water Rides II


Sort Threats by Severity and Exploitability


Find Stores with Inventory Imbalance


Flip Square Submatrix Vertically


XOR After Range Multiplication Queries I


XOR After Range Multiplication Queries II


Partition Array Into K-Distinct Groups


Best Time to Buy and Sell Stock using Strategy


Jump Game IX


Maximum Walls Destroyed by Robots


Minimum Operations to Equalize Binary String


Maximum Path Score in a Grid


Maximum Weight in Two Bags


Sum of Beautiful Subsequences


Maximum XOR of Subsequences


Generate Schedule


Longest Semi-Repeating Subarray


Find The Least Frequent Digit


GCD of Odd and Even Sums


Find Books with Polarized Opinions


Maximize Sum of At Most K Distinct Elements


Minimum Operations to Equalize Array


Minimum Operations to Transform String


Count Bowl Subarrays


Count Subarrays With K Distinct Integers


Longest Fibonacci Subarray


Maximum Total Subarray Value I


Determine if a Simple Graph Exists


Maximum Total Subarray Value II


Restore Finishing Order


Bitwise OR of Even Numbers in an Array


Maximize Alternating Sum Using Swaps


Smallest Absent Positive Greater Than Average


Earliest Time to Finish One Task


Merge Close Characters


Split Array With Minimum Difference


Filter Characters by Frequency


Minimum Moves to Balance Circular Array


Remove K-Balanced Substrings


Lexicographically Smallest Permutation Greater Than Target


Distinct Points Reachable After Substring Removal


Minimum Operations to Equalize Subarrays


Count Binary Palindromic Numbers


Minimum Cost to Split into Ones


Find Loyal Customers


Number of Stable Subsequences


Sort Array By Absolute Value


Maximize Cyclic Partition Score


Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND


Longest Subsequence With Non-Zero Bitwise XOR


Maximum Partition Factor


Sum of Weighted Modes in Subarrays


Lexicographically Smallest Palindromic Permutation Greater Than Target


Compute Decimal Representation


Climbing Stairs II


Minimum Operations to Transform Array


Find Zombie Sessions


Maximum Bitwise XOR After Rearrangement


Longest Balanced Subarray I


Longest Balanced Subarray II


Minimum Time to Complete All Deliveries


Count No-Zero Pairs That Sum to N


Minimum Index Sum of Common Elements


Remove Zeros in Decimal Representation


Equal Score Substrings


Majority Frequency Characters


Count Distinct Integers After Removing Zeros


Longest Balanced Substring I


Longest Balanced Substring II


Total Waviness of Numbers in Range I


Compute Alternating Sum


Design Exam Scores Tracker


Library Late Fee Calculator


Minimum Swaps to Avoid Forbidden Values


House Robber V


Count Distinct Subarrays Divisible by K in Sorted Array


Minimum Deletions to Make Alternating Substring


Count Sequences to K


Maximum Distance Between Unequal Words in Array I


Design Auction System


Sum of Elements With Frequency Divisible by K


Count Ways to Choose Coprime Integers from Rows


Maximum Distance Between Unequal Words in Array II


Word Squares II


Total Sum of Interaction Cost in Tree Groups


Lexicographically Smallest String After Reverse


Count Subarrays With Majority Element I


Count Subarrays With Majority Element II


Lexicographically Smallest Negated Permutation that Sums to Target


Maximum Alternating Sum of Squares


Maximum Capacity Within Budget


Smallest Missing Multiple of K


Maximum Transactions Without Negative Balance


Stable Subarrays With Equal Boundary and Interior Sum


Maximize Sum of Squares of Digits


Largest Prime from Consecutive Prime Sum


Lexicographically Smallest String After Deleting Duplicate Characters


Maximum Substrings With Distinct Start


Maximize Points After Choosing K Tasks


Minimum String Length After Balanced Removals


Find Golden Hour Customers


Number of Balanced Integers in a Range


Longest Non-Decreasing Subarray After Replacing at Most One Element


Minimum Operations to Make Binary Palindrome


Complete Prime Number


Maximum Product of Three Elements After One Replacement


Find Churn Risk Customers


Lexicographically Smallest String After Reverse II


Find Missing Elements


Minimum Operations to Make the Array Beautiful


Maximum Calories Burnt from Jumps


Count Stable Subarrays


Maximize Expression of Three Elements


Find Kth Character in Expanded String


Minimum Distance Between Three Equal Elements I


Minimum Moves to Equal Array Elements III


Design Ride Sharing System


Minimum Distance Between Three Equal Elements II


Minimum Partition Score


Final Element After Subarray Deletions


Minimum Number of Flips to Reverse Binary String


Minimum Distance Excluding One Maximum Weighted Edge


Total Waviness of Numbers in Range II


Number of Centered Subarrays


Maximum Score After Binary Swaps


Number of Ways to Paint Sheets


Number of Effective Subsequences


Concatenate Non-Zero Digits and Multiply by Sum I


Concatenate Non-Zero Digits and Multiply by Sum II


Number of Prefix Connected Groups


Minimum Deletion Cost to Make All Characters Equal


Minimum Absolute Distance Between Mirror Pairs


Evaluate Valid Expressions


Count Elements With at Least K Greater Values


Number of Alternating XOR Partitions


Minimum Cost to Merge Sorted Lists


Minimum Inversion Count in Subarrays of Fixed Length


Total Score of Dungeon Runs


Minimum Cost to Acquire Required Items


Convert Number Words to Digits


Sort Integers by Binary Reflection


Maximum Subgraph Score in a Tree


Minimum Subarray Length With Distinct Sum At Least K


Count Routes to Climb a Rectangular Grid


Maximum Bitwise AND After Increment Operations


Maximum Number of Equal Length Runs


Minimum Cost to Make Two Binary Strings Equal


Reverse Words With Same Vowel Count


Absolute Difference Between Maximum and Minimum K Elements


Count Fancy Numbers in a Range


Maximum Sum of Three Numbers Divisible by Three


Minimum Bitwise OR From Grid


Minimum Number of Operations to Have Distinct Elements


Last Remaining Integer After Alternating Deletion Operations


Find Diameter Endpoints of a Tree


Maximum Total Sum with Threshold Constraints


Mirror Distance of an Integer


Most Common Course Pairs


Total Distance to Type a String Using One Finger


Rotate Non Negative Elements


Sum of Increasing Product Blocks


Maximum Score of a Split


Smallest All-Ones Multiple


Minimum K to Reduce Array Within Limit


Reverse String Prefix


Vowel-Consonant Score


Largest Even Number


Pythagorean Distance Nodes in a Tree


Minimum Edge Toggles on a Tree


Count Caesar Cipher Pairs


Count Residue Prefixes


Best Reachable Tower


Find Nth Smallest Integer With K One Bits


Minimum Operations to Reach Target Array


Minimum Cost to Partition a Binary String


Count Monobit Integers


Find Users with High Token Usage


Minimum Cost to Repair Edges to Traverse a Graph


Longest Alternating Subarray After Removing At Most One Element


Minimum Prefix Removal to Make Array Strictly Increasing


Reverse Letters Then Special Characters in a String


Design Order Management System


Maximum Score Using Exactly K Pairs


Maximum Subarray XOR with Bounded Range


Good Indices in a Digit String


Find Emotionally Consistent Users


Palindromic Path Queries in a Tree


Median of a Binary Search Tree Level


Count Subarrays With Cost Less Than or Equal to K


Toggle Light Bulbs


Merge Adjacent Equal Elements


Count Dominant Indices


Weighted Word Mapping


First Element with Unique Frequency


Minimum Operations to Make Array Parity Alternating


Minimum Operations to Sort a String


Longest Almost-Palindromic Substring


Find the Score Difference in a Game


Check Digitorial Permutation


Find Users with Persistent Behavior Patterns


Delayed Count of Equal Elements


Trim Trailing Vowels


Longest Arithmetic Sequence After Changing At Most One Element


Smallest Pair With Different Frequencies


Sum of K-Digit Numbers in a Range


Find the Smallest Balanced Index


Unique Email Groups


Sum of GCD of Formed Pairs


Count Commas in Range


Minimum Capacity Box


Count Commas in Range II


Maximum Points Activated with One Addition


Maximum Requests Without Violating the Limit


First Unique Even Element


Minimum Cost to Equalize Arrays Using Swaps


Reverse K Subarrays