Company: N/A
- A Number After a Double Reversal
- Account Balance After Rounded Purchase
- Add Minimum Number of Rungs
- Adjacent Increasing Subarrays Detection II
- Alt and Tab Simulation
- Alternating Groups III
- Analyze Organization Hierarchy
- Array of Objects to Matrix
- Array Prototype ForEach
- Array Reduce Transformation
- Array Upper Bound
- Array Wrapper
- Assign Elements to Groups with Constraints
- Beautiful Pairs
- Binary Prefix Divisible By 5
- Bind Function to Context
- Building Boxes
- Button with Longest Push Time
- Calculate Delayed Arrival Time
- Calculator with Method Chaining
- Call Function with Custom Context
- Capitalize the Title
- Card Flipping Game
- Cells in a Range on an Excel Sheet
- Change Data Type
- Check Array Formation Through Concatenation
- Check Balanced String
- Check Distances Between Same Letters
- Check If a String Can Break Another String
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- Check if an Array Is Consecutive
- Check if Array is Good
- Check If Digits Are Equal in String After Operations I
- Check If Digits Are Equal in String After Operations II
- Check if Grid Satisfies Conditions
- Check if Matrix Is X-Matrix
- Check if Numbers Are Ascending in a Sentence
- Check if String Is Decomposable Into Value-Equal Substrings
- Check if The Number is Fascinating
- Check if Two Chessboard Squares Have the Same Color
- Check if Word Equals Summation of Two Words
- Choose K Elements With Maximum Sum
- Chunk Array
- Circular Sentence
- Closest Equal Element Queries
- Closest Fair Integer
- Closest Node to Path in Tree
- Color the Triangle Red
- Compact Object
- Construct 2D Grid Matching Graph Layout
- Construct Product Matrix
- Construct String with Minimum Cost (Easy)
- Construct the Rectangle
- Constructing Two Increasing Arrays
- Convert Callback Based Function to Promise Based Function
- Convert Date to Binary
- Convert Doubly Linked List to Array I
- Convert Doubly Linked List to Array II
- Convert JSON String to Object
- Coordinate With Maximum Network Quality
- Count All Possible Routes
- Count Almost Equal Pairs I
- Count Almost Equal Pairs II
- Count Beautiful Numbers
- Count Beautiful Splits in an Array
- Count Connected Components in LCM Graph
- Count Days Spent Together
- Count Elements With Strictly Smaller and Greater Elements
- Count Houses in a Circular Street II
- Count K-Reducible Numbers Less Than N
- Count Mentions Per User
- Count Nodes That Are Great Enough
- Count Number of Balanced Permutations
- Count Number of Possible Root Nodes
- Count of Interesting Subarrays
- Count of Sub-Multisets With Bounded Sum
- Count of Substrings Containing Every Vowel and K Consonants I
- Count of Substrings Containing Every Vowel and K Consonants II
- Count Pairs That Form a Complete Day I
- Count Pairs That Form a Complete Day II
- Count Partitions with Even Sum Difference
- Count Paths With the Given XOR Value
- Count Special Integers
- Count Special Quadruplets
- Count Subarrays of Length Three With a Condition
- Count Substrings Divisible By Last Digit
- Count Substrings Starting and Ending with Given Character
- Count Substrings That Can Be Rearranged to Contain a String I
- Count Substrings That Can Be Rearranged to Contain a String II
- Count Substrings That Satisfy K-Constraint I
- Count Substrings That Satisfy K-Constraint II
- Count Substrings With K-Frequency Characters II
- Count Subtrees With Max Distance Between Cities
- Count the Number of Beautiful Subarrays
- Count the Number of Good Nodes
- Count The Number of Winning Sequences
- Count The Repetitions
- Create a New Column
- Create Object from Two Arrays
- Curry
- Custom Interval
- Cyclically Rotating a Grid
- Date Range Generator
- Decode XORed Array
- Decremental String Concatenation
- Deep Merge of Two Objects
- Deep Object Filter
- Delay the Resolution of Each Promise
- Delete Greatest Value in Each Row
- Depth of BST Given Insertion Order
- Design a 3D Binary Matrix with Efficient Layer Tracking
- Design an Array Statistics Tracker
- Design Bitset
- Design Cancellable Function
- Design Neighbor Sum Service
- Design Spreadsheet
- Difference of Number of Distinct Values on Diagonals
- Digit Operations to Make Two Integers Equal
- Distinct Prime Factors of Product of Array
- Divisible and Non-divisible Sums Difference
- Drop Duplicate Rows
- Drop Missing Data
- Eat Pizzas!
- Election Results
- Elements in Array After Removing and Replacing Elements
- Encode N-ary Tree to Binary Tree
- Execution of All Suffix Instructions Staying in a Grid
- Factorial Generator
- Fill Missing Data
- Final Array State After K Multiplication Operations II
- Find a Good Subset of the Matrix
- Find All Possible Stable Binary Arrays I
- Find All Possible Stable Binary Arrays II
- Find if Digit Game Can Be Won
- Find Maximal Uncovered Ranges
- Find Maximum Number of String Pairs
- Find Maximum Removals From Source String
- Find Minimum Time to Reach Last Room II
- Find Mirror Score of a String
- Find Shortest Path with K Hops
- Find Sorted Submatrices With Maximum Element at Most K
- Find Special Substring of Length K
- Find Substring With Given Hash Value
- Find Subtree Sizes After Changes
- Find the Closest Marked Node
- Find the Count of Good Integers
- Find the Count of Numbers Which Are Not Special
- Find the Distinct Difference Array
- Find the Encrypted String
- Find the Index of Permutation
- Find the K-th Character in String Game I
- Find the K-th Character in String Game II
- Find the Largest Almost Missing Integer
- Find the Largest Palindrome Divisible by K
- Find the Lexicographically Largest String From the Box I
- Find the Lexicographically Largest String From the Box II
- Find the Lexicographically Smallest Valid Sequence
- Find the Longest Semi-Repetitive Substring
- Find the Losers of the Circular Game
- Find the Maximum Factor Score of Array
- Find the Maximum Number of Fruits Collected
- Find the Maximum Number of Marked Indices
- Find the Minimum Amount of Time to Brew Potions
- Find the Number of Copy Arrays
- Find the Number of K-Even Arrays
- Find the Number of Subsequences With Equal GCD
- Find the Number of Winning Players
- Find the Original Typed String I
- Find the Original Typed String II
- Find the Power of K-Size Subarrays II
- Find the Sequence of Strings Appeared on the Screen
- Find the Value of the Partition
- Find the Winning Player in Coin Game
- Find the XOR of Numbers Which Appear Twice
- Find Time Required to Eliminate Bacterial Strains
- Find Valid Pair of Adjacent Digits in String
- Find X-Sum of All K-Long Subarrays II
- Fizz Buzz Multithreaded
- Flip Binary Tree To Match Preorder Traversal
- Frequencies of Shortest Supersequences
- Fruits Into Baskets III
- Game of Nim
- Generate a String With Characters That Have Odd Counts
- Generate Circular Array Values
- Goal Parser Interpretation
- Graph Connectivity With Threshold
- Group By
- Guess the Number Using Bitwise Questions I
- Guess the Number Using Bitwise Questions II
- Happy Students
- Harshad Number
- Hash Divided String
- Height of Special Binary Tree
- Immutability Helper
- Implement Router
- Infinite Method Object
- Insert Greatest Common Divisors in Linked List
- Interval Cancellation
- Inversion of Object
- Is Array a Preorder of Some Binary Tree
- JSON Deep Equal
- Jump Game V
- K Items With the Maximum Sum
- Kth Smallest Amount With Single Denomination Combination
- Kth Smallest Instructions
- Last Visited Integers
- Length of the Longest Increasing Path
- Lexicographically Smallest Generated String
- Linked List Frequency
- Logical OR of Two Binary Grids Represented as Quad-Trees
- Longer Contiguous Segments of Ones than Zeros
- Longest Alternating Subarray
- Longest Common Prefix After at Most One Removal
- Longest Common Prefix of K Strings After Removal
- Longest Even Odd Subarray With Threshold
- Longest Palindrome After Substring Concatenation I
- Longest Palindrome After Substring Concatenation II
- Longest Palindromic Subsequence II
- Longest Special Path II
- Longest Special Path
- Longest Turbulent Subarray
- Make a Positive Array
- Make a Square with the Same Color
- Make Array Elements Equal to Zero
- Make Array Strictly Increasing
- Make Object Immutable
- Making File Names Unique
- Maximize Active Section with Trade I
- Maximize Active Section with Trade II
- Maximize Profit from Task Assignment
- Maximize Score After Pair Deletions
- Maximize Score of Numbers in Ranges
- Maximize Subarrays After Removing One Conflicting Pair
- Maximize Sum of Weights after Edge Removals
- Maximize the Distance Between Points on a Square
- Maximize the Minimum Game Score
- Maximize the Minimum Powered City
- Maximize the Number of Target Nodes After Connecting Trees I
- Maximize the Number of Target Nodes After Connecting Trees II
- Maximize the Total Height of Unique Towers
- Maximum Amount of Money Robot Can Earn
- Maximum and Minimum Sums of at Most Size K Subarrays
- Maximum Area Rectangle With Point Constraints II
- Maximum Coin Collection
- Maximum Containers on a Ship
- Maximum Cost of Trip With K Highways
- Maximum Difference Between Adjacent Elements in a Circular Array
- Maximum Difference Between Even and Odd Frequency I
- Maximum Difference Between Even and Odd Frequency II
- Maximum Difference by Remapping a Digit
- Maximum Distance Between a Pair of Values
- Maximum Elegance of a K-Length Subsequence
- Maximum Enemy Forts That Can Be Captured
- Maximum Frequency After Subarray Operation
- Maximum GCD-Sum of a Subarray
- Maximum Hamming Distances
- Maximum Manhattan Distance After K Changes
- Maximum Multiplication Score
- Maximum Number of Distinct Elements After Operations
- Maximum Number of Groups Entering a Competition
- Maximum Number of Matching Indices After Right Shifts
- Maximum Number of Moves to Kill All Pawns
- Maximum Number of People That Can Be Caught in Tag
- Maximum Number of Removal Queries That Can Be Processed I
- Maximum OR
- Maximum Points Tourist Can Earn
- Maximum Product of Subsequences With an Alternating Sum Equal to K
- Maximum Product of the Length of Two Palindromic Substrings
- Maximum Profit of Operating a Centennial Wheel
- Maximum Score of Non-overlapping Intervals
- Maximum Sized Array
- Maximum Square Area by Removing Fences From a Field
- Maximum Students on a Single Bench
- Maximum Subarray With Equal Products
- Maximum Sum Queries
- Maximum Sum With at Most K Elements
- Maximum Sum With Exactly K Elements
- Maximum Total Area Occupied by Pistons
- Maximum Trailing Zeros in a Cornered Path
- Maximum Unique Subarray Sum After Deletion
- Maximum Value after Insertion
- Maximum Value of a String in an Array
- Maximum Value Sum by Placing Three Rooks I
- Maximum Value Sum by Placing Three Rooks II
- Maximum Xor Product
- Memoize II
- Method Chaining
- Min Max Game
- Minimize Connected Groups by Inserting Interval
- Minimize OR of Remaining Elements Using Operations
- Minimize String Length
- Minimize the Maximum Adjacent Element Difference
- Minimum Amount of Damage Dealt to Bob
- Minimum Amount of Time to Fill Cups
- Minimum Changes to Make K Semi-palindromes
- Minimum Cost for Cutting Cake I
- Minimum Cost for Cutting Cake II
- Minimum Cost Good Caption
- Minimum Cost of Buying Candies With Discount
- Minimum Cost to Divide Array Into Subarrays
- Minimum Cost to Make All Characters Equal
- Minimum Cost to Make Arrays Identical
- Minimum Cost to Reach Every Position
- Minimum Element After Replacement With Digit Sum
- Minimum Hours of Training to Win a Competition
- Minimum Increments for Target Multiples in an Array
- Minimum Moves to Get a Peaceful Board
- Minimum Moves to Move a Box to Their Target Location
- Minimum Number of Coins for Fruits II
- Minimum Number of Coins for Fruits
- Minimum Number of Flips to Make Binary Grid Palindromic I
- Minimum Number of Increasing Subsequence to Be Removed
- Minimum Number of Operations to Make All Array Elements Equal to 1
- Minimum Number of Operations to Satisfy Conditions
- Minimum Number of Seconds to Make Mountain Height Zero
- Minimum Number of Valid Strings to Form Target I
- Minimum Number of Valid Strings to Form Target II
- Minimum Number of Work Sessions to Finish the Tasks
- Minimum Operations to Make a Special Number
- Minimum Operations to Make Array Elements Zero
- Minimum Operations to Make Array Equal
- Minimum Operations to Make Array Values Equal to K
- Minimum Operations to Make Character Frequencies Equal
- Minimum Operations to Make Columns Strictly Increasing
- Minimum Operations to Make Elements Within K Subarrays Equal
- Minimum Operations to Make Subarray Elements Equal
- Minimum Operations to Make the Integer Zero
- Minimum Operations to Maximize Last Elements in Arrays
- Minimum Pair Removal to Sort Array I
- Minimum Pair Removal to Sort Array II
- Minimum Positive Sum Subarray
- Minimum Possible Integer After at Most K Adjacent Swaps On Digits
- Minimum Relative Loss After Buying Chocolates
- Minimum Runes to Add to Cast Spell
- Minimum Score by Changing Two Elements
- Minimum Split Into Subarrays With GCD Greater Than One
- Minimum Subarrays in a Valid Split
- Minimum Swaps to Arrange a Binary Grid
- Minimum Time For K Virus Variants to Spread
- Minimum Time to Break Locks I
- Minimum Time to Break Locks II
- Minimum Time to Complete All Tasks
- Minimum Time to Visit Disappearing Nodes
- Minimum Total Operations
- Minimum Unlocked Indices to Sort Nums
- Mirror Reflection
- Modify Columns
- Most Frequent Even Element
- Naming a Company
- Neither Minimum nor Maximum
- Nested Array Generator
- Next Day
- Next Greater Element IV
- Number of Beautiful Pairs
- Number of Burgers with No Waste of Ingredients
- Number of Common Factors
- Number of Different Integers in a String
- Number of Excellent Pairs
- Number of Pairs of Interchangeable Rectangles
- Number of Single Divisor Triplets
- Number of Students Doing Homework at a Given Time
- Number of Subarrays Having Even Product
- Number of Subarrays With GCD Equal to K
- Number of Subarrays With LCM Equal to K
- Number of Subsequences with Odd Sum
- Number of Ways to Paint N × 3 Grid
- Number of Ways to Reach a Position After Exactly k Steps
- Number of Ways Where Square of Number Is Equal to Product of Two Numbers
- Palindrome Partitioning III
- Palindrome Rearrangement Queries
- Parallel Execution of Promises for Individual Results Retrieval
- Partial Function with Placeholders
- Partition String Into Minimum Beautiful Substrings
- Permutations III
- Permutations IV
- Phone Number Prefix
- Power of Heroes
- Powerful Integers
- Prime In Diagonal
- Prime Pairs With Target Sum
- Print Immutable Linked List in Reverse
- Probability of a Two Boxes Having The Same Number of Distinct Balls
- Promise Time Limit
- Properties Graph
- Query Batching
- Rearrange K Substrings to Form Target String
- Rectangle Area II
- Remove Methods From Project
- Remove Trailing Zeros From a String
- Rename Columns
- Repeat String
- Reschedule Meetings for Maximum Free Time I
- Reschedule Meetings for Maximum Free Time II
- Reshape Data: Concatenate
- Reshape Data: Melt
- Restore The Array
- Reverse Degree of a String
- Reverse Subarray To Maximize Array Value
- Select Cells in Grid With Maximum Score
- Select Data
- Self Crossing
- Semi-Ordered Permutation
- Separate Squares II
- Shift Distance Between Two Strings
- Short Encoding of Words
- Shortest Distance After Road Addition Queries II
- Shortest Matching Substring
- Slowest Key
- Smallest Divisible Digit Product I
- Smallest Divisible Digit Product II
- Smallest Missing Genetic Value in Each Subtree
- Smallest Number With All Set Bits
- Smallest Rotation with Highest Score
- Smallest String With A Given Numeric Value
- Smallest Substring With Identical Characters II
- Smallest Value After Replacing With Sum of Prime Factors
- Snail Traversal
- Snake in Matrix
- Sort Linked List Already Sorted Using Absolute Values
- Sort Matrix by Diagonals
- Sort Vowels in a String
- Sorted GCD Pair Queries
- Special Permutations
- Split a Circular Linked List
- Split Array Into Maximum Number of Subarrays
- Split Strings by Separator
- Splitting a String Into Descending Consecutive Values
- Status of Flight Tickets
- Stone Game V
- Stone Removal Game
- Strobogrammatic Number III
- Strong Password Checker II
- Subarrays Distinct Element Sum of Squares I
- Subsequences with a Unique Middle Mode I
- Subsequences with a Unique Middle Mode II
- Substring Matching Pattern
- Substrings That Begin and End With the Same Letter
- Sum of Consecutive Subarrays
- Sum of Consecutive Subsequences
- Sum of Digits in Base K
- Sum of Good Numbers
- Sum of K Subarrays With Length at Least M
- Sum of Numbers With Units Digit K
- Sum of Squares of Special Elements
- Sum of Variable Length Subarrays
- Super Pow
- Surface Area of 3D Shapes
- The Dining Philosophers
- The Maze III
- The Number of Ways to Make the Sum
- The Two Sneaky Numbers of Digitville
- The Wording Game
- Thousand Separator
- Three Consecutive Odds
- Time Taken to Mark All Nodes
- Total Characters in String After Transformations I
- Total Characters in String After Transformations II
- Traffic Light Controlled Intersection
- Transform Array by Parity
- Transformed Array
- Undefined to Null
- Unique 3-Digit Even Numbers
- Valid Permutations for DI Sequence
- Visit Array Positions to Maximize Score
- Vowels Game in a String
- Ways to Express an Integer as Sum of Powers
- Wiggle Subsequence
- Winner of the Linked List Game
- Zigzag Grid Traversal With Skip