Reverse Prefix of Word |
Easy
|
|
|
Given a binary search tree with 2 nodes swapped find number of pairs not following BST properties |
Easy
|
|
|
Permutations of Array 2 - Array has duplicates |
Medium
|
adobe
amazon
apple
bloomberg
facebook
linkedin
microsoft
uber
vmware
|
|
Combination Sum 4 - All permutations |
Medium
|
amazon
facebook
google
snapchat
visa
|
|
Implement multiplication, subtraction, and division using only addition |
|
|
|
Continuous Subarray Sum |
Medium
|
amazon
bytedance
facebook
google
microsoft
samsung
|
|
Implement Power Function 1 |
Medium
|
adobe
amazon
apple
asana
bloomberg
ebay
facebook
goldman-sachs
google
linkedin
microsoft
morgan-stanley
oracle
uber
vmware
|
|
Maximum Points on a Line |
Hard
|
amazon
apple
bloomberg
directi
google
inmobi
linkedin
microsoft
tripadvisor
twitter
uber
|
|
Missing Number |
Easy
|
adobe
amazon
apple
arista-networks
bloomberg
facebook
google
ibm
microsoft
oracle
servicenow
vmware
zillow
|
|
Reverse Integer Problem |
Medium
|
adobe
amazon
apple
barclays
bloomberg
cisco
facebook
google
jpmorgan
lyft
microsoft
netease
oracle
uber
yahoo
|
|
Palindrome Number Problem |
Easy
|
adobe
amazon
apple
bloomberg
facebook
google
hcl
jpmorgan
microsoft
oracle
yahoo
|
|
Additive Number Problem |
Medium
|
epic-systems
|
|
Check If a String Can Break Another String Problem |
Medium
|
|
|
Check if One String Swap Can Make Strings Equal |
Easy
|
|
|
Custom Sort String Problem |
Medium
|
amazon
facebook
google
uber
|
|
Delete and Earn Problem |
Medium
|
akuna-capital
pocket-gems
uber
|
|
Determine if Two Strings Are Close Problem |
Medium
|
|
|
Edit Distance - Insert, Delete, no replace |
|
|
|
Find Longest Awesome Substring Problem |
Hard
|
|
|
Friend Words - One Edit Distance |
Medium
|
amazon
facebook
google
microsoft
snapchat
twitter
uber
|
|
Largest Odd Number in String Problem |
Easy
|
|
|
Largest Substring Between Two Equal Characters Problem |
Easy
|
|
|
Longest Common Subsequence LCS of Three Sequences |
Hard
|
youtube
|
|
Longest Duplicate Substring Problem |
Hard
|
amazon
apple
google
microsoft
oracle
|
|
Longest Happy Prefix Problem |
Hard
|
google
|
|
Minimum Number of Removals to Make Mountain Array Problem |
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 |
|
|
|
Balanced Binary Tree Problem |
Easy
|
adobe
amazon
apple
bloomberg
bytedance
cisco
facebook
google
microsoft
|
|
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
|
|
Binary Tree Upside Down |
Medium
|
google
linkedin
|
|
Boyer-Moore String Searching |
|
|
|
Buddy Strings Problem |
Easy
|
google
|
|
Calculate the Binomial Coefficient |
|
|
|
Calculating the mean and median of an unsorted array |
|
uber
|
|
Check if Move is Legal Problem |
Medium
|
|
|
Check if Word Equals Summation of Two Words Problem |
Easy
|
|
|
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 |
|
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 Problem |
Hard
|
amazon
google
|
|