| Map-based Trie Implementation |
|
|
|
| Max Chunks to Make Sorted |
Medium
|
google
microsoft
uber
|
|
| NSL - Nearest Smallest Element to Left of Every Element |
Easy
|
|
|
| NSR - Nearest Smaller Element to Right of every element |
Easy
|
|
|
| NGR - Nearest Greater Element to Right of every element |
Easy
|
|
|
| NGL - Nearest Greater Element to Left of every element |
Easy
|
|
|
| Score of Parentheses |
Medium
|
adobe
amazon
bytedance
|
|
| Verify Preorder Sequence in Binary Search Tree |
Medium
|
mathworks
uber
zenefits
|
|
| Find right-most cousin in a binary tree |
Medium
|
|
|
| Number of Steps to Reduce a Number to Zero |
Easy
|
google
hrt
|
|
| Design Circular Queue |
Medium
|
airbnb
amazon
apple
citadel
cloudera
facebook
google
microsoft
oracle
splunk
|
|
| Graph Representation - Adjacency List and Map |
|
|
|
| Graph Representation - Adjacency List (with isDirected) |
|
|
|
| Detect Squares |
Medium
|
|
|
| Path with Maximum Probability |
Medium
|
google
|
|
| Find the City With the Smallest Number of Neighbors at a Threshold Distance Problem |
Medium
|
uber
|
|
| Minimize Malware Spread 2 |
Hard
|
dropbox
|
|
| Average Waiting Time |
Medium
|
|
|
| Richest Customer Wealth |
Easy
|
|
|
| Camelcase Matching |
Medium
|
amazon
google
|
|
| Best Time To Buy And Sell Stock - Any number of times - Overlapping Transactions |
Medium
|
|
|
| Car Fleet |
Medium
|
google
|
|
| Maximum Length of a Concatenated String with Unique Characters |
Medium
|
honey
microsoft
tesla
|
|
| Check If Two String Arrays are Equivalent |
Easy
|
|
|
| Minimum Remove to Make Valid Parentheses |
Medium
|
amazon
bloomberg
bytedance
facebook
google
microsoft
|
|
| Serialize and Deserialize N-Ary Tree |
Hard
|
amazon
apple
ebay
facebook
google
linkedin
microsoft
pinterest
uber
|
|
| Minimum Interval to Include Each Query |
Hard
|
|
|
| Stickers to Spell Word |
Hard
|
facebook
ixl
|
|
| Median of Two Sorted Array of Equal or Same Size |
Medium
|
|
|
| 4Sum - Output in Sorted Order |
Medium
|
|
|
| 4Sum 2 - 4 Different Arrays |
Medium
|
apple
|
|
| Remove Covered Intervals |
Medium
|
amazon
|
|
| Longest Happy String |
Medium
|
amazon
wayfair
|
|
| Find minimum difference Element in sorted array |
Medium
|
|
|
| Open the Lock |
Medium
|
amazon
bloomberg
facebook
google
uber
citrix
|
|
| Partition Labels |
Medium
|
amazon
apple
facebook
|
|
| Trim a Binary Search Tree BST |
Medium
|
adobe
amazon
apple
bloomberg
facebook
google
microsoft
yahoo
|
|
| Flatten binary tree to linked list in order of preorder traversal |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
coupang
databricks
facebook
google
microsoft
nvidia
oracle
uber
yahoo
|
|
| Merge Triplets to Form Target Triplet |
Medium
|
|
|
| Encode and Decode TinyURL |
Medium
|
adobe
amazon
bloomberg
facebook
google
microsoft
oracle
uber
|
|
| Flip Equivalent Binary Trees |
Medium
|
amazon
ebay
google
|
|
| Maximum Product of the Length of Two Palindromic Subsequences |
Medium
|
|
|
| Minimum Difference Between Highest and Lowest of K Scores |
Easy
|
|
|
| Minimum Number of Days to Eat N Oranges |
Hard
|
|
|
| Eliminate Maximum Number of Monsters |
Medium
|
|
|
| Unique Length-3 Palindromic Subsequences |
Medium
|
|
|
| Check if Intervals Overlap |
Easy
|
|
|
| Decode String |
Medium
|
alibaba
amazon
appdynamics
apple
atlassian
bloomberg
bytedance
cisco
coupang
cruise-automation
ebay
facebook
google
huawei
hulu
microsoft
oracle
salesforce
snapchat
tencent
vmware
yahoo
yelp
|
|
| Frequency of the Most Frequent Element |
Medium
|
|
|
| Run-length Encoding |
Easy
|
amazon
|
|