Company: Meta
- 01 Matrix
- 2 Keys Keyboard
- 3Sum Closest
- 3Sum
- 4Sum
- Accounts Merge
- Add Binary
- Add Bold Tag in String
- Add Digits
- Add One Row to Tree
- Add Strings
- Add to Array-Form of Integer
- Add Two Integers
- Add Two Numbers
- Adding Spaces to a String
- 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 Possible Full Binary Trees
- Angle Between Hands of a Clock
- Apply Discount Every n Orders
- Apply Operations to an Array
- Array Prototype Last
- Assign Cookies
- Asteroid Collision
- Average of Levels in Binary Tree
- Average Waiting Time
- Backspace String Compare
- Balance a Binary Search Tree
- Balanced Binary Tree
- Baseball Game
- Basic Calculator II
- Basic Calculator III
- Basic Calculator
- Battleships in a Board
- Best Meeting Point
- Best Sightseeing Pair
- 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 Transaction Fee
- Best Time to Buy and Sell Stock
- Binary Search Tree Iterator II
- Binary Search Tree Iterator
- Binary Search
- Binary Subarrays With Sum
- Binary Tree Cameras
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal
- Binary Tree Maximum Path Sum
- Binary Tree Paths
- Binary Tree Postorder Traversal
- Binary Tree Preorder Traversal
- Binary Tree Pruning
- Binary Tree Right Side View
- Binary Tree Vertical Order Traversal
- Binary Tree Zigzag Level Order Traversal
- Block Placement Queries
- Boats to Save People
- Boundary of Binary Tree
- Brick Wall
- Build Array from Permutation
- Buildings With an Ocean View
- Bulb Switcher
- Bulls and Cows
- Calculate Amount Paid in Taxes
- Can Place Flowers
- Candy Crush
- Candy
- Capacity To Ship Packages Within D Days
- Car Pooling
- Cheapest Flights Within K Stops
- Check Completeness of a Binary Tree
- Check if an Original String Exists Given Two Encoded Strings
- Check if Array Is Sorted and Rotated
- Check if One String Swap Can Make Strings Equal
- Check if the Sentence Is Pangram
- Check If Two String Arrays are Equivalent
- Check Knight Tour Configuration
- Cherry Pickup II
- Clear Digits
- Climbing Stairs
- Clone Graph
- Closest Binary Search Tree Value II
- Closest Binary Search Tree Value
- Closest Prime Numbers in Range
- Coin Change II
- Coin Change
- Combination Sum II
- Combination Sum IV
- Combination Sum
- Combinations
- Complete Binary Tree Inserter
- Concatenation of Array
- Consecutive Characters
- Construct Binary Search Tree from Preorder Traversal
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from String
- 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
- Contiguous Array
- Continuous Subarray Sum
- Convert 1D Array Into 2D Array
- Convert a Number to Hexadecimal
- Convert Binary Search Tree to Sorted Doubly Linked List
- Convert BST to Greater Tree
- Convert Sorted List to Binary Search Tree
- Copy List with Random Pointer
- Count Alternating Subarrays
- Count and Say
- Count Binary Substrings
- Count Complete Tree Nodes
- Count Good Nodes in Binary Tree
- Count Good Numbers
- Count Hills and Valleys in an Array
- Count Items Matching a Rule
- Count Negative Numbers in a Sorted Matrix
- Count Nodes Equal to Average of Subtree
- Count Nodes Equal to Sum of Descendants
- Count Pairs Whose Sum is Less than Target
- Count Primes
- Count Subarrays Where Max Element Appears at Least K Times
- Count Total Number of Colored Cells
- Counter
- Counting Bits
- Counting Words With a Given Prefix
- Course Schedule II
- Course Schedule
- Cousins in Binary Tree
- Crawler Log Folder
- Create a DataFrame from List
- Create Hello World Function
- Custom Sort String
- Cutting Ribbons
- Daily Temperatures
- Decode String
- Decode Ways II
- Decode Ways
- Decrypt String from Alphabet to Integer Mapping
- Defanging an IP Address
- 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 Add and Search Words Data Structure
- Design Circular Queue
- Design Front Middle Back Queue
- Design HashMap
- Design HashSet
- Design Hit Counter
- Design Search Autocomplete System
- Design Skiplist
- Design Tic-Tac-Toe
- Destination City
- Detect Squares
- Determine if Two Strings Are Close
- Determine Whether Matrix Can Be Obtained By Rotation
- Diagonal Traverse II
- Diagonal Traverse
- Diameter of Binary Tree
- Diameter of N-Ary Tree
- Different Ways to Add Parentheses
- Distribute Coins in Binary Tree
- Divide Two Integers
- Dot Product of Two Sparse Vectors
- Dota2 Senate
- Edit Distance
- Element Appearing More Than 25% In Sorted Array
- Encode and Decode Strings
- Encode and Decode TinyURL
- Evaluate Division
- Evaluate Reverse Polish Notation
- Even Odd Tree
- Excel Sheet Column Title
- Exclusive Time of Functions
- Expression Add Operators
- Extra Characters in a String
- Factorial Trailing Zeroes
- Faulty Sensor
- Fibonacci Number
- Final Prices With a Special Discount in a Shop
- 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 Groups of Farmland
- Find All Numbers Disappeared in an Array
- Find Common Characters
- Find Common Elements Between Two Arrays
- Find Distance in a Binary Tree
- Find Duplicate File in System
- Find Eventual Safe States
- Find First and Last Position of Element in Sorted Array
- Find if Array Can Be Sorted
- Find if Path Exists in Graph
- Find in Mountain Array
- Find K Closest Elements
- Find K Pairs with Smallest Sums
- Find Kth Bit in Nth Binary String
- Find Largest Value in Each Tree Row
- Find Longest Special Substring That Occurs Thrice I
- Find Median from Data Stream
- Find Minimum in Rotated Sorted Array
- Find Missing and Repeated Values
- Find Mode in Binary Search Tree
- Find Peak Element
- Find Pivot Index
- Find the Celebrity
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
- Find the Difference of Two Arrays
- Find the Difference
- Find the Duplicate Number
- Find the Index of the First Occurrence in a String
- Find the Kth Largest Integer in the Array
- Find the Kth Smallest Sum of a Matrix With Sorted Rows
- Find the Length of the Longest Common Prefix
- Find the Longest Substring Containing Vowels in Even Counts
- Find the Maximum Length of Valid Subsequence II
- Find the Middle Index in Array
- Find the Minimum and Maximum Number of Nodes Between Critical Points
- Find the Number of Good Pairs II
- Find the Prefix Common Array of Two Arrays
- Find the Smallest Divisor Given a Threshold
- Find the Winner of the Circular Game
- Find Unique Binary String
- Find Winner on a Tic Tac Toe Game
- First Bad Version
- First Missing Positive
- First Unique Character in a String
- Fizz Buzz
- Flatten a Multilevel Doubly Linked List
- Flatten Binary Tree to Linked List
- Flatten Deeply Nested Array
- Flatten Nested List Iterator
- Flood Fill
- Fraction to Recurring Decimal
- Frequency of the Most Frequent Element
- Friends Of Appropriate Ages
- Fruit Into Baskets
- Function Composition
- Game of Life
- Gas Station
- Generate Parentheses
- Goat Latin
- Graph Valid Tree
- Greatest Common Divisor of Strings
- Group Anagrams
- Group Shifted Strings
- Groups of Special-Equivalent Strings
- Grumpy Bookstore Owner
- Guess Number Higher or Lower
- Guess the Word
- H-Index II
- H-Index
- Hamming Distance
- Happy Number
- Height Checker
- House Robber II
- House Robber III
- House Robber IV
- House Robber
- Implement Magic Dictionary
- Implement Stack using Queues
- Implement Trie (Prefix Tree)
- Increasing Triplet Subsequence
- Inorder Successor in BST II
- Inorder Successor in BST
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Insert Interval
- Insert into a Sorted Circular Linked List
- Integer to English Words
- Integer to Roman
- Intersection of Three Sorted Arrays
- Intersection of Two Arrays II
- Intersection of Two Arrays
- Intersection of Two Linked Lists
- Interval List Intersections
- Invert Binary Tree
- IPO
- Is Graph Bipartite?
- Is Subsequence
- Island Perimeter
- Isomorphic Strings
- Jewels and Stones
- Jump Game II
- Jump Game
- K Closest Points to Origin
- K Inverse Pairs Array
- K Radius Subarray Averages
- K-th Smallest in Lexicographical Order
- K-th Symbol in Grammar
- Knight Probability in Chessboard
- Koko Eating Bananas
- Kth Largest Element in a Stream
- Kth Largest Element in an Array
- Kth Missing Positive Number
- Kth Smallest Element in a BST
- Kth Smallest Element in a Sorted Matrix
- Largest BST Subtree
- Largest Divisible Subset
- Largest Number After Digit Swaps by Parity
- Largest Number
- Largest Odd Number in String
- Largest Plus Sign
- Largest Rectangle in Histogram
- Last Stone Weight
- Leaf-Similar Trees
- Least Number of Unique Integers after K Removals
- Leftmost Column with at Least a One
- Lemonade Change
- Length of Last Word
- Length of the Longest Subsequence That Sums to Target
- Letter Case Permutation
- Letter Combinations of a Phone Number
- Letter Tile Possibilities
- Lexicographical Numbers
- LFU Cache
- Linked List Cycle II
- Linked List Cycle
- Linked List in Binary Tree
- Linked List Random Node
- Longest Absolute File Path
- Longest Common Prefix
- Longest Common Subsequence
- Longest Consecutive Sequence
- Longest Continuous Increasing Subsequence
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
- Longest Duplicate Substring
- Longest Increasing Path in a Matrix
- Longest Increasing Subsequence
- Longest Nice Subarray
- Longest Palindrome
- Longest Palindromic Subsequence
- Longest Palindromic Substring
- Longest Repeating Character Replacement
- Longest Repeating Substring
- Longest Square Streak in an Array
- Longest Strictly Increasing or Strictly Decreasing Subarray
- Longest Subarray of 1's After Deleting One Element
- Longest Subsequence Repeated k Times
- Longest Substring with At Most K Distinct Characters
- Longest Substring Without Repeating Characters
- Longest Univalue Path
- Longest Valid Parentheses
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree II
- Lowest Common Ancestor of a Binary Tree III
- Lowest Common Ancestor of a Binary Tree
- Lowest Common Ancestor of Deepest Leaves
- LRU Cache
- Majority Element II
- Majority Element
- Make Sum Divisible by P
- Make The String Great
- Make Two Arrays Equal by Reversing Subarrays
- Making A Large Island
- Max Area of Island
- Max Consecutive Ones II
- 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 Rectangle
- Maximal Square
- Maximum and Minimum Sums of at Most Size K Subsequences
- Maximum Average Subarray I
- Maximum Binary Tree II
- Maximum Compatibility Score Sum
- Maximum Depth of Binary Tree
- Maximum Difference Between Node and Ancestor
- Maximum Length of a Concatenated String with Unique Characters
- Maximum Level Sum of a Binary Tree
- Maximum Nesting Depth of the Parentheses
- Maximum Number of Darts Inside of a Circular Dartboard
- Maximum Number of Events That Can Be Attended
- Maximum Number of Fish in a Grid
- Maximum Number of Intersections on the Chart
- Maximum Number of Points From Grid Queries
- Maximum Population Year
- Maximum Product Subarray
- Maximum Score After Splitting a String
- Maximum Size Subarray Sum Equals k
- Maximum Subarray Sum with One Deletion
- Maximum Subarray
- Maximum Sum BST in Binary Tree
- Maximum Sum Circular Subarray
- Maximum Sum of 3 Non-Overlapping Subarrays
- Maximum Sum of Distinct Subarrays With Length K
- Maximum Swap
- Maximum Total Damage With Spell Casting
- Maximum Vacation Days
- Maximum Width of Binary Tree
- Median of Two Sorted Arrays
- Meeting Rooms II
- Meeting Rooms
- Merge In Between Linked Lists
- Merge Intervals
- Merge k Sorted Lists
- Merge Sorted Array
- Merge Strings Alternately
- Merge Two Binary Trees
- Merge Two Sorted Lists
- Mice and Cheese
- Middle of the Linked List
- Min Stack
- Minesweeper
- Mini Parser
- Minimize Maximum Pair Sum in Array
- Minimum Absolute Difference in BST
- Minimum Add to Make Parentheses Valid
- Minimum Array End
- Minimum Cost For Tickets
- Minimum Cost to Hire K Workers
- Minimum Cost to Reach Destination in Time
- Minimum Depth of Binary Tree
- Minimum Difference Between Highest and Lowest of K Scores
- Minimum Height Trees
- Minimum Insertion Steps to Make a String Palindrome
- Minimum Insertions to Balance a Parentheses String
- Minimum Knight Moves
- Minimum Number of Changes to Make Binary String Beautiful
- Minimum Number of Days to Disconnect Island
- Minimum Number of Days to Make m Bouquets
- Minimum Number of K Consecutive Bit Flips
- Minimum Number of Moves to Make Palindrome
- Minimum Number of Operations to Make Array XOR Equal to K
- Minimum Number of Operations to Move All Balls to Each Box
- Minimum Number of Removals to Make Mountain Array
- Minimum Number of Swaps to Make the String Balanced
- Minimum Operations to Exceed Threshold Value II
- Minimum Path Cost in a Hidden Grid
- Minimum Path Sum
- Minimum Remove to Make Valid Parentheses
- Minimum Size Subarray Sum
- Minimum Swaps To Make Sequences Increasing
- Minimum Time Difference
- Minimum Time to Collect All Apples in a Tree
- Minimum Value to Get Positive Step by Step Sum
- Minimum Window Subsequence
- Minimum Window Substring
- Missing Element in Sorted Array
- Missing Number
- Missing Ranges
- Monotonic Array
- Most Common Word
- Move Pieces to Obtain a String
- Move Zeroes
- Moving Average from Data Stream
- Moving Stones Until Consecutive II
- Moving Stones Until Consecutive
- Multiply Strings
- N-Queens II
- N-Queens
- N-th Tribonacci Number
- Nearest Exit from Entrance in Maze
- Nested List Weight Sum
- Next Greater Element I
- Next Greater Element II
- Next Greater Element III
- Next Permutation
- Non-overlapping Intervals
- Number of 1 Bits
- Number of Closed Islands
- Number of Connected Components in an Undirected Graph
- Number Of Corner Rectangles
- Number of Distinct Islands II
- Number of Distinct Islands
- Number of Even and Odd Bits
- Number of Good Pairs
- Number of Good Ways to Split a String
- Number of Islands II
- Number of Islands
- Number of Laser Beams in a Bank
- Number of Longest Increasing Subsequence
- Number of Provinces
- Number of Recent Calls
- Number of Squareful Arrays
- 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 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 Wonderful Substrings
- Odd Even Linked List
- One Edit Distance
- Pacific Atlantic Water Flow
- Paint House II
- Palindrome Linked List
- Palindrome Number
- Palindrome Partitioning
- Palindrome Permutation II
- Palindrome Permutation
- Palindromic Substrings
- Parsing A Boolean Expression
- Partition Array for Maximum Sum
- Partition Array Into Three Parts With Equal Sum
- Partition Equal Subset Sum
- Partition Labels
- Partition List
- Partition to K Equal Sum Subsets
- Pascal's Triangle
- Patching Array
- Path Sum II
- Path Sum III
- Path Sum
- Path With Minimum Effort
- Peak Index in a Mountain Array
- Peeking Iterator
- Perfect Number
- Permutation in String
- Permutations II
- Permutations
- Plus One
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node
- Power of Four
- Power of Three
- Power of Two
- Pow(x, n)
- Prefix and Suffix Search
- Previous Permutation With One Swap
- Product of Array Except Self
- Product of the Last K Numbers
- Product of Two Run-Length Encoded Arrays
- Put Marbles in Bags
- Queue Reconstruction by Height
- Random Pick Index
- Random Pick with Weight
- Range Module
- Range Sum of BST
- Range Sum Query 2D - Immutable
- Range Sum Query - Immutable
- Rank Transform of an Array
- Ransom Note
- Read N Characters Given read4 II - Call Multiple Times
- Read N Characters Given Read4
- Rearrange Array Elements by Sign
- Reconstruct Itinerary
- Recover a Tree From Preorder Traversal
- Rectangle Area
- Rectangle Overlap
- Redundant Connection II
- Redundant Connection
- Regions Cut By Slashes
- Regular Expression Matching
- Relative Sort Array
- Remove All Adjacent Duplicates in String II
- Remove All Adjacent Duplicates In String
- 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 Invalid Parentheses
- Remove K Digits
- Remove Linked List Elements
- Remove Nodes From Linked List
- Remove Nth Node From End of List
- Remove Outermost Parentheses
- Remove Sub-Folders from the Filesystem
- Reorder List
- Reorganize String
- Restore IP Addresses
- Reverse Bits
- Reverse Integer
- Reverse Linked List II
- Reverse Linked List
- Reverse Nodes in k-Group
- Reverse Pairs
- Reverse String
- Reverse Words in a String
- Robot Room Cleaner
- Roman to Integer
- Root Equals Sum of Children
- Rotate Array
- Rotate Image
- Rotate List
- Rotate String
- Rotting Oranges
- Same Tree
- Score of a String
- Score of Parentheses
- Scramble String
- Search a 2D Matrix II
- Search a 2D Matrix
- Search in a Binary Search Tree
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array
- Search Insert Position
- Search Suggestions System
- Seat Reservation Manager
- Second Minimum Node In a Binary Tree
- Self Dividing Numbers
- Separate the Digits in an Array
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize N-ary Tree
- Set Matrix Zeroes
- Set Mismatch
- Shifting Letters II
- Shortest Bridge
- Shortest Common Supersequence
- Shortest Distance from All Buildings
- Shortest Path in a Grid with Obstacles Elimination
- Shortest Path in a Hidden Grid
- Shortest Path in Binary Matrix
- Shortest Subarray to be Removed to Make Array Sorted
- Shortest Subarray With OR at Least K II
- Shortest Subarray with Sum at Least K
- Shortest Unsorted Continuous Subarray
- Shortest Way to Form String
- Shuffle an Array
- Sign of the Product of an Array
- Simplify Path
- Single Element in a Sorted Array
- Single Number II
- Single Number III
- Single Number
- Sliding Puzzle
- Sliding Window Maximum
- Sliding Window Median
- Smallest Missing Integer Greater Than Sequential Prefix Sum
- Smallest Range Covering Elements from K Lists
- Smallest Subsequence of Distinct Characters
- Smallest Subtree with all the Deepest Nodes
- Solving Questions With Brainpower
- Sort an Array
- Sort Array by Increasing Frequency
- Sort Array By Parity
- Sort Characters By Frequency
- Sort Colors
- Sort List
- Sort the People
- Sparse Matrix Multiplication
- Special Array With X Elements Greater Than or Equal X
- Spiral Matrix II
- Spiral Matrix III
- Spiral Matrix IV
- Spiral Matrix
- Split a String in Balanced Strings
- Split a String Into the Max Number of Unique Substrings
- Split Array Largest Sum
- Split Linked List in Parts
- Split Message Based on Limit
- 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
- String Compression
- String to Integer (atoi)
- Strobogrammatic Number II
- Strobogrammatic Number
- Subarray Product Less Than K
- Subarray Sum Equals K
- Subarray Sums Divisible by K
- Subarrays with K Different Integers
- Subsets II
- Subsets
- Substring with Concatenation of All Words
- Subtract the Product and Sum of Digits of an Integer
- Subtree of Another Tree
- Sudoku Solver
- Sum of All Subset XOR Totals
- Sum of Distances
- Sum of Left Leaves
- Sum of Nodes with Even-Valued Grandparent
- Sum of Square Numbers
- Sum of Subarray Minimums
- Sum of Subarray Ranges
- Sum of Total Strength of Wizards
- Sum of Two Integers
- Sum of Unique Elements
- Sum Root to Leaf Numbers
- Summary Ranges
- Surrounded Regions
- Swap Nodes in Pairs
- Swapping Nodes in a Linked List
- Swim in Rising Water
- Symmetric Tree
- Take K of Each Character From Left and Right
- Target Sum
- Task Scheduler II
- Task Scheduler
- Text Justification
- The k-th Lexicographical String of All Happy Strings of Length n
- The kth Factor of n
- The Maze II
- The Maze
- The Number of Beautiful Subsets
- The Skyline Problem
- Time Based Key-Value Store
- Time Needed to Buy Tickets
- To Be Or Not To Be
- Toeplitz Matrix
- Top K Frequent Elements
- Top K Frequent Words
- Total Hamming Distance
- Transpose File
- Trapping Rain Water II
- Trapping Rain Water
- Tree Diameter
- Two City Scheduling
- Two Sum II - Input Array Is Sorted
- Two Sum IV - Input is a BST
- Two Sum
- Ugly Number II
- 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
- UTF-8 Validation
- Valid Anagram
- Valid Arrangement of Pairs
- Valid Mountain Array
- Valid Number
- Valid Palindrome II
- Valid Palindrome III
- Valid Palindrome
- Valid Parentheses
- Valid Parenthesis String
- Valid Perfect Square
- Valid Square
- Valid Sudoku
- Valid Triangle Number
- Valid Word Abbreviation
- Validate Binary Search Tree
- Validate Binary Tree Nodes
- Validate IP Address
- Validate Stack Sequences
- Verifying an Alien Dictionary
- Vertical Order Traversal of a Binary Tree
- Walls and Gates
- Web Crawler Multithreaded
- Web Crawler
- Wildcard Matching
- Word Break II
- Word Break
- Word Ladder II
- Word Ladder
- Word Pattern
- Word Search II
- Word Search
- Word Subsets
- Words Within Two Edits of Dictionary
- Zero Array Transformation II
- Zigzag Conversion