| 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
|
|
|
| Orderly Queue |
Hard
|
amazon
|
|
| 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
|
|
| Burst Balloons |
Hard
|
adobe
amazon
facebook
google
samsung
snapchat
|
|
| 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
|
|
| Allocate Mailboxes |
Hard
|
bloomberg
|
|
| Build Array Where You Can Find The Maximum Exactly K Comparisons |
Hard
|
|
|
| Best Time To Buy And Sell Stock 4 - at most k times |
Hard
|
amazon
apple
bloomberg
facebook
google
|
|
| Count All Possible Routes |
Hard
|
|
|
| Freedom Trail Problem |
Hard
|
google
|
|
| Minimum Number of Refueling Stops |
Hard
|
amazon
baidu
google
microsoft
|
|
| Concatenated Words |
Hard
|
amazon
apple
audible
facebook
google
microsoft
|
|
| Maximum Profit in Job Scheduling |
Hard
|
airbnb
bytedance
cisco
google
ponyai
|
|
| Decode Ways II |
Hard
|
facebook
google
|
|
| Longest Valid Parentheses |
Hard
|
adobe
amazon
apple
bloomberg
citadel
ebay
facebook
google
microsoft
oracle
samsung
uber
yahoo
|
|
| 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
|
|
| Word Ladder 2 - Get all the ladders |
Hard
|
amazon
apple
bloomberg
box
facebook
google
linkedin
lyft
microsoft
oracle
pinterest
uber
yahoo
yelp
|
|
| Best Time To Buy And Sell Stock 3 - at most twice |
Hard
|
amazon
apple
atlassian
bloomberg
citadel
facebook
flipkart
google
microsoft
rubrik
two-sigma
|
|
| Text Justification |
Hard
|
airbnb
amazon
apple
box
coursera
facebook
google
indeed
intuit
linkedin
lyft
microsoft
palantir
paypal
pinterest
robinhood
snapchat
twilio
twitter
uber
|
|
| Trapping Rain Water |
Hard
|
adobe
affirm
airbnb
amazon
apple
audible
bloomberg
bytedance
citadel
databricks
dataminr
ebay
electronic-arts
facebook
flipkart
goldman-sachs
google
grab
huawei
lyft
microsoft
nvidia
oracle
palantir-technologies
qualtrics
salesforce
servicenow
snapchat
tableau
twitter
uber
visa
wish
yahoo
yandex
zenefits
|
|
| First Missing Positive |
Hard
|
adobe
amazon
apple
bloomberg
bytedance
databricks
ebay
facebook
google
grab
inmobi
microsoft
model-N
morgan-stanley
oracle
pocket-gems
salesforce
sap
stripe
tesla
twitch
uber
vmware
wayfair
wish
|
|
| Minimum Number of Days to Disconnect Island Problem |
Hard
|
|
|
| Unique Paths in Grid 3 - Count all paths moving in 4 directions with obstacles and custom start and end |
Hard
|
amazon
google
limebike
|
|
| Patching Array Problem |
Hard
|
google
|
|
| Split Array Largest Sum Problem |
Hard
|
amazon
baidu
facebook
google
|
|
| LFU Cache Problem |
Hard
|
adobe
alibaba
amazon
apple
bloomberg
goldman-sachs
google
linkedin
microsoft
salesforce
snapchat
uber
vmware
|
|
| String Compression 2 Problem |
Hard
|
|
|
| Regular Expression Matching Problem |
Hard
|
adobe
airbnb
alibaba
amazon
apple
bloomberg
bytedance
coursera
databricks
ebay
facebook
flipkart
google
houzz
lyft
microsoft
oracle
palantir-technologies
pocket-gems
twitter
uber
zulily
|
|
| Wildcard Matching Problem |
Hard
|
adobe
amazon
bloomberg
bytedance
coursera
cruise-automation
facebook
goldman-sachs
google
microsoft
oracle
snapchat
twitter
two-sigma
|
|
| Maximum Height by Stacking Cuboids Problem |
Hard
|
|
|
| Manachar’s Algorithm - Longest palindromic substring in linear time |
Hard
|
|
|
| Morris Traversal |
Hard
|
palantir
|
|