| Manachar’s Algorithm - Longest palindromic substring in linear time |
Hard
|
|
|
| Morris Traversal |
Hard
|
palantir
|
|
| Substring with Concatenation of All Words |
Hard
|
adobe
amazon
apple
bloomberg
dropbox
facebook
google
microsoft
|
|
| Integer to English Words Problem |
Hard
|
amazon
apple
barclays
bloomberg
capital-one
citrix
facebook
google
jpmorgan
linkedin
microsoft
nutanix
oracle
palantir-technologies
paypal
sap
splunk
square
tableau
tesla
uber
visa
yahoo
yelp
zillow
|
|
| Design Search Autocomplete System |
Hard
|
amazon
apple
bloomberg
dropbox
facebook
google
lyft
microsoft
salesforce
snapchat
uber
|
|
| Course Schedule 3 Problem |
Hard
|
google
microsoft
works-applications
|
|
| Basic Calculator 4 Problem |
Hard
|
amazon
google
indeed
intuit
pinterest
roblox
|
|
| Basic Calculator 3 Problem |
Hard
|
amazon
apple
bytedance
doordash
facebook
google
houzz
hulu
jingchi
microsoft
pinterest
pocket-gems
snapchat
uber
|
|
| Basic Calculator 1 Problem |
Hard
|
adobe
amazon
bloomberg
facebook
google
indeed
intuit
jump-trading
karat
microsoft
paypal
pinterest
robinhood
roblox
snapchat
uber
|
|
| Binary Tree Cameras Problem |
Hard
|
ebay
facebook
google
uber
|
|
| Word Search 2 - Return All Words |
Hard
|
airbnb
amazon
apple
bloomberg
bytedance
cisco
citadel
facebook
google
houzz
microsoft
oracle
roblox
salesforce
snapchat
uber
yahoo
zillow
|
|
| Serialize and Deserialize N-Ary Tree |
Hard
|
amazon
apple
ebay
facebook
google
linkedin
microsoft
pinterest
uber
|
|
| Minimum Interval to Include Each Query |
Hard
|
|
|
| Count Beautiful Numbers |
Hard
|
|
|
| Count Substrings Divisible By Last Digit |
Hard
|
|
|
| Design an Array Statistics Tracker |
Hard
|
|
|