Company: LinkedIn
- Accounts Merge
- All O`one Data Structure
- Binary Search Tree Iterator
- Binary Tree Level Order Traversal
- Binary Tree Upside Down
- Binary Tree Zigzag Level Order Traversal
- Building H2O
- Bulb Switcher
- Can I Win
- Can Place Flowers
- Closest Binary Search Tree Value II
- Closest Leaf in a Binary Tree
- Combination Sum II
- Combination Sum
- Count Different Palindromic Subsequences
- Count Integers in Intervals
- Course Schedule II
- Create Binary Tree From Descriptions
- Design Add and Search Words Data Structure
- Design Authentication Manager
- Design Bounded Blocking Queue
- Design HashMap
- Diameter of Binary Tree
- Dot Product of Two Sparse Vectors
- Edit Distance
- Evaluate Reverse Polish Notation
- Exclusive Time of Functions
- Expression Add Operators
- Factor Combinations
- Find First and Last Position of Element in Sorted Array
- Find K Closest Elements
- Find K Pairs with Smallest Sums
- Find Largest Value in Each Tree Row
- Find Leaves of Binary Tree
- Find Pivot Index
- Find Smallest Letter Greater Than Target
- Find the Celebrity
- Fizz Buzz
- Flatten Nested List Iterator
- Graph Valid Tree
- H-Index
- House Robber II
- House Robber III
- House Robber
- Implement Rand10() Using Rand7()
- Insert Delete GetRandom O(1) - Duplicates allowed
- Insert Delete GetRandom O(1)
- Insert Interval
- Integer to Roman
- Intersection of Two Arrays
- Intersection of Two Linked Lists
- Isomorphic Strings
- K Closest Points to Origin
- Koko Eating Bananas
- Kth Largest Element in an Array
- Kth Smallest Element in a BST
- Kth Smallest Product of Two Sorted Arrays
- Letter Combinations of a Phone Number
- Long Pressed Name
- Longest Palindromic Subsequence
- Longest Palindromic Substring
- Longest Substring Without Repeating Characters
- 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
- LRU Cache
- Max Area of Island
- Max Consecutive Ones III
- Max Points on a Line
- Max Stack
- Maximize Total Tastiness of Purchased Fruits
- Maximum Depth of Binary Tree
- Maximum Number of Non-overlapping Palindrome Substrings
- Maximum Product Subarray
- Maximum Subarray
- Median of Two Sorted Arrays
- Merge Intervals
- Merge k Sorted Lists
- Merge Sorted Array
- Merge Two Sorted Lists
- Min Stack
- Minimum Deletions to Make Array Divisible
- Minimum Knight Moves
- Minimum Time to Type Word Using Special Typewriter
- Minimum Window Substring
- Nested List Weight Sum II
- Nested List Weight Sum
- Next Permutation
- Number of Connected Components in an Undirected Graph
- Number of Divisible Triplet Sums
- Number of Islands
- Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
- Paint House II
- Paint House
- Palindromic Substrings
- Partition Labels
- Partition to K Equal Sum Subsets
- Permutations II
- Permutations
- Possible Bipartition
- Pow(x, n)
- Product of Array Except Self
- Random Pick with Weight
- Repeated DNA Sequences
- Robot Bounded In Circle
- Robot Room Cleaner
- Roman to Integer
- Rotate List
- Same Tree
- Search in Rotated Sorted Array
- Second Minimum Node In a Binary Tree
- Serialize and Deserialize Binary Tree
- Serialize and Deserialize N-ary Tree
- Shortest Word Distance II
- Shortest Word Distance III
- Shortest Word Distance
- Shuffle an Array
- Sort Transformed Array
- Sparse Matrix Multiplication
- Sqrt(x)
- Subarray Product Less Than K
- Sum of All Odd Length Subarrays
- Sum of Square Numbers
- Symmetric Tree
- Text Justification
- Time to Cross a Bridge
- Two Sum III - Data structure design
- Two Sum
- Valid Number
- Valid Parentheses
- Valid Parenthesis String
- Valid Perfect Square
- Valid Triangle Number
- Validate Binary Search Tree
- Validate Stack Sequences
- Word Break
- Word Ladder