Company: Bloomberg
- 01 Matrix
- 2 Keys Keyboard
- 3Sum Closest
- 3Sum
- 4Sum
- Accounts Merge
- Add Binary
- Add Digits
- Add to Array-Form of Integer
- Add Two Integers
- Add Two Numbers II
- Add Two Numbers
- All O`one Data Structure
- All Paths From Source to Target
- All Possible Full Binary Trees
- Allocate Mailboxes
- Amount of Time for Binary Tree to Be Infected
- Arranging Coins
- Assign Cookies
- Asteroid Collision
- Balance a Binary Search Tree
- Balanced Binary Tree
- Basic Calculator II
- Basic Calculator
- 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 with Transaction Fee
- Best Time to Buy and Sell Stock
- Binary Search Tree Iterator
- Binary Search
- Binary Subarrays With Sum
- Binary Tree Inorder Traversal
- Binary Tree Level Order Traversal
- 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
- Boats to Save People
- Buddy Strings
- Build Array from Permutation
- Can Place Flowers
- Candy Crush
- Candy
- Capacity To Ship Packages Within D Days
- Car Fleet
- Car Pooling
- Cheapest Flights Within K Stops
- Check if All Characters Have Equal Number of Occurrences
- Check if All the Integers in a Range Are Covered
- Check if Array Is Sorted and Rotated
- Check If It Is a Good Array
- Check If N and Its Double Exist
- Check if the Sentence Is Pangram
- Climbing Stairs
- Closest Prime Numbers in Range
- Coin Change
- Combination Sum II
- Combination Sum III
- Combination Sum
- Combinations
- Compare Version Numbers
- Complement of Base 10 Integer
- Concatenation of Array
- Consecutive Numbers 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 K Palindrome Strings
- Contain Virus
- Container With Most Water
- Contains Duplicate II
- Contains Duplicate
- Contiguous Array
- Continuous Subarrays
- Convert a Number to Hexadecimal
- Convert Binary Number in a Linked List to Integer
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Copy List with Random Pointer
- Count and Say
- Count Complete Tree Nodes
- Count Good Numbers
- Count Increasing Quadruplets
- Count Negative Numbers in a Sorted Matrix
- Count Number of Nice Subarrays
- Count of Smaller Numbers After Self
- Count Primes
- Count Servers that Communicate
- Count the Number of Arrays with K Matching Adjacent Elements
- Count the Number of Fair Pairs
- Count Total Number of Colored Cells
- Count Unhappy Friends
- Counter
- Counting Bits
- Course Schedule II
- Course Schedule
- Cousins in Binary Tree
- Create a DataFrame from List
- Create Hello World Function
- Critical Connections in a Network
- Custom Sort String
- Daily Temperatures
- Decode String
- Decode the Message
- Decode Ways
- Defanging an IP Address
- Delete and Earn
- Delete Characters to Make Fancy String
- Delete Node in a BST
- Delete Node in a Linked List
- Delete the Middle Node of a Linked List
- Design A Leaderboard
- Design a Todo List
- Design Add and Search Words Data Structure
- Design an Ordered Stream
- Design Browser History
- Design Hit Counter
- Design Most Recently Used Queue
- Design Search Autocomplete System
- Design Underground System
- Detect Pattern of Length M Repeated K or More Times
- DI String Match
- Diameter of Binary Tree
- Different Ways to Add Parentheses
- Distinct Subsequences
- Divide Two Integers
- Divisor Game
- Dot Product of Two Sparse Vectors
- Edit Distance
- Elimination Game
- Evaluate Division
- Evaluate Reverse Polish Notation
- Even Odd Tree
- Exam Room
- Excel Sheet Column Title
- Extra Characters in a String
- Factorial Trailing Zeroes
- Fibonacci Number
- Final Array State After K Multiplication Operations I
- Find a Peak Element II
- Find a Safe Walk Through a Grid
- Find All Anagrams in a String
- Find All Duplicates in an Array
- Find Bottom Left Tree Value
- Find Common Characters
- Find Common Elements Between Two Arrays
- Find Duplicate Subtrees
- Find Eventual Safe States
- Find First and Last Position of Element in Sorted Array
- Find if Path Exists in Graph
- Find in Mountain Array
- Find K Closest Elements
- Find K Pairs with Smallest Sums
- Find K-th Smallest Pair Distance
- Find Largest Value in Each Tree Row
- Find Median from Data Stream
- Find Minimum in Rotated Sorted Array
- Find Missing Observations
- Find Mode in Binary Search Tree
- Find Peak Element
- Find Pivot Index
- Find Polygon With the Largest Perimeter
- Find Resultant Array After Removing Anagrams
- Find Score of an Array After Marking All Elements
- Find the Difference
- Find the Duplicate Number
- Find the Index of the First Occurrence in a String
- Find the Integer Added to Array I
- Find the Longest Equal Subarray
- Find the Longest Substring Containing Vowels in Even Counts
- Find the Minimum and Maximum Number of Nodes Between Critical Points
- Find the Number of Distinct Colors Among the Balls
- Find the Peaks
- Find the Power of K-Size Subarrays I
- Find the Punishment Number of an Integer
- Find the Town Judge
- Find the Winner of the Circular Game
- Find Unique Binary String
- First Completely Painted Row or Column
- First Missing Positive
- First Unique Character in a String
- Fizz Buzz
- Flatten a Multilevel Doubly Linked List
- Flatten Binary Tree to Linked List
- Flood Fill
- Frequency of the Most Frequent Element
- Gas Station
- Generate Parentheses
- Gray Code
- Greatest Common Divisor of Strings
- Group Anagrams
- Guess Number Higher or Lower
- Guess the Word
- H-Index
- Hand of Straights
- Happy Number
- Heaters
- House Robber II
- House Robber
- How Many Numbers Are Smaller Than the Current Number
- Image Smoother
- Implement Magic Dictionary
- Implement Queue using Stacks
- Implement Stack using Queues
- Implement Trie (Prefix Tree)
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Insert Interval
- Integer Break
- Integer Replacement
- Integer to English Words
- Integer to Roman
- Intersection of Two Arrays II
- Intersection of Two Linked Lists
- Interval List Intersections
- Invalid Transactions
- Invert Binary Tree
- Is Subsequence
- Island Perimeter
- Isomorphic Strings
- Jump Game II
- Jump Game
- K Inverse Pairs Array
- K-th Symbol in Grammar
- Kids With the Greatest Number of Candies
- Kill Process
- Knight Dialer
- Koko Eating Bananas
- Kth Largest Element in an Array
- Kth Largest Sum in a Binary Tree
- Kth Missing Positive Number
- Kth Smallest Element in a BST
- Largest Divisible Subset
- Largest Number
- Largest Rectangle in Histogram
- Left and Right Sum Differences
- Lemonade Change
- Length of Last Word
- Length of Longest Fibonacci Subsequence
- Letter Combinations of a Phone Number
- Letter Tile Possibilities
- Lexicographical Numbers
- LFU Cache
- Linked List Cycle
- Linked List in Binary Tree
- Longest Common Prefix
- Longest Common Subsequence
- Longest Common Suffix Queries
- Longest Consecutive Sequence
- Longest Increasing Path in a Matrix
- Longest Mountain in Array
- Longest Palindrome
- Longest Palindromic Substring
- Longest Repeating Character Replacement
- Longest Strictly Increasing or Strictly Decreasing Subarray
- Longest String Chain
- Longest Substring Without Repeating Characters
- Longest Valid Parentheses
- Lowest Common Ancestor of a Binary Search Tree
- Lowest Common Ancestor of a Binary Tree
- LRU Cache
- Majority Element II
- Majority Element
- Making A Large Island
- Max Area of Island
- Max Consecutive Ones III
- Max Consecutive Ones
- Max Number of K-Sum Pairs
- Max Points on a Line
- Max Sum of a Pair With Equal Sum of Digits
- Maximal Rectangle
- Maximize Score After N Operations
- Maximum Average Subarray I
- Maximum Count of Positive Integer and Negative Integer
- Maximum Depth of Binary Tree
- Maximum Employees to Be Invited to a Meeting
- Maximum Gap
- Maximum Length of Pair Chain
- Maximum Length of Repeated Subarray
- Maximum Level Sum of a Binary Tree
- Maximum Nesting Depth of the Parentheses
- Maximum Number of Accepted Invitations
- Maximum Product of Three Numbers
- Maximum Product Subarray
- Maximum Profit in Job Scheduling
- Maximum Score After Splitting a String
- Maximum Score From Removing Substrings
- Maximum Strength of a Group
- Maximum Subarray Sum With Length Divisible by K
- Maximum Subarray
- Maximum Sum BST in Binary Tree
- Maximum Sum of 3 Non-Overlapping Subarrays
- Maximum Twin Sum of a Linked List
- Maximum Value at a Given Index in a Bounded Array
- Maximum Value of an Ordered Triplet II
- Maximum Width of Binary Tree
- Maximum Width Ramp
- Maximum XOR for Each Query
- Median of Two Sorted Arrays
- Meeting Rooms II
- Merge BSTs to Create Single BST
- Merge Intervals
- Merge k Sorted Lists
- Merge Sorted Array
- Merge Strings Alternately
- Merge Two Sorted Lists
- Middle of the Linked List
- Min Cost Climbing Stairs
- Min Stack
- Minimize the Total Price of the Trips
- Minimized Maximum of Products Distributed to Any Store
- Minimum Absolute Difference
- Minimum Add to Make Parentheses Valid
- Minimum Additions to Make Valid String
- Minimum Array End
- Minimum Bit Flips to Convert Number
- Minimum Cost of a Path With Special Roads
- Minimum Cost to Move Chips to The Same Position
- Minimum Depth of Binary Tree
- Minimum Falling Path Sum
- Minimum Increment to Make Array Unique
- Minimum Interval to Include Each Query
- Minimum Limit of Balls in a Bag
- Minimum Number of Days to Make m Bouquets
- Minimum Number of Operations to Make Elements in Array Distinct
- Minimum Number of Refueling Stops
- Minimum Number of Steps to Make Two Strings Anagram
- Minimum Number of Taps to Open to Water a Garden
- Minimum Path Sum
- Minimum Remove to Make Valid Parentheses
- Minimum Size Subarray Sum
- Minimum Swaps to Group All 1's Together II
- Minimum Time Difference
- Minimum Total Distance Traveled
- Minimum Window Substring
- Missing Number
- Move Zeroes
- Moving Average from Data Stream
- Multiply Strings
- My Calendar I
- N-ary Tree Postorder Traversal
- N-Queens II
- N-Queens
- Next Greater Element I
- Next Greater Element II
- Next Greater Element III
- Next Permutation
- Non-overlapping Intervals
- Nth Digit
- Number of Enclaves
- Number of Good Pairs
- Number of Islands
- Number of Provinces
- Number of Recent Calls
- Number of Senior Citizens
- Number of Ships in a Rectangle
- Number of Subsequences That Satisfy the Given Sum Condition
- Number of Substrings Containing All Three Characters
- Number of Ways to Arrive at Destination
- Odd Even Linked List
- Online Stock Span
- Out of Boundary Paths
- Paint House IV
- Painting the Walls
- Palindrome Linked List
- Palindrome Number
- Palindrome Partitioning
- Palindrome Permutation
- Palindromic Substrings
- Partition Array According to Given Pivot
- Partition Array for Maximum Sum
- Partition Array Into Two Arrays to Minimize Sum Difference
- Partition Equal Subset Sum
- Partition List
- Pascal's Triangle II
- Pascal's Triangle
- Path In Zigzag Labelled Binary Tree
- Path Sum II
- Path Sum III
- Path Sum
- Peak Index in a Mountain Array
- Perfect Squares
- Permutation in String
- Permutations
- Plus One
- Populating Next Right Pointers in Each Node II
- Populating Next Right Pointers in Each Node
- Power of Three
- Power of Two
- Pow(x, n)
- Product of Array Except Self
- Product of the Last K Numbers
- Pseudo-Palindromic Paths in a Binary Tree
- Race Car
- Range Sum of Sorted Subarray Sums
- Range Sum Query 2D - Immutable
- Range Sum Query 2D - Mutable
- Range Sum Query - Immutable
- Range Sum Query - Mutable
- Rank Teams by Votes
- Rank Transform of an Array
- Ransom Note
- Read N Characters Given read4 II - Call Multiple Times
- Rearrange Array Elements by Sign
- Reconstruct Itinerary
- Reduce Array Size to The Half
- Reducing Dishes
- 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 All Occurrences of a Substring
- Remove Boxes
- 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 Letter To Equalize Frequency
- Remove Linked List Elements
- Remove Nodes From Linked List
- Remove Nth Node From End of List
- Remove Outermost Parentheses
- Reorder List
- Reorder Routes to Make All Paths Lead to the City Zero
- Reorganize String
- Repeated DNA Sequences
- Repeated String Match
- Repeated Substring Pattern
- Return Length of Arguments Passed
- Reveal Cards In Increasing Order
- Reverse Integer
- Reverse Linked List
- Reverse Nodes in k-Group
- Reverse String II
- Reverse String
- Reverse Substrings Between Each Pair of Parentheses
- Reverse Vowels of a String
- Reverse Words in a String
- Robot Bounded In Circle
- Roman to Integer
- Rotate Array
- Rotate Image
- Rotate List
- Rotate String
- Rotting Oranges
- Running Sum of 1d Array
- Same Tree
- Score of a String
- Score of Parentheses
- Search a 2D Matrix
- Search in a Binary Search Tree
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array
- Search Insert Position
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize N-ary Tree
- Set Matrix Zeroes
- Shifting Letters
- Shortest Common Supersequence
- Shortest Distance from All Buildings
- Shortest Distance to Target String in a Circular Array
- Shortest Palindrome
- Shortest Path in a Grid with Obstacles Elimination
- Shortest Path in a Hidden Grid
- Shortest Path in Binary Matrix
- Shortest Path to Get Food
- Shuffle the Array
- Simplify Path
- Single Element in a Sorted Array
- Single Number II
- Single Number III
- Single Number
- Sleep
- Sliding Window Maximum
- Smallest Range I
- Snakes and Ladders
- Sort an Array
- Sort Array by Increasing Frequency
- Sort Array By Parity
- Sort Characters By Frequency
- Sort Colors
- Sort Even and Odd Indices Independently
- Sort Integers by The Power Value
- Sort List
- Sort the People
- Sorting the Sentence
- Soup Servings
- Sparse Matrix Multiplication
- Special Array With X Elements Greater Than or Equal X
- Spiral Matrix
- Split Array Largest Sum
- Split Linked List in Parts
- Sqrt(x)
- Squares of a Sorted Array
- Stickers to Spell Word
- Stone Game II
- Stone Game III
- Stone Game
- Strange Printer
- String Compression
- String Matching in an Array
- String to Integer (atoi)
- Subarray Sum Equals K
- Subsets II
- Subsets
- Substring with Concatenation of All Words
- Sudoku Solver
- Sum of Left Leaves
- Sum of Prefix Scores of Strings
- Sum of Square Numbers
- Sum of Subarray Minimums
- Sum of Two Integers
- Summary Ranges
- Surrounded Regions
- Swap Nodes in Pairs
- Symmetric Tree
- Target Sum
- Task Scheduler
- Text Justification
- The k-th Lexicographical String of All Happy Strings of Length n
- The Number of the Smallest Unoccupied Chair
- Third Maximum Number
- Top K Frequent Elements
- Top K Frequent Words
- Transpose Matrix
- Trapping Rain Water II
- Trapping Rain Water
- Triangle
- Trim a Binary Search Tree
- Truncate Sentence
- Two City Scheduling
- Two Sum II - Input Array Is Sorted
- Two Sum
- Ugly Number II
- Uncrossed Lines
- Unique Binary Search Trees
- Unique Number of Occurrences
- Unique Paths II
- Unique Paths III
- Unique Paths
- Valid Anagram
- Valid Palindrome
- Valid Parentheses
- Valid Parenthesis String
- Valid Perfect Square
- Valid Sudoku
- Valid Triangle Number
- Validate Binary Search Tree
- Vertical Order Traversal of a Binary Tree
- Walls and Gates
- Wildcard Matching
- Word Break II
- Word Break
- Word Ladder II
- Word Ladder
- Word Pattern
- Word Search
- Word Subsets
- Zero Array Transformation II
- Zigzag Conversion