| Check If a String Can Break Another String | Medium | | |
| Check if One String Swap Can Make Strings Equal | Easy | | |
| Delete and Earn | Medium | akuna-capital
pocket-gems
uber | |
| Determine if Two Strings Are Close | Medium | | |
| Edit Distance - Insert, Delete, no replace | Medium | | |
| Find Longest Awesome Substring | Hard | | |
| Friend Words - One Edit Distance | Medium | amazon
facebook
google
microsoft
snapchat
twitter
uber | |
| Largest Odd Number in String | Easy | | |
| Largest Substring Between Two Equal Characters | Easy | | |
| Longest Common Subsequence of Three Sequences | Hard | youtube | |
| Longest Duplicate Substring Problem | Hard | amazon
apple
google
microsoft
oracle | |
| Longest Happy Prefix | Hard | google | |
| Minimum Number of Removals to Make Mountain Array | Hard | | |
| Search a long string for small strings in an array | Hard | | |
| Shortest Common Supersequence | Hard | microsoft | |
| Split Message Based on Limit Problem | Hard | amazon
uber | |
| Z Algorithm String Searching | Medium | | |
| Balanced Binary Tree | Easy | adobe
amazon
apple
bloomberg
bytedance
cisco
facebook
google
microsoft
paypal | |
| Best Team With No Conflicts | Medium | | |
| Best Time To Buy And Sell Stock With Cooldown | Medium | amazon
apple
facebook
google | |
| Binary Tree Path Sum - Maximum between any two nodes | Hard | adobe
amazon
appdynamics
apple
baidu
bloomberg
bytedance
facebook
google
intuit
microsoft
twitter
uber
vmware | |
| Binary Tree Traversal - Zigzag Level Order Traversal | Medium | amazon
apple
bloomberg
bytedance
ebay
facebook
google
linkedin
microsoft
oracle
qualtrics
samsung
servicenow
yahoo
morgan-stanley | |
| Binary Tree Upside Down | Medium | google
linkedin | |
| Boyer-Moore String Searching | Medium | | |
| Buddy Strings | Easy | google | |
| Calculate the Binomial Coefficient | Medium | | |
| Calculating the mean and median of an unsorted array | Easy | uber | |
| Check if Move is Legal | Medium | | |
| Check if Word Equals Summation of Two Words | Easy | | |
| Cherry Pickup | Hard | adobe
akuna-capital
amazon
apple
citrix
flipkart
google
mathworks
oracle
uber | |
| Cherry Pickup II | Hard | google | |
| Combinations Problem | Medium | | |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | amazon
bloomberg
facebook
google
mathworks
microsoft
twitter | |
| Construct Binary Tree from Inorder and Preorder Traversal | Medium | adobe
amazon
apple
bloomberg
bytedance
citadel
facebook
google
microsoft
oracle
square
twitter
yahoo | |
| Contains Duplicate 2 - within k distance | Easy | adobe
airbnb
amazon
apple
bloomberg
google
microsoft
palantir-technologies | |
| Contains Duplicate 3 - within k distance and t difference | Hard | adobe
airbnb
apple
google
microsoft
palantir-technologies | |
| Convert Sorted List into a height-balanced Binary search Tree | Medium | amazon
bloomberg
facebook
google
lyft
microsoft
oracle
vmware
zenefits | |
| Count Inversions - Count Smaller on Right | Medium | google | |
| Count of Smaller Numbers After Self | Hard | adobe
amazon
apple
bloomberg
facebook
google
microsoft
oracle
uber | |
| Count Primes | Medium | adobe
amazon
apple
bloomberg
capital-one
ebay
facebook
goldman-sachs
google
intel
microsoft
oracle
yahoo
yandex | |
| Create Maximum Number | Hard | amazon
google | |
| Different Ways to Add Parentheses | Medium | amazon
cisco
citadel
facebook
google | |
| Distinct Subsequences | Hard | adobe
amazon
barclays
google
mathworks | |
| Divisor Game | Easy | bloomberg
google
visa | |
| Dot Product of 2 Sparse Vectors | Medium | | |
| Euler Graphs - Origin of Graph Theory - Seven bridges of Konigsberg | | | |
| Factor Combinations | Medium | google
linkedin
pinterest
uber | |
| Find first position of target element in sorted array | Medium | | |
| Find Leader Elements in an Array | Easy | | |
| 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 | |