| URL Query Strings |
|
|
|
| Minimum Absolute Difference in BST Problem |
Easy
|
amazon
apple
google
|
|
| Sort a Linked List |
Medium
|
adobe
amazon
bytedance
facebook
google
microsoft
|
|
| Find ceiling of target element in a sorted array |
|
|
|
| Merge Sort Algorithm |
|
|
|
| Find increasing triplet subsequence |
|
|
|
| Dutch National Flag DNF |
Medium
|
amazon
apple
bloomberg
ebay
facebook
google
linkedin
microsoft
oracle
paypal
pocket-gems
pure-storage
uber
vmware
yahoo
|
|
| Longest Increasing Subsequence LIS |
Medium
|
adobe
amazon
apple
atlassian
ebay
facebook
google
microsoft
oracle
salesforce
uber
vmware
|
|
| Count Number of Leaf Nodes in Binary Tree |
|
|
|
| Kth Smallest Element Using Randomized Selection |
Medium
|
|
|
| Sliding Window Maximum |
Hard
|
adobe
alibaba
amazon
apple
bloomberg
bytedance
citadel
coursera
databricks
facebook
google
lyft
microsoft
nutanix
oracle
pinterest
roblox
twitter
uber
vmware
wish
yelp
zenefits
|
|
| Convert an infix expression to postfix problem |
|
|
|
| Longest Common Substring |
|
|
|
| Morris-Pratt String Searching |
|
|
|
| Unique BSTs 1 - Count |
Medium
|
adobe
amazon
apple
bloomberg
expedia
facebook
google
microsoft
snapchat
wish
|
|
| Perfect number Problem |
Easy
|
amazon
fallible
|
|
| Check if Array Contains All Elements Of Some Given Range |
|
|
|
| Container With Most Water |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
facebook
goldman-sachs
google
lyft
microsoft
oracle
uber
vmware
yahoo
|
|
| Count Complete Tree Nodes |
Easy
|
amazon
bloomberg
bytedance
facebook
google
microsoft
yahoo
|
|
| Counting Bits |
Easy
|
amazon
apple
bloomberg
facebook
mathworks
microsoft
uber
|
|
| Find GCD of two numbers |
|
|
|
| Jump Game 1 - Check if it reaches last index |
Medium
|
adobe
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
nutanix
oracle
postmates
uber
vmware
|
|
| Longest Common Subsequence LCS 1 - Get Length |
Medium
|
amazon
bytedance
facebook
google
indeed
microsoft
tencent
|
|
| Longest Common Subsequence LCS 2 - Get Subsequence |
Medium
|
|
|
| Lowest Common Ancestor of a Binary Tree |
Medium
|
adobe
airbnb
amazon
apple
atlassian
bloomberg
bytedance
ebay
facebook
google
intuit
linkedin
microsoft
oracle
paypal
pinterest
salesforce
splunk
uber
visa
yahoo
zillow
|
|
| Pascal’s Triangle 1 - Generate first n rows |
Easy
|
adobe
amazon
apple
bloomberg
facebook
goldman-sachs
google
microsoft
twitter
uber
|
|
| Rearrange positive and negative numbers in an array without changing their order |
|
|
|
| Search in a Binary Search Tree |
Easy
|
adobe
apple
google
ibm
|
|
| Sieve of Eratosthenes Algorithm |
|
|
|
| Skyline Problem |
Hard
|
adobe
amazon
apple
databricks
facebook
goldman-sachs
google
houzz
microsoft
salesforce
tableau
twitter
uber
yelp
|
|
| Split Linked List in alternating way |
|
|
|
| Stock Span Problem |
Medium
|
|
|
| Tower of Hanoi |
|
|
|
| Transpose of a Matrix |
Easy
|
apple
microsoft
servicenow
|
|
| Unique Paths in Grid - Count all paths moving right or down or diagonally |
|
|
|
| Unique Paths in Grid 2-2 - Get all paths moving right or down with obstacles |
|
|
|
| Unique Paths in Grid 2-3 - Get all paths moving in 4 directions with obstacles |
|
|
|
| Word Ladder 1 - Get Ladder Length |
Hard
|
affirm
amazon
apple
audible
bloomberg
cohesity
expedia
facebook
google
linkedin
lyft
microsoft
oracle
pinterest
qualtrics
salesforce
samsung
servicenow
snapchat
spotify
square
tesla
uber
vmware
yelp
zillow
|
|
| Binary Tree Inorder Traversal |
Easy
|
alibaba
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
oracle
sap
uber
|
|
| Binary Tree Postorder Traversal |
Easy
|
adobe
amazon
facebook
google
uber
|
|
| Binary Tree Top View |
Medium
|
|
|
| Count Univalue Subtrees Problem |
Medium
|
amazon
bloomberg
box
ebay
facebook
google
|
|
| Generate Parentheses Problem |
Medium
|
adobe
alibaba
amazon
apple
atlassian
bloomberg
bytedance
cisco
facebook
google
lyft
microsoft
nutanix
nvidia
salesforce
samsung
sap
snapchat
spotify
uber
yahoo
yandex
yelp
zenefits
|
|
| Inorder Successor in Binary Search Tree |
Medium
|
amazon
bloomberg
citadel
facebook
google
microsoft
palantir-technologies
pocket-gems
quip
zillow
|
|
| Inorder Successor in Binary Search Tree Using Parent link |
Medium
|
bloomberg
google
microsoft
quip
|
|
| Unique Paths in Grid 1 - Count all paths moving right or down |
Medium
|
adobe
alibaba
amazon
apple
bloomberg
facebook
goldman-sachs
google
mathworks
microsoft
oracle
snapchat
uber
vmware
|
|
| Valid Parentheses |
Easy
|
adobe
airbnb
akuna-capital
amazon
apple
atlassian
audible
barclays
blizzard
bloomberg
cisco
citadel
doordash
ebay
epic-systems
expedia
facebook
godaddy
goldman-sachs
google
ibm
intel
intuit
jpmorgan
linkedin
liveramp
lyft
mathworks
microsoft
morgan-stanley
oracle
paypal
postmates
riot-games
salesforce
samsung
sap
servicenow
splunk
spotify
tencent
tesla
triplebyte
twilio
twitter
uber
visa
vmware
yahoo
yandex
zenefits
zillow
|
|
| What happens when you type an URL in the browser and press enter |
|
|
|
| Kth largest element in Binary Search Tree |
Medium
|
|
|
| Last Stone Weight Problem |
Easy
|
amazon
google
|
|