| Reconstruct Itinerary Problem |
Hard
|
amazon
apple
bloomberg
citadel
facebook
goldman-sachs
google
microsoft
qualtrics
snapchat
square
twilio
uber
yandex
yelp
|
|
| Remove Invalid Parentheses Problem |
Hard
|
amazon
apple
bloomberg
facebook
google
houzz
ponyai
postmates
uber
|
|
| Serialize and Deserialize Binary Tree |
Hard
|
amazon
apple
bloomberg
citadel
ebay
expedia
facebook
google
groupon
indeed
linkedin
microsoft
oracle
qualtrics
quora
salesforce
snapchat
tableau
uber
vmware
yahoo
|
|
| Shortest Palindrome 1 - Prepending characters |
Hard
|
adobe
amazon
bloomberg
facebook
google
microsoft
oracle
pocket-gems
|
|
| Smallest K-Length Subsequence With Occurrences of a Letter Problem |
Hard
|
|
|
| Strobogrammatic Number 3 - Count in Range |
Hard
|
facebook
google
|
|
| Student Attendance Record 2 Problem |
Hard
|
google
uber
|
|
| Sudoku Solver Problem |
Hard
|
adobe
amazon
apple
arista-networks
doordash
dropbox
expedia
facebook
google
microsoft
oracle
riot-games
roblox
snapchat
uber
vmware
wish
|
|
| Trips and Users Problem |
Hard
|
amazon
uber
|
|
| Valid Number Problem |
Hard
|
adobe
amazon
apple
facebook
google
linkedin
microsoft
tripadvisor
|
|
| Word Break 2 - Construct a sentence |
Hard
|
amazon
apple
audible
bloomberg
bookingcom
dropbox
ebay
facebook
google
microsoft
oracle
pinterest
snapchat
twitter
uber
zillow
|
|
| Encode String with Shortest Length Problem |
Hard
|
google
|
|
| Constrained Subsequence Sum |
Hard
|
akuna-capital
|
|
| Maximum Score of a Good Subarray |
Hard
|
|
|
| Number of Flowers in Full Bloom |
Hard
|
|
|
| Recover the Original Array |
Hard
|
|
|
| Design Skiplist Problem |
Hard
|
ebay
google
microsoft
pure-storage
twitter
|
|
| Human Traffic of Stadium |
Hard
|
adobe
amazon
uber
|
|
| Remove Max Number of Edges to Keep Graph Fully Traversable Problem |
Hard
|
|
|
| Similar String Groups Problem |
Hard
|
amazon
facebook
google
snapchat
|
|
| Sum of Distances in Tree |
Hard
|
google
|
|
| All O`one Data Structure Problem |
Hard
|
amazon
bloomberg
facebook
google
linkedin
microsoft
uber
|
|
| Encode N-ary Tree to Binary Tree |
Hard
|
microsoft
|
|
| K-th Smallest in Lexicographical Order Problem |
Hard
|
bytedance
google
hulu
|
|
| Trapping Rain Water 2 |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
twitter
|
|
| Minimum Cost to Make Array Equal |
Hard
|
|
|
| Number of Increasing Paths in a Grid Problem |
Hard
|
|
|
| Maximum Sum of 3 Non-Overlapping Subarrays |
Hard
|
facebook
google
|
|
| Vertical Order Traversal of a Binary Tree Problem |
Hard
|
adobe
amazon
bloomberg
databricks
facebook
google
linkedin
microsoft
reddit
samsung
|
|
| Naming a Company Problem |
Hard
|
|
|
| Game Play Analysis V |
Hard
|
gsn-games
|
|
| N-Queens 2 - Count number of distinct solutions |
Hard
|
amazon
zenefits
|
|
| Rearrange String k Distance Apart |
Hard
|
amazon
ebay
facebook
google
microsoft
|
|
| Smallest Rectangle Enclosing Black Pixels Problem |
Hard
|
google
|
|
| Substring with Largest Variance |
Hard
|
|
|
| Sliding Window Maximum |
Hard
|
adobe
alibaba
amazon
apple
bloomberg
bytedance
citadel
coursera
databricks
facebook
google
lyft
microsoft
nutanix
oracle
pinterest
roblox
twitter
uber
vmware
wish
yelp
zenefits
|
|
| Skyline Problem |
Hard
|
adobe
amazon
apple
databricks
facebook
goldman-sachs
google
houzz
microsoft
salesforce
tableau
twitter
uber
yelp
|
|
| Word Ladder 1 - Get Ladder Length |
Hard
|
affirm
amazon
apple
audible
bloomberg
cohesity
expedia
facebook
google
linkedin
lyft
microsoft
oracle
pinterest
qualtrics
salesforce
samsung
servicenow
snapchat
spotify
square
tesla
uber
vmware
yelp
zillow
|
|
| Minimum Window Substring |
Hard
|
adobe
airbnb
amazon
apple
bloomberg
bytedance
cohesity
deutsche-bank
directi
ebay
facebook
godaddy
goldman-sachs
google
linkedin
lyft
microsoft
nutanix
oracle
salesforce
snapchat
tencent
twitter
uber
visa
vmware
yahoo
|
|
| N-Queens |
Hard
|
adobe
amazon
apple
bytedance
ebay
facebook
google
microsoft
oracle
rubrik
tableau
uber
|
|
| K Reverse a linked list |
Hard
|
adobe
amazon
apple
bytedance
cisco
cohesity
ebay
facebook
google
mathworks
microsoft
paypal
vmware
|
|
| Best Time To Buy And Sell Stock 4 - at most k times |
Hard
|
amazon
apple
bloomberg
facebook
google
|
|
| Freedom Trail Problem |
Hard
|
google
|
|
| Maximum Profit in Job Scheduling |
Hard
|
airbnb
bytedance
cisco
google
ponyai
|
|
| Candy distribution Problem |
Hard
|
amazon
apple
google
microsoft
salesforce
uber
|
|
| Median of Two Sorted Arrays |
Hard
|
adobe
airbnb
alibaba
amazon
apple
bloomberg
bytedance
didi
dropbox
ebay
facebook
garena
godaddy
goldman-sachs
google
houzz
huawei
jpmorgan
microsoft
oracle
rubrik
tencent
two-sigma
uber
visa
vmware
yahoo
yandex
zenefits
zillow
zulily
|
|
| Maximal Rectangle |
Hard
|
adobe
amazon
bloomberg
citadel
facebook
google
indeed
karat
microsoft
samsung
uber
vmware
wayfair
|
|
| Department Top Three Salaries Problem |
Hard
|
adobe
amazon
google
netflix
|
|
| Read N Characters Given Read4 2 - Call Multiple Times |
Hard
|
amazon
bloomberg
facebook
google
lyft
microsoft
pinterest
uber
|
|
| Find Minimum in Rotated Sorted Array 2 - Duplicates allowed |
Hard
|
adobe
amazon
facebook
google
uber
|
|