| 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
|
|
| Encode and Decode TinyURL Problem |
Medium
|
adobe
amazon
bloomberg
facebook
google
microsoft
oracle
uber
|
|
| Flip Equivalent Binary Trees Problem |
Medium
|
amazon
ebay
google
|
|
| Unique Length-3 Palindromic Subsequences |
Medium
|
|
|
| Decode String Problem |
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
|
|
|
| Rotate an Array to Left |
Medium
|
facebook
|
|
| Partition Equal Subset Sum |
Medium
|
amazon
apple
ebay
facebook
google
microsoft
paypal
uber
vmware
yahoo
|
|
| Minimum Number of Swaps to Make the String Balanced Problem |
Medium
|
|
|
| Maximum Intervals Overlap Count |
Medium
|
snapchat
|
|
| Linked List Cycle 4 - Delete cycle |
Medium
|
|
|
| Convert BST to Greater Sum Tree |
Medium
|
amazon
apple
microsoft
uber
|
|
| Longest Absolute File Path Problem |
Medium
|
amazon
apple
facebook
google
uber
wish
|
|
| Implement 3 stacks in 1 array |
Medium
|
|
|
| List Combinations - Generate unique combinations from list selecting 1 element from each |
Medium
|
|
|