| 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 Problem |
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
|
|
| Sum of Distances in Tree |
Hard
|
google
|
|
| Optimal Account Balancing |
Hard
|
amazon
bytedance
google
uber
|
|
| All O`one Data Structure |
Hard
|
amazon
bloomberg
facebook
google
linkedin
microsoft
uber
|
|
| Arithmetic Slices II - Subsequence |
Hard
|
adobe
alibaba
baidu
facebook
|
|
| Encode N-ary Tree to Binary Tree |
Hard
|
microsoft
|
|
| K-th Smallest in Lexicographical Order |
Hard
|
bytedance
google
hulu
|
|
| Strong Password Checker |
Hard
|
adobe
amazon
google
uber
|
|
| Minimum Unique Word Abbreviation |
Hard
|
google
|
|
| Trapping Rain Water 2 |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
twitter
|
|
| Odd Even Jump |
Hard
|
google
|
|
| Minimum Cost to Make Array Equal |
Hard
|
|
|
| Number of Increasing Paths in a Grid |
Hard
|
|
|
| Shortest Path to Get All Keys |
Hard
|
airbnb
amazon
google
|
|
| Maximum Sum of 3 Non-Overlapping Subarrays |
Hard
|
facebook
google
|
|
| K Inverse Pairs Array |
Hard
|
works-applications
|
|
| Vertical Order Traversal of a Binary Tree |
Hard
|
adobe
amazon
bloomberg
databricks
facebook
google
linkedin
microsoft
reddit
samsung
|
|
| Bus Routes |
Hard
|
amazon
didi
google
uber
|
|
| Design Graph With Shortest Path Calculator |
Hard
|
|
|