Company: Amazon
- 01 Matrix
- 132 Pattern
- 3Sum Closest
- 3Sum
- 4Sum
- Accounts Merge
- Add Binary
- Add Digits
- Add Strings
- Add to Array-Form of Integer
- Add Two Integers
- Add Two Numbers II
- Add Two Numbers
- Add Two Polynomials Represented as Linked Lists
- Adding Spaces to a String
- Additive Number
- Adjacent Increasing Subarrays Detection I
- Advantage Shuffle
- Alien Dictionary
- All Ancestors of a Node in a Directed Acyclic Graph
- All Elements in Two Binary Search Trees
- All Nodes Distance K in Binary Tree
- All O`one Data Structure
- All Paths From Source to Target
- All Possible Full Binary Trees
- Allocate Mailboxes
- Allow One Function Call
- Amount of Time for Binary Tree to Be Infected
- Analyze User Website Visit Pattern
- Angle Between Hands of a Clock
- Append Characters to String to Make Subsequence
- Append K Integers With Minimal Sum
- Apply Discount to Prices
- Apply Operations to an Array
- Apply Operations to Make All Array Elements Equal to Zero
- Apply Transform Over Each Element in Array
- Arithmetic Slices II - Subsequence
- Arithmetic Slices
- Armstrong Number
- Arranging Coins
- Array Partition
- Array Prototype Last
- As Far from Land as Possible
- Assign Cookies
- Asteroid Collision
- Average Salary Excluding the Minimum and Maximum Salary
- Average Waiting Time
- Backspace String Compare
- Balance a Binary Search Tree
- Balanced Binary Tree
- Base 7
- Baseball Game
- Basic Calculator II
- Basic Calculator III
- Basic Calculator
- Battleships in a Board
- Beautiful Arrangement
- Beautiful Array
- Beautiful Towers II
- Best Meeting Point
- Best Poker Hand
- Best Time to Buy and Sell Stock II
- Best Time to Buy and Sell Stock III
- Best Time to Buy and Sell Stock IV
- Best Time to Buy and Sell Stock with Cooldown
- Best Time to Buy and Sell Stock with Transaction Fee
- Best Time to Buy and Sell Stock
- Binary Search Tree Iterator
- Binary Search Tree to Greater Sum Tree
- Binary Search
- Binary Subarrays With Sum
- Binary Tree Cameras
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal
- Binary Tree Maximum Path Sum
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Right Side View
- Binary Tree Vertical Order Traversal
- Binary Tree Zigzag Level Order Traversal
- Binary Trees With Factors
- Bitwise AND of Numbers Range
- Boats to Save People
- Boundary of Binary Tree
- Brick Wall
- Buddy Strings
- Build Array from Permutation
- Build Array Where You Can Find The Maximum Exactly K Comparisons
- Build Binary Expression Tree From Infix Expression
- Buildings With an Ocean View
- Bulb Switcher
- Bulls and Cows
- Burst Balloons
- Bus Routes
- Buy Two Chocolates
- Cache With Time Limit
- Calculate Money in Leetcode Bank
- Can I Win
- Can Make Arithmetic Progression From Sequence
- Can Place Flowers
- Candy
- Capacity To Ship Packages Within D Days
- Car Fleet
- Car Pooling
- Cat and Mouse
- Champagne Tower
- Cheapest Flights Within K Stops
- Check Completeness of a Binary Tree
- Check for Contradictions in Equations
- Check if a Parentheses String Can Be Valid
- Check If a Word Occurs As a Prefix of Any Word in a Sentence
- Check if Array Is Sorted and Rotated
- Check If Array Pairs Are Divisible by k
- Check If It Is a Good Array
- Check If It Is a Straight Line
- Check if Move is Legal
- Check If N and Its Double Exist
- Check if Number is a Sum of Powers of Three
- Check if Object Instance of Class
- Check if One String Swap Can Make Strings Equal
- Check if the Rectangle Corner Is Reachable
- Check if There is a Valid Partition For The Array
- Check If Two String Arrays are Equivalent
- Check If Word Is Valid After Substitutions
- Cherry Pickup II
- Cherry Pickup
- Circular Array Loop
- Climbing Stairs
- Clone Binary Tree With Random Pointer
- Clone Graph
- Clone N-ary Tree
- Closest Divisors
- Closest Leaf in a Binary Tree
- Closest Prime Numbers in Range
- Closest Room
- Clumsy Factorial
- Coin Change II
- Coin Change
- Collecting Chocolates
- Combination Sum II
- Combination Sum III
- Combination Sum IV
- Combination Sum
- Combinations
- Compare Version Numbers
- Complement of Base 10 Integer
- Complete Binary Tree Inserter
- Complex Number Multiplication
- Concatenated Words
- Concatenation of Array
- Concatenation of Consecutive Binary Numbers
- Connecting Cities With Minimum Cost
- Constrained Subsequence Sum
- Construct Binary Search Tree from Preorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Preorder and Postorder Traversal
- Construct Binary Tree from String
- Construct Quad Tree
- Construct Smallest Number From DI String
- Construct String from Binary Tree
- Construct the Lexicographically Largest Valid Sequence
- Container With Most Water
- Contains Duplicate II
- Contains Duplicate III
- Contains Duplicate
- Contiguous Array
- Continuous Subarray Sum
- Continuous Subarrays
- Convert 1D Array Into 2D Array
- Convert a Number to Hexadecimal
- Convert an Array Into a 2D Array With Conditions
- Convert Binary Number in a Linked List to Integer
- Convert BST to Greater Tree
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert the Temperature
- Copy List with Random Pointer
- Corporate Flight Bookings
- Count All Valid Pickup and Delivery Options
- Count Anagrams
- Count and Say
- Count Array Pairs Divisible by K
- Count Beautiful Substrings I
- Count Beautiful Substrings II
- Count Binary Substrings
- Count Complete Subarrays in an Array
- Count Complete Tree Nodes
- Count Elements With Maximum Frequency
- Count Good Numbers
- Count Items Matching a Rule
- Count Negative Numbers in a Sorted Matrix
- Count Nice Pairs in an Array
- Count Nodes With the Highest Score
- Count Number of Bad Pairs
- Count Number of Nice Subarrays
- Count Number of Pairs With Absolute Difference K
- Count Number of Rectangles Containing Each Point
- Count Number of Special Subsequences
- Count Number of Teams
- Count Number of Texts
- Count Numbers With Unique Digits II
- Count of Integers
- Count of Matches in Tournament
- Count of Range Sum
- Count of Smaller Numbers After Self
- Count Pairs Of Nodes
- Count Pairs Whose Sum is Less than Target
- Count Palindromic Subsequences
- Count Primes
- Count Servers that Communicate
- Count Square Submatrices with All Ones
- Count Stepping Numbers in Range
- Count Subarrays Where Max Element Appears at Least K Times
- Count Subarrays With Fixed Bounds
- Count Symmetric Integers
- Count the Hidden Sequences
- Count the Number of Complete Components
- Count the Number of Fair Pairs
- Count the Number of Good Subarrays
- Count the Number of Inversions
- Count the Number of K-Big Indices
- Count the Number of K-Free Subsets
- Count the Number of Special Characters I
- Count the Number of Special Characters II
- Count Total Number of Colored Cells
- Count Triplets That Can Form Two Arrays of Equal XOR
- Count Triplets with Even XOR Set Bits I
- Count Triplets with Even XOR Set Bits II
- Count Unique Characters of All Substrings of a Given String
- Count Univalue Subtrees
- Count Unreachable Pairs of Nodes in an Undirected Graph
- Count Visited Nodes in a Directed Graph
- Count Vowel Strings in Ranges
- Count Vowels Permutation
- Count Ways To Build Good Strings
- Count Ways to Make Array With Product
- Counter II
- Counter
- Counting Bits
- Course Schedule II
- Course Schedule III
- Course Schedule IV
- Course Schedule
- Cousins in Binary Tree II
- Cousins in Binary Tree
- Crawler Log Folder
- Create a DataFrame from List
- Create Binary Tree From Descriptions
- Create Hello World Function
- Create Maximum Number
- Create Target Array in the Given Order
- Critical Connections in a Network
- Custom Sort String
- Cut Off Trees for Golf Event
- Daily Temperatures
- Debounce
- Decode String
- Decode the Message
- Decode the Slanted Ciphertext
- Decode Ways
- Decode XORed Permutation
- Decoded String at Index
- Decompress Run-Length Encoded List
- Deepest Leaves Sum
- Defanging an IP Address
- Defuse the Bomb
- Delete and Earn
- Delete Leaves With a Given Value
- Delete Node in a BST
- Delete Node in a Linked List
- Delete Nodes And Return Forest
- Delete Nodes From Linked List Present in Array
- Delete the Middle Node of a Linked List
- Design a Food Rating System
- Design A Leaderboard
- Design a Stack With Increment Operation
- Design a Text Editor
- Design Add and Search Words Data Structure
- Design an Expression Tree With Evaluate Function
- Design Browser History
- Design Circular Queue
- Design File System
- Design Front Middle Back Queue
- Design HashMap
- Design HashSet
- Design Hit Counter
- Design In-Memory File System
- Design Linked List
- Design Log Storage System
- Design Memory Allocator
- Design Parking System
- Design Search Autocomplete System
- Design Snake Game
- Design SQL
- Design Tic-Tac-Toe
- Design Twitter
- Design Underground System
- Destination City
- Detect Squares
- Determine if String Halves Are Alike
- Determine if Two Strings Are Close
- Determine the Winner of a Bowling Game
- Determine Whether Matrix Can Be Obtained By Rotation
- Detonate the Maximum Bombs
- Diagonal Traverse
- Diameter of Binary Tree
- Diet Plan Performance
- Difference Between Element Sum and Digit Sum of an Array
- Difference Between Ones and Zeros in Row and Column
- Different Ways to Add Parentheses
- Digit Count in Range
- Dinner Plate Stacks
- Display the First Three Rows
- Distant Barcodes
- Distinct Numbers in Each Subarray
- Distinct Subsequences
- Distribute Candies Among Children I
- Distribute Candies Among Children II
- Distribute Candies Among Children III
- Distribute Candies to People
- Distribute Coins in Binary Tree
- Distribute Money to Maximum Children
- Distribute Repeating Integers
- Divide Nodes Into the Maximum Number of Groups
- Divide Players Into Teams of Equal Skill
- Divide Two Integers
- Domino and Tromino Tiling
- Dot Product of Two Sparse Vectors
- Dota2 Senate
- Double a Number Represented as a Linked List
- Dungeon Game
- Duplicate Zeros
- Edit Distance
- Egg Drop With 2 Eggs and N Floors
- Element Appearing More Than 25% In Sorted Array
- Elimination Game
- Employee Importance
- Encode and Decode Strings
- Encode and Decode TinyURL
- Equal Row and Column Pairs
- Equal Tree Partition
- Erect the Fence
- Escape a Large Maze
- Evaluate Boolean Binary Tree
- Evaluate Division
- Evaluate Reverse Polish Notation
- Even Odd Tree
- Excel Sheet Column Number
- Excel Sheet Column Title
- Exclusive Time of Functions
- Extra Characters in a String
- Fair Candy Swap
- Fair Distribution of Cookies
- Fibonacci Number
- Filling Bookcase Shelves
- Final Value of Variable After Performing Operations
- Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- Find a Peak Element II
- Find All Anagrams in a String
- Find All Duplicates in an Array
- Find All Numbers Disappeared in an Array
- Find All People With Secret
- Find All Possible Recipes from Given Supplies
- Find and Replace Pattern
- Find Building Where Alice and Bob Can Meet
- Find Center of Star Graph
- Find Closest Number to Zero
- Find Common Characters
- Find Common Elements Between Two Arrays
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
- Find Distance in a Binary Tree
- Find Duplicate Subtrees
- Find Elements in a Contaminated Binary Tree
- Find Eventual Safe States
- Find First and Last Position of Element in Sorted Array
- Find First Palindromic String in the Array
- Find Good Days to Rob the Bank
- Find if Path Exists in Graph
- Find in Mountain Array
- Find K Closest Elements
- Find K-Length Substrings With No Repeated Characters
- Find K Pairs with Smallest Sums
- Find K-th Smallest Pair Distance
- Find Kth Bit in Nth Binary String
- Find Largest Value in Each Tree Row
- Find Leaves of Binary Tree
- Find Longest Self-Contained Substring
- Find Maximum Non-decreasing Array Length
- Find Median from Data Stream
- Find Minimum in Rotated Sorted Array II
- Find Minimum in Rotated Sorted Array
- Find Minimum Time to Finish All Jobs II
- Find Minimum Time to Finish All Jobs
- Find Missing and Repeated Values
- Find Missing Observations
- Find Mode in Binary Search Tree
- Find N Unique Integers Sum up to Zero
- Find Nearest Point That Has the Same X or Y Coordinate
- Find Number of Coins to Place in Tree Nodes
- Find Number of Ways to Reach the K-th Stair
- Find Occurrences of an Element in an Array
- Find Peak Element
- Find Pivot Index
- Find Players With Zero or One Losses
- Find Right Interval
- Find Score of an Array After Marking All Elements
- Find Servers That Handled Most Number of Requests
- Find Smallest Letter Greater Than Target
- Find the Celebrity
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
- Find the Closest Palindrome
- Find the Difference of Two Arrays
- Find the Difference
- Find the Divisibility Array of a String
- Find the Duplicate Number
- Find the Highest Altitude
- Find the Index of the First Occurrence in a String
- Find the Index of the Large Integer
- Find the K-or of an Array
- Find the K-Sum of an Array
- Find The K-th Lucky Number
- Find the Kth Smallest Sum of a Matrix With Sorted Rows
- Find the Longest Substring Containing Vowels in Even Counts
- Find the Maximum Achievable Number
- Find the Maximum Divisibility Score
- Find the Maximum Number of Elements in Subset
- Find the Median of the Uniqueness Array
- Find the Minimum and Maximum Number of Nodes Between Critical Points
- Find the Number of Good Pairs II
- Find the Number of Possible Ways for an Event
- Find the Number of Subarrays Where Boundary Elements Are Maximum
- Find The Original Array of Prefix Xor
- Find the Pivot Integer
- Find the Prefix Common Array of Two Arrays
- Find the Punishment Number of an Integer
- Find the Safest Path in a Grid
- Find the Smallest Divisor Given a Threshold
- Find the Substring With Maximum Cost
- Find the Town Judge
- Find the Winner of the Circular Game
- Find Triangular Sum of an Array
- Find Winner on a Tic Tac Toe Game
- Find Words Containing Character
- Find Words That Can Be Formed by Characters
- Find Xor-Beauty of Array
- Finding 3-Digit Even Numbers
- First Bad Version
- First Letter to Appear Twice
- First Missing Positive
- First Unique Character in a String
- First Unique Number
- Fizz Buzz
- Flatten a Multilevel Doubly Linked List
- Flatten Binary Tree to Linked List
- Flatten Nested List Iterator
- Flip Columns For Maximum Number of Equal Rows
- Flip Equivalent Binary Trees
- Flip String to Monotone Increasing
- Flipping an Image
- Flood Fill
- Form Array by Concatenating Subarrays of Another Array
- Fraction Addition and Subtraction
- Frequency of the Most Frequent Element
- Frog Jump
- Fruit Into Baskets
- Function Composition
- Furthest Building You Can Reach
- Furthest Point From Origin
- Game of Life
- Gas Station
- GCD Sort of an Array
- Generate Binary Strings Without Adjacent Zeros
- Generate Fibonacci Sequence
- Generate Parentheses
- Get Maximum in Generated Array
- Get Watched Videos by Your Friends
- Global and Local Inversions
- Graph Valid Tree
- Gray Code
- Greatest Common Divisor of Strings
- Group Anagrams
- Group the People Given the Group Size They Belong To
- Grumpy Bookstore Owner
- Guess Number Higher or Lower
- Guess the Word
- H-Index II
- H-Index
- Hamming Distance
- Hand of Straights
- Handshakes That Don't Cross
- Happy Number
- Heaters
- High-Access Employees
- High Five
- House Robber II
- House Robber III
- House Robber IV
- House Robber
- HTML Entity Parser
- Identify the Largest Outlier in an Array
- Image Smoother
- Implement Queue using Stacks
- Implement Stack using Queues
- Implement Trie (Prefix Tree)
- Increasing Order Search Tree
- Increasing Triplet Subsequence
- Index Pairs of a String
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Insert Interval
- Insert into a Binary Search Tree
- Insert into a Sorted Circular Linked List
- Insufficient Nodes in Root to Leaf Paths
- Integer Break
- Integer to English Words
- Integer to Roman
- Interleaving String
- Intersection of Multiple Arrays
- Intersection of Two Arrays II
- Intersection of Two Arrays
- Intersection of Two Linked Lists
- Interval List Intersections
- Invalid Transactions
- Invert Binary Tree
- IPO
- Is Graph Bipartite?
- Is Subsequence
- Island Perimeter
- Isomorphic Strings
- Jewels and Stones
- Jump Game II
- Jump Game IV
- Jump Game VI
- Jump Game VIII
- Jump Game
- K Closest Points to Origin
- K-diff Pairs in an Array
- K Divisible Elements Subarrays
- K Inverse Pairs Array
- K Radius Subarray Averages
- K-th Smallest Prime Fraction
- K-th Symbol in Grammar
- Keep Multiplying Found Values by Two
- Keyboard Row
- Keys and Rooms
- Kids With the Greatest Number of Candies
- Kill Process
- Knight Dialer
- Knight Probability in Chessboard
- Koko Eating Bananas
- Kth Ancestor of a Tree Node
- Kth Distinct String in an Array
- Kth Largest Element in a Stream
- Kth Largest Element in an Array
- Kth Largest Sum in a Binary Tree
- Kth Missing Positive Number
- Kth Smallest Element in a BST
- Kth Smallest Element in a Sorted Matrix
- Largest Combination With Bitwise AND Greater Than Zero
- Largest Divisible Subset
- Largest Element in an Array after Merge Operations
- Largest Local Values in a Matrix
- Largest Multiple of Three
- Largest Number
- Largest Odd Number in String
- Largest Palindromic Number
- Largest Perimeter Triangle
- Largest Positive Integer That Exists With Its Negative
- Largest Rectangle in Histogram
- Largest Submatrix With Rearrangements
- Largest Triangle Area
- Largest Unique Number
- Last Stone Weight II
- Last Stone Weight
- Last Substring in Lexicographical Order
- Leaf-Similar Trees
- Least Number of Unique Integers after K Removals
- Lemonade Change
- Length of Last Word
- Length of Longest Fibonacci Subsequence
- Length of the Longest Alphabetical Continuous Substring
- Length of the Longest Subsequence That Sums to Target
- Length of the Longest Valid Substring
- Letter Case Permutation
- Letter Combinations of a Phone Number
- Letter Tile Possibilities
- Lexicographical Numbers
- Lexicographically Smallest Beautiful String
- Lexicographically Smallest Palindrome
- Lexicographically Smallest String After Applying Operations
- LFU Cache
- Linked List Components
- Linked List Cycle II
- Linked List Cycle
- Logger Rate Limiter
- Longest Absolute File Path
- Longest Arithmetic Subsequence of Given Difference
- Longest Arithmetic Subsequence
- Longest Common Prefix
- Longest Common Subpath
- Longest Common Subsequence
- Longest Consecutive Sequence
- Longest Continuous Increasing Subsequence
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
- Longest Cycle in a Graph
- Longest Duplicate Substring
- Longest Happy Prefix
- Longest Happy String
- Longest Ideal Subsequence
- Longest Increasing Path in a Matrix
- Longest Increasing Subsequence
- Longest Mountain in Array
- Longest Palindrome
- Longest Palindromic Subsequence
- Longest Palindromic Substring
- Longest Path With Different Adjacent Characters
- Longest Repeating Character Replacement
- Longest Repeating Substring
- Longest Square Streak in an Array
- Longest Strictly Increasing or Strictly Decreasing Subarray
- Longest String Chain
- Longest Subarray of 1's After Deleting One Element
- Longest Subarray With Maximum Bitwise AND
- Longest Substring with At Least K Repeating Characters
- Longest Substring with At Most K Distinct Characters
- Longest Substring Without Repeating Characters
- Longest Univalue Path
- Longest Valid Parentheses
- Longest Word in Dictionary
- Longest ZigZag Path in a Binary Tree
- Loud and Rich
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree III
- Lowest Common Ancestor of a Binary Tree IV
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of Deepest Leaves
- LRU Cache
- Magic Squares In Grid
- Magnetic Force Between Two Balls
- Majority Element II
- Majority Element
- Make Array Zero by Subtracting Equal Amounts
- Make K-Subarray Sums Equal
- Make Lexicographically Smallest Array by Swapping Elements
- Make String a Subsequence Using Cyclic Increments
- Make Sum Divisible by P
- Make Three Strings Equal
- Making A Large Island
- Map of Highest Peak
- Map Sum Pairs
- Matrix Diagonal Sum
- Max Area of Island
- Max Chunks To Make Sorted II
- Max Chunks To Make Sorted
- Max Consecutive Ones III
- Max Consecutive Ones
- Max Number of K-Sum Pairs
- Max Points on a Line
- Max Stack
- Max Sum of a Pair With Equal Sum of Digits
- Maximal Range That Each Element Is Maximum in It
- Maximal Rectangle
- Maximal Score After Applying K Operations
- Maximal Square
- Maximize Distance to Closest Person
- Maximize Happiness of Selected Children
- Maximize Number of Subsequences in a String
- Maximize the Beauty of the Garden
- Maximize the Confusion of an Exam
- Maximize the Profit as the Salesman
- Maximum Absolute Sum of Any Subarray
- Maximum Alternating Subarray Sum
- Maximum Ascending Subarray Sum
- Maximum Average Pass Ratio
- Maximum Average Subarray I
- Maximum Average Subtree
- Maximum Bags With Full Capacity of Rocks
- Maximum Balanced Subsequence Sum
- Maximum Candies Allocated to K Children
- Maximum Coins From K Consecutive Bags
- Maximum Consecutive Floors Without Special Floors
- Maximum Count of Positive Integer and Negative Integer
- Maximum Depth of Binary Tree
- Maximum Difference Between Node and Ancestor
- Maximum Element After Decreasing and Rearranging
- Maximum Erasure Value
- Maximum Frequency Stack
- Maximum Good Subarray Sum
- Maximum Ice Cream Bars
- Maximum Length of a Concatenated String with Unique Characters
- Maximum Length of Pair Chain
- Maximum Length of Repeated Subarray
- Maximum Length of Subarray With Positive Product
- Maximum Level Sum of a Binary Tree
- Maximum Linear Stock Score
- Maximum Matching of Players With Trainers
- Maximum Matrix Sum
- Maximum Nesting Depth of the Parentheses
- Maximum Non Negative Product in a Matrix
- Maximum Number of Achievable Transfer Requests
- Maximum Number of Alloys
- Maximum Number of Balloons
- Maximum Number of Books You Can Take
- Maximum Number of Coins You Can Get
- Maximum Number of Events That Can Be Attended II
- Maximum Number of Events That Can Be Attended
- Maximum Number of Fish in a Grid
- Maximum Number of Groups With Increasing Length
- Maximum Number of Moves in a Grid
- Maximum Number of Non-Overlapping Substrings
- Maximum Number of Points with Cost
- Maximum Number of Removable Characters
- Maximum Number of Robots Within Budget
- Maximum Number of Vowels in a Substring of Given Length
- Maximum Odd Binary Number
- Maximum of Minimum Values in All Subarrays
- Maximum Performance of a Team
- Maximum Points You Can Obtain from Cards
- Maximum Product Difference Between Two Pairs
- Maximum Product of Splitted Binary Tree
- Maximum Product of Three Numbers
- Maximum Product of Two Elements in an Array
- Maximum Product of Word Lengths
- Maximum Product Subarray
- Maximum Profit in Job Scheduling
- Maximum Running Time of N Computers
- Maximum Score After Splitting a String
- Maximum Score of a Good Subarray
- Maximum Score Words Formed by Letters
- Maximum Star Sum of a Graph
- Maximum Strictly Increasing Cells in a Matrix
- Maximum Strong Pair XOR I
- Maximum Subarray Min-Product
- Maximum Subarray Sum with One Deletion
- Maximum Subarray
- Maximum Subsequence Score
- Maximum Sum BST in Binary Tree
- Maximum Sum Circular Subarray
- Maximum Sum of 3 Non-Overlapping Subarrays
- Maximum Sum of Almost Unique Subarray
- Maximum Sum of Distinct Subarrays With Length K
- Maximum Sum of Two Non-Overlapping Subarrays
- Maximum Sum Score of Array
- Maximum Swap
- Maximum Tastiness of Candy Basket
- Maximum Total Importance of Roads
- Maximum Twin Sum of a Linked List
- Maximum Units on a Truck
- Maximum Value at a Given Index in a Bounded Array
- Maximum Width of Binary Tree
- Maximum Width Ramp
- Maximum XOR of Two Numbers in an Array
- Median of Two Sorted Arrays
- Meeting Rooms II
- Meeting Rooms III
- Meeting Rooms
- Meeting Scheduler
- Merge Intervals
- Merge k Sorted Lists
- Merge Nodes in Between Zeros
- Merge Operations to Turn Array Into a Palindrome
- Merge Sorted Array
- Merge Strings Alternately
- Merge Two Binary Trees
- Merge Two Sorted Lists
- Middle of the Linked List
- Min Cost Climbing Stairs
- Min Cost to Connect All Points
- Min Stack
- Minesweeper
- Mini Parser
- Minimize Manhattan Distances
- Minimize Maximum Pair Sum in Array
- Minimize the Difference Between Target and Chosen Elements
- Minimize the Maximum Difference of Pairs
- Minimize XOR
- Minimized Maximum of Products Distributed to Any Store
- Minimum Absolute Difference in BST
- Minimum Absolute Difference
- Minimum Add to Make Parentheses Valid
- Minimum Additions to Make Valid String
- Minimum Adjacent Swaps to Make a Valid Array
- Minimum Amount of Time to Collect Garbage
- Minimum Array Sum
- Minimum ASCII Delete Sum for Two Strings
- Minimum Average Difference
- Minimum Average of Smallest and Largest Elements
- Minimum Common Value
- Minimum Cost For Tickets
- Minimum Cost to Connect Sticks
- Minimum Cost to Cut a Stick
- Minimum Cost to Equalize Array
- Minimum Cost to Hire K Workers
- Minimum Cost to Make Array Equal
- Minimum Cost to Merge Stones
- Minimum Degree of a Connected Trio in a Graph
- Minimum Deletions to Make Character Frequencies Unique
- Minimum Depth of Binary Tree
- Minimum Difference Between Highest and Lowest of K Scores
- Minimum Difference Between Largest and Smallest Value in Three Moves
- Minimum Difference in Sums After Removal of Elements
- Minimum Difficulty of a Job Schedule
- Minimum Falling Path Sum II
- Minimum Falling Path Sum
- Minimum Fuel Cost to Report to the Capital
- Minimum Garden Perimeter to Collect Enough Apples
- Minimum Genetic Mutation
- Minimum Health to Beat Game
- Minimum Height Trees
- Minimum Impossible OR
- Minimum Increment to Make Array Unique
- Minimum Insertion Steps to Make a String Palindrome
- Minimum Insertions to Balance a Parentheses String
- Minimum Interval to Include Each Query
- Minimum Jumps to Reach Home
- Minimum Knight Moves
- Minimum Length of String After Deleting Similar Ends
- Minimum Limit of Balls in a Bag
- Minimum Money Required Before Transactions
- Minimum Moves to Equal Array Elements
- Minimum Moves to Reach Target Score
- Minimum Non-Zero Product of the Array Elements
- Minimum Number Game
- Minimum Number of Arrows to Burst Balloons
- Minimum Number of Days to Disconnect Island
- Minimum Number of Days to Eat N Oranges
- Minimum Number of Days to Make m Bouquets
- Minimum Number of K Consecutive Bit Flips
- Minimum Number of Keypresses
- Minimum Number of Moves to Make Palindrome
- Minimum Number of Moves to Seat Everyone
- Minimum Number of Operations to Make Array Empty
- Minimum Number of Operations to Make Array XOR Equal to K
- Minimum Number of Operations to Make Arrays Similar
- Minimum Number of Operations to Move All Balls to Each Box
- Minimum Number of Operations to Sort a Binary Tree by Level
- Minimum Number of Pushes to Type Word I
- Minimum Number of Pushes to Type Word II
- Minimum Number of Refueling Stops
- Minimum Number of Removals to Make Mountain Array
- Minimum Number of Steps to Make Two Strings Anagram
- Minimum Number of Swaps to Make the String Balanced
- Minimum Number of Taps to Open to Water a Garden
- Minimum Numbers of Function Calls to Make Target Array
- Minimum Obstacle Removal to Reach Corner
- Minimum Operations to Form Subsequence With Target Sum
- Minimum Operations to Make a Subsequence
- Minimum Operations to Make All Array Elements Equal
- Minimum Operations to Make Array Equal to Target
- Minimum Operations to Make Binary Array Elements Equal to One I
- Minimum Operations to Make the Array Alternating
- Minimum Operations to Make the Array Increasing
- Minimum Operations to Make the Array K-Increasing
- Minimum Operations to Reduce X to Zero
- Minimum Operations to Remove Adjacent Ones in Matrix
- Minimum Path Sum
- Minimum Penalty for a Shop
- Minimum Remove to Make Valid Parentheses
- Minimum Replacements to Sort the Array
- Minimum Reverse Operations
- Minimum Right Shifts to Sort the Array
- Minimum Rounds to Complete All Tasks
- Minimum Score After Removals on a Tree
- Minimum Score of a Path Between Two Cities
- Minimum Score Triangulation of Polygon
- Minimum Seconds to Equalize a Circular Array
- Minimum Sideway Jumps
- Minimum Size Subarray Sum
- Minimum Space Wasted From Packaging
- Minimum Speed to Arrive on Time
- Minimum String Length After Removing Substrings
- Minimum Subsequence in Non-Increasing Order
- Minimum Substring Partition of Equal Character Frequency
- Minimum Suffix Flips
- Minimum Sum of Four Digit Number After Splitting Digits
- Minimum Sum of Squared Difference
- Minimum Swaps to Group All 1's Together II
- Minimum Swaps To Make Sequences Increasing
- Minimum Time Difference
- Minimum Time to Collect All Apples in a Tree
- Minimum Time to Make Rope Colorful
- Minimum Time to Repair Cars
- Minimum Value to Get Positive Step by Step Sum
- Minimum Window Substring
- Missing Element in Sorted Array
- Missing Number
- Monotone Increasing Digits
- Monotonic Array
- Most Beautiful Item for Each Query
- Most Common Word
- Most Expensive Item That Can Not Be Bought
- Most Frequent IDs
- Most Frequent Subtree Sum
- Most Profit Assigning Work
- Most Profitable Path in a Tree
- Most Stones Removed with Same Row or Column
- Move Pieces to Obtain a String
- Move Zeroes
- Moving Average from Data Stream
- Multiply Strings
- My Calendar I
- My Calendar II
- N-ary Tree Postorder Traversal
- N-Queens
- N-th Tribonacci Number
- Nearest Exit from Entrance in Maze
- Neighboring Bitwise XOR
- Nested List Weight Sum
- Network Delay Time
- New 21 Game
- Next Greater Element I
- Next Greater Element II
- Next Greater Element III
- Next Greater Node In Linked List
- Next Palindrome Using Same Digits
- Next Permutation
- Non-decreasing Subsequences
- Non-overlapping Intervals
- Number of 1 Bits
- Number of Closed Islands
- Number of Connected Components in an Undirected Graph
- Number of Days Between Two Dates
- Number of Days in a Month
- Number of Dice Rolls With Target Sum
- Number of Digit One
- Number of Distinct Averages
- Number of Distinct Islands II
- Number of Distinct Islands
- Number of Employees Who Met the Target
- Number of Enclaves
- Number of Equivalent Domino Pairs
- Number of Flowers in Full Bloom
- Number of Good Pairs
- Number of Increasing Paths in a Grid
- Number of Islands
- Number of Laser Beams in a Bank
- Number of Music Playlists
- Number of Operations to Make Network Connected
- Number of Paths with Max Score
- Number of Provinces
- Number of Recent Calls
- Number of Sets of K Non-Overlapping Line Segments
- Number of Smooth Descent Periods of a Stock
- Number of Steps to Reduce a Number in Binary Representation to One
- Number of Students Unable to Eat Lunch
- Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
- Number of Submatrices That Sum to Target
- Number of Subsequences That Satisfy the Given Sum Condition
- Number of Substrings Containing All Three Characters
- Number of Unequal Triplets in Array
- Number of Unique Categories
- Number of Valid Subarrays
- Number of Visible People in a Queue
- Number of Ways to Arrive at Destination
- Number of Ways to Form a Target String Given a Dictionary
- Number of Ways to Reorder Array to Get Same BST
- Number of Ways to Select Buildings
- Number of Ways to Split Array
- Number of Ways to Stay in the Same Place After Some Steps
- Number of Wonderful Substrings
- Numbers At Most N Given Digit Set
- Odd Even Linked List
- One Edit Distance
- Online Stock Span
- Open the Lock
- Optimal Division
- Optimal Partition of String
- Orderly Queue
- Out of Boundary Paths
- Pacific Atlantic Water Flow
- Painting the Walls
- Pairs of Songs With Total Durations Divisible by 60
- Palindrome Linked List
- Palindrome Number
- Palindrome Pairs
- Palindrome Partitioning II
- Palindrome Partitioning
- Palindromic Substrings
- Pancake Sorting
- Parallel Courses III
- Parsing A Boolean Expression
- Partition Array According to Given Pivot
- Partition Array for Maximum Sum
- Partition Array Into Two Arrays to Minimize Sum Difference
- Partition Array Such That Maximum Difference Is K
- Partition Equal Subset Sum
- Partition Labels
- Partition List
- Partition to K Equal Sum Subsets
- Partitioning Into Minimum Number Of Deci-Binary Numbers
- Pascal's Triangle II
- Pascal's Triangle
- Patching Array
- Path Crossing
- Path Sum II
- Path Sum III
- Path Sum
- Path with Maximum Gold
- Path With Maximum Minimum Value
- Path with Maximum Probability
- Path With Minimum Effort
- Peak Index in a Mountain Array
- Perfect Number
- Perfect Squares
- Permutation in String
- Permutation Sequence
- Permutations II
- Permutations
- Plates Between Candles
- Plus One
- Poor Pigs
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node
- Possible Bipartition
- Power of Four
- Power of Three
- Power of Two
- Pow(x, n)
- Predict the Winner
- Prime Arrangements
- Prime Number of Set Bits in Binary Representation
- Prime Palindrome
- Print Binary Tree
- Print Words Vertically
- Prison Cells After N Days
- Process Tasks Using Servers
- Product of Array Except Self
- Product of the Last K Numbers
- Profitable Schemes
- Pseudo-Palindromic Paths in a Binary Tree
- Put Marbles in Bags
- Queries on a Permutation With Key
- Rabbits in Forest
- Race Car
- Random Pick Index
- Random Pick with Blacklist
- Random Pick with Weight
- Range Module
- Range Sum of BST
- Range Sum of Sorted Subarray Sums
- Range Sum Query 2D - Immutable
- Range Sum Query - Immutable
- Rank Transform of an Array
- Ransom Note
- Reach a Number
- Reaching Points
- Read N Characters Given Read4
- Rearrange Array Elements by Sign
- Rearrange Array to Maximize Prefix Score
- Rearrange Characters to Make Target String
- Rearrange String k Distance Apart
- Reconstruct Itinerary
- Recover a Tree From Preorder Traversal
- Recover Binary Search Tree
- Rectangle Overlap
- Redistribute Characters to Make All Strings Equal
- Redundant Connection
- Regions Cut By Slashes
- Regular Expression Matching
- Relative Ranks
- Relative Sort Array
- Relocate Marbles
- Remove All Adjacent Duplicates in String II
- Remove All Adjacent Duplicates In String
- Remove All Occurrences of a Substring
- Remove Colored Pieces if Both Neighbors are the Same Color
- Remove Covered Intervals
- Remove Digit From Number to Maximize Result
- Remove Duplicate Letters
- Remove Duplicates from Sorted Array II
- Remove Duplicates from Sorted Array
- Remove Duplicates from Sorted List II
- Remove Duplicates from Sorted List
- Remove Element
- Remove K Digits
- Remove Linked List Elements
- Remove Nodes From Linked List
- Remove Nth Node From End of List
- Remove One Element to Make the Array Strictly Increasing
- Remove Outermost Parentheses
- Remove Palindromic Subsequences
- Remove Sub-Folders from the Filesystem
- Remove Vowels from a String
- Remove Zero Sum Consecutive Nodes from Linked List
- Removing Minimum and Maximum From Array
- Removing Stars From a String
- Reorder Data in Log Files
- Reorder List
- Reorder Routes to Make All Paths Lead to the City Zero
- Reordered Power of 2
- Reorganize String
- Repeated DNA Sequences
- Repeated String Match
- Repeated Substring Pattern
- Replace Elements in an Array
- Replace Elements with Greatest Element on Right Side
- Replace Non-Coprime Numbers in Array
- Replace Question Marks in String to Minimize Its Value
- Replace the Substring for Balanced String
- Reshape Data: Pivot
- Restore IP Addresses
- Return Length of Arguments Passed
- Reveal Cards In Increasing Order
- Reverse Bits
- Reverse Integer
- Reverse Linked List II
- Reverse Linked List
- Reverse Nodes in k-Group
- Reverse Only Letters
- Reverse Pairs
- Reverse String
- Reverse Substrings Between Each Pair of Parentheses
- Reverse Vowels of a String
- Reverse Words in a String II
- Reverse Words in a String III
- Reverse Words in a String
- Reward Top K Students
- Richest Customer Wealth
- Robot Bounded In Circle
- Robot Room Cleaner
- Roman to Integer
- Root Equals Sum of Children
- Rotate Array
- Rotate Function
- Rotate Image
- Rotate List
- Rotate String
- Rotting Oranges
- Row With Maximum Ones
- Running Sum of 1d Array
- Russian Doll Envelopes
- Same Tree
- Score of a String
- Score of Parentheses
- Scramble String
- Search a 2D Matrix II
- Search a 2D Matrix
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array
- Search Insert Position
- Search Suggestions System
- Select K Disjoint Special Substrings
- Sentence Similarity II
- Separate Black and White Balls
- Sequential Digits
- Sequentially Ordinal Rank Tracker
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize BST
- Serialize and Deserialize N-ary Tree
- Set Matrix Zeroes
- Set Mismatch
- Shift 2D Grid
- Shopping Offers
- Shortest and Lexicographically Smallest Beautiful String
- Shortest Bridge
- Shortest Common Supersequence
- Shortest Distance from All Buildings
- Shortest Palindrome
- Shortest Path in a Grid with Obstacles Elimination
- Shortest Path in Binary Matrix
- Shortest Path to Get Food
- Shortest Path Visiting All Nodes
- Shortest Path with Alternating Colors
- Shortest Subarray to be Removed to Make Array Sorted
- Shortest Subarray with Sum at Least K
- Shortest Unsorted Continuous Subarray
- Shortest Word Distance II
- Shuffle String
- Shuffle the Array
- Simplify Path
- Single Element in a Sorted Array
- Single Number II
- Single Number III
- Single Number
- Single-Threaded CPU
- Sliding Subarray Beauty
- Sliding Window Maximum
- Sliding Window Median
- Smallest Number in Infinite Set
- Smallest Range Covering Elements from K Lists
- Smallest Range II
- Smallest Subarrays With Maximum Bitwise OR
- Smallest Subsequence of Distinct Characters
- Smallest Sufficient Team
- Snakes and Ladders
- Snapshot Array
- Solve the Equation
- Solving Questions With Brainpower
- Sort an Array
- Sort Array by Increasing Frequency
- Sort Array By Parity II
- Sort Array By Parity
- Sort Characters By Frequency
- Sort Colors
- Sort Features by Popularity
- Sort List
- Sort the Jumbled Numbers
- Sort the Matrix Diagonally
- Sorting the Sentence
- Soup Servings
- Special Array II
- Special Array With X Elements Greater Than or Equal X
- Spiral Matrix II
- Spiral Matrix III
- Spiral Matrix
- Split a String in Balanced Strings
- Split a String Into the Max Number of Unique Substrings
- Split Array into Consecutive Subsequences
- Split Array into Fibonacci Sequence
- Split Array Largest Sum
- Split BST
- Split Linked List in Parts
- Split With Minimum Sum
- Sqrt(x)
- Squares of a Sorted Array
- Step-By-Step Directions From a Binary Tree Node to Another
- Steps to Make Array Non-decreasing
- Stickers to Spell Word
- Stock Price Fluctuation
- Stone Game II
- Stone Game
- Strange Printer
- Strictly Palindromic Number
- String Compression II
- String Compression III
- String Compression
- String Matching in an Array
- String to Integer (atoi)
- Subarray Product Less Than K
- Subarray Sum Equals K
- Subarray Sums Divisible by K
- Subarray With Elements Greater Than Varying Threshold
- Subarrays Distinct Element Sum of Squares II
- Subarrays with K Different Integers
- Subsets II
- Subsets
- Substring with Concatenation of All Words
- Substring With Largest Variance
- Subtree of Another Tree
- Successful Pairs of Spells and Potions
- Sudoku Solver
- Sum of All Odd Length Subarrays
- Sum of All Subset XOR Totals
- Sum of Beauty in the Array
- Sum of Beauty of All Substrings
- Sum of Digits in the Minimum Number
- Sum of Distances in Tree
- Sum of Left Leaves
- Sum of Nodes with Even-Valued Grandparent
- Sum of Number and Its Reverse
- Sum of Prefix Scores of Strings
- Sum of Root To Leaf Binary Numbers
- Sum of Scores of Built Strings
- Sum of Square Numbers
- Sum of Subarray Minimums
- Sum of Subarray Ranges
- Sum of Total Strength of Wizards
- Sum of Two Integers
- Sum Root to Leaf Numbers
- Summary Ranges
- Super Egg Drop
- Super Washing Machines
- Surrounded Regions
- Swap Nodes in Pairs
- Swapping Nodes in a Linked List
- Swim in Rising Water
- Symmetric Tree
- Take Gifts From the Richest Pile
- Take K of Each Character From Left and Right
- Target Sum
- Task Scheduler II
- Task Scheduler
- Teemo Attacking
- Text Justification
- The K Weakest Rows in a Matrix
- The kth Factor of n
- The Latest Time to Catch a Bus
- The Maze II
- The Maze
- The Number of the Smallest Unoccupied Chair
- The Skyline Problem
- Third Maximum Number
- Time Based Key-Value Store
- Time Needed to Buy Tickets
- Time Needed to Inform All Employees
- Time Needed to Rearrange a Binary String
- Time Taken to Cross the Door
- To Be Or Not To Be
- Top K Frequent Elements
- Top K Frequent Words
- Total Appeal of A String
- Total Cost to Hire K Workers
- Transpose Matrix
- Trapping Rain Water II
- Trapping Rain Water
- Triangle
- Trim a Binary Search Tree
- Truncate Sentence
- Tuple with Same Product
- Two Best Non-Overlapping Events
- Two City Scheduling
- Two Sum BSTs
- Two Sum II - Input Array Is Sorted
- Two Sum III - Data structure design
- Two Sum IV - Input is a BST
- Two Sum Less Than K
- Two Sum
- Ugly Number II
- Ugly Number
- Uncrossed Lines
- Unique Binary Search Trees II
- Unique Binary Search Trees
- Unique Length-3 Palindromic Subsequences
- Unique Number of Occurrences
- Unique Paths II
- Unique Paths III
- Unique Paths
- Unique Substrings in Wraparound String
- Using a Robot to Print the Lexicographically Smallest String
- Valid Anagram
- Valid Mountain Array
- Valid Number
- Valid Palindrome II
- Valid Palindrome III
- Valid Palindrome IV
- Valid Palindrome
- Valid Parentheses
- Valid Parenthesis String
- Valid Phone Numbers
- Valid Sudoku
- Valid Tic-Tac-Toe State
- Valid Triangle Number
- Valid Word Abbreviation
- Validate Binary Search Tree
- Validate Binary Tree Nodes
- Validate IP Address
- Validate Stack Sequences
- Verify Preorder Serialization of a Binary Tree
- Verifying an Alien Dictionary
- Vertical Order Traversal of a Binary Tree
- Video Stitching
- Walls and Gates
- Water and Jug Problem
- Water Bottles
- Widest Vertical Area Between Two Points Containing No Points
- Wiggle Sort II
- Wildcard Matching
- Word Break II
- Word Break
- Word Frequency
- Word Ladder II
- Word Ladder
- Word Pattern
- Word Search II
- Word Search
- Word Subsets
- XOR Queries of a Subarray
- Zero Array Transformation II
- Zigzag Conversion