| Count of Smaller Numbers After Self | Hard | adobe
amazon
apple
bloomberg
facebook
google
microsoft
oracle
uber | |
| Create Maximum Number | Hard | amazon
google | |
| Distinct Subsequences | Hard | adobe
amazon
barclays
google
mathworks | |
| Find Median from Data Stream | Hard | adobe
amazon
apple
atlassian
bloomberg
bytedance
citadel
ebay
expedia
facebook
goldman-sachs
google
microsoft
netflix
oracle
pinterest
qualtrics
salesforce
snapchat
twitter
uber
vmware
yahoo | |
| Find the Closest Palindrome | Hard | amazon
facebook
google
microsoft
nutanix
pinterest
uber
yelp | |
| Kth Permutation Sequence of Numbers 1 to N | Hard | amazon
apple
facebook
google
microsoft
twitter
yahoo | |
| Largest Rectangle in Histogram | Hard | adobe
amazon
bloomberg
facebook
flipkart
google
microsoft
twitter | |
| Max Chunks To Make Sorted 2 | Hard | google
microsoft | |
| Merge K Sorted Lists | Hard | adobe
airbnb
alibaba
amazon
apple
atlassian
audible
bloomberg
box
bytedance
cisco
cohesity
cruise-automation
ebay
facebook
goldman-sachs
google
indeed
ixl
linkedin
lyft
mathworks
microsoft
nvidia
oracle
salesforce
sap
tableau
twitter
uber
vmware
wish
yahoo
yandex
zillow | |
| Minimum Insertion Steps to Make a String Palindrome | Hard | bloomberg
google
quora | |
| Paint House 2 - N houses with k colors with no two adjacent houses with same color color | Hard | facebook
google
linkedin
snapchat | |
| Palindrome Pairs | Hard | airbnb
amazon
apple
bloomberg
facebook
google
square
uber | |
| Palindrome Partitioning II | Hard | amazon
google | |
| Palindrome Partitioning III | Hard | apple
uber | |
| Reconstruct Itinerary | 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 | |
| Scramble String | Hard | apple
google | |
| 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 | Hard | | |
| Strobogrammatic Number 3 - Count in Range | Hard | facebook
google | |
| Student Attendance Record 2 | Hard | google
uber | |
| Sudoku Solver | Hard | adobe
amazon
apple
arista-networks
doordash
dropbox
expedia
facebook
google
microsoft
oracle
riot-games
roblox
snapchat
uber
vmware
wish | |
| Trips and Users | Hard | amazon
uber | |
| Valid Number | 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 | Hard | google | |
| Largest Palindrome Product | Hard | apple
yahoo | |
| Sliding Window Median | Hard | amazon
apple
facebook
google
microsoft
snapchat
spotify | |
| Shortest Path in a Grid with Obstacles Elimination | Hard | didi
google | |
| Constrained Subsequence Sum | Hard | akuna-capital | |
| Find in Mountain Array | Hard | apple
google | |
| Maximum Score of a Good Subarray | Hard | | |
| Number of Flowers in Full Bloom | Hard | | |
| Number of Ways to Stay in the Same Place After Some Steps | Hard | facebook
google | |
| Painting the Walls | Hard | | |
| Parallel Courses III | Hard | | |
| Cracking the Safe | Hard | google | |
| Number of Excellent Pairs | Hard | | |
| Prefix and Suffix Search | Hard | facebook
google | |
| Maximum Performance of a Team | Hard | citrix | |
| Maximum Score from Performing Multiplication Operations | Hard | | |
| Recover the Original Array | Hard | | |
| Design Skiplist | Hard | ebay
google
microsoft
pure-storage
twitter | |
| Human Traffic of Stadium | Hard | adobe
amazon
uber | |
| Jump Game 4 | Hard | google | |
| Minimize Deviation in Array | Hard | | |
| Checking Existence of Edge Length Limited Paths | Hard | | |
| Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | | |
| Similar String Groups | Hard | amazon
facebook
google
snapchat | |