| Angle Between Hands of a Clock |
Medium
|
amazon
microsoft
|
|
| All Elements in Two Binary Search Trees |
Medium
|
amazon
facebook
oracle
|
|
| 24 Game |
Hard
|
amazon
facebook
google
microsoft
twitter
uber
|
|
| All Paths from Source to Target |
Medium
|
amazon
bloomberg
|
|
| Bomb Enemy |
Medium
|
amazon
google
uber
|
|
| Construct Quad Tree |
Medium
|
amazon
apple
google
uber
|
|
| Count The Repetitions |
Hard
|
amazon
|
|
| Data Stream as Disjoint Intervals |
Hard
|
amazon
facebook
google
oracle
|
|
| Design Snake Game |
Medium
|
amazon
apple
bloomberg
facebook
google
salesforce
uber
zillow
|
|
| Design Twitter (Data Structure Design) |
Medium
|
amazon
doordash
oracle
twitter
yelp
|
|
| Find K Pairs with Smallest Sums |
Medium
|
amazon
apple
facebook
google
linkedin
microsoft
uber
|
|
| Find the Shortest Superstring |
Hard
|
amazon
google
|
|
| Frog Jump |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
nutanix
oracle
snapchat
|
|
| Insert Delete Search and GetRandom in Constant Time 1 - Dupes not allowed |
Medium
|
adobe
affirm
amazon
appdynamics
apple
bloomberg
databricks
facebook
flipkart
goldman-sachs
google
indeed
linkedin
microsoft
oracle
pinterest
pocket-gems
pure-storage
quora
salesforce
twilio
twitter
two-sigma
uber
visa
vmware
yandex
yelp
|
|
| Insert Delete Search and GetRandom in Constant Time 2 - Duplicates allowed |
Hard
|
affirm
amazon
apple
databricks
facebook
google
linkedin
microsoft
uber
yelp
|
|
| Largest Multiple of Three |
Hard
|
amazon
|
|
| Last Stone Weight II |
Medium
|
amazon
|
|
| Logger Rate Limiter |
Easy
|
amazon
apple
atlassian
bloomberg
google
linkedin
microsoft
uber
|
|
| Longest Increasing Path in a Matrix |
Hard
|
adobe
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
snapchat
uber
|
|
| Longest Turbulent Subarray |
Medium
|
amazon
bloomberg
|
|
| Maximum Frequency Stack |
Hard
|
amazon
apple
bloomberg
google
microsoft
salesforce
uber
|
|
| Maximum Product of Splitted Binary Tree |
Medium
|
amazon
bytedance
microsoft
|
|
| Maximum Sum BST in Binary Tree |
Hard
|
amazon
|
|
| Minimum Cost to Merge Stones |
Hard
|
amazon
google
|
|
| Minimum Swaps To Make Sequences Increasing |
Hard
|
amazon
facebook
google
|
|
| Number of Digit One |
Hard
|
amazon
apple
|
|
| Number of Islands II |
Hard
|
amazon
facebook
google
microsoft
oracle
snapchat
uber
|
|
| Number of Longest Increasing Subsequence |
Medium
|
amazon
bloomberg
facebook
|
|
| Numbers At Most N Given Digit Set |
Hard
|
amazon
|
|
| Palindrome Permutation II |
Medium
|
amazon
google
microsoft
uber
|
|
| Queue Reconstruction by Height |
Medium
|
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
|
|
| Random Pick with Weight |
Medium
|
amazon
apple
atlassian
doordash
facebook
google
linkedin
microsoft
rubrik
tripadvisor
twitter
two-sigma
uber
wish
yelp
|
|
| Russian Doll Envelopes |
Hard
|
amazon
google
microsoft
|
|
| Shortest Path Visiting All Nodes |
Hard
|
amazon
google
meituan
|
|
| Two City Scheduling |
Medium
|
amazon
bloomberg
facebook
google
|
|
| Video Stitching |
Medium
|
amazon
google
|
|
| Walls and Gates |
Medium
|
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
spotify
uber
|
|
| Wiggle Subsequence |
Medium
|
amazon
facebook
uber
|
|
| Minimum Domino Rotations For Equal Row |
Medium
|
amazon
google
|
|
| Smallest positive integer that cannot be represented as the sum of a subset of a sorted array |
Easy
|
amazon
|
|
| Length of Longest Fibonacci Subsequence |
Medium
|
amazon
baidu
|
|
| Construct Binary Tree from Preorder and Postorder Traversal |
Medium
|
amazon
bloomberg
facebook
google
uber
|
|
| Recover a Tree From Preorder Traversal |
Hard
|
amazon
linkedin
|
|
| Making A Large Island |
Hard
|
amazon
facebook
google
uber
|
|
| Count Servers that Communicate |
Medium
|
amazon
google
|
|
| Busiest period in a building |
Easy
|
amazon
|
|
| Word Subsets |
Medium
|
amazon
facebook
google
|
|
| Implement a bit array |
Medium
|
amazon
|
|
| String Matching in an Array |
Easy
|
amazon
|
|
| Break a string into lines of length k without breaking words |
Medium
|
amazon
|
|