| 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
|
|
|
| Equal Sum Grid Partition II |
Hard
|
|
|
| Find Circular Gift Exchange Chains |
Hard
|
|
|
| Find Invalid IP Addresses |
Hard
|
|
|
| Find Sum of Array Product of Magical Sequences |
Hard
|
|
|
| Find the Lexicographically Largest String From the Box II |
Hard
|
|
|
| Find X Value of Array II |
Hard
|
|
|
| First Letter Capitalization II |
Hard
|
|
|
| Frequencies of Shortest Supersequences |
Hard
|
|
|
| Length of Longest V-Shaped Diagonal Segment |
Hard
|
|
|
| Lexicographically Smallest Generated String |
Hard
|
|
|
| Longest Common Prefix of K Strings After Removal |
Hard
|
|
|
| Longest Palindrome After Substring Concatenation II |
Hard
|
|
|
| Longest Special Path |
Hard
|
|
|
| Longest Special Path II |
Hard
|
|
|
| Longest Team Pass Streak |
Hard
|
|
|
| Manhattan Distances of All Arrangements of Pieces |
Hard
|
|
|
| Maximize Active Section with Trade II |
Hard
|
|
|
| Maximize Subarray Sum After Removing All Occurrences of One Element |
Hard
|
|
|
| Maximize Subarrays After Removing One Conflicting Pair |
Hard
|
|
|
| Maximize the Distance Between Points on a Square |
Hard
|
|
|
| Maximize the Minimum Game Score |
Hard
|
|
|
| Maximum and Minimum Sums of at Most Size K Subarrays |
Hard
|
|
|
| Maximum Area Rectangle With Point Constraints II |
Hard
|
|
|
| Maximum Product of Subsequences With an Alternating Sum Equal to K |
Hard
|
|
|
| Maximum Profit from Valid Topological Order in DAG |
Hard
|
|
|
| Maximum Score of Non-overlapping Intervals |
Hard
|
|
|
| Maximum Sum of Edge Values in a Graph |
Hard
|
|
|
| Merge Operations for Minimum Travel Time |
Hard
|
|
|
| Minimum Cost Good Caption |
Hard
|
|
|
| Minimum Cost to Divide Array Into Subarrays |
Hard
|
|
|
| Minimum Increments for Target Multiples in an Array |
Hard
|
|
|
| Minimum Operations to Make Array Elements Zero |
Hard
|
|
|
| Minimum Operations to Make Character Frequencies Equal |
Hard
|
|
|
| Minimum Operations to Make Elements Within K Subarrays Equal |
Hard
|
|
|
| Multiply Two Polynomials |
Hard
|
|
|
| Path Existence Queries in a Graph II |
Hard
|
|
|
| Permutations IV |
Hard
|
|
|
| Separate Squares II |
Hard
|
|
|