| Find Pivot Index |
Easy
|
amazon
apple
bloomberg
citadel
coupang
expedia
facebook
godaddy
goldman-sachs
google
indeed
microsoft
radius
salesforce
tesla
|
|
| Path Sum 1 - Check if root to leaf path exists |
Easy
|
adobe
amazon
apple
bloomberg
facebook
microsoft
oracle
zillow
|
|
| Power of Four Problem |
Easy
|
two-sigma
|
|
| Explain (n & (n-1)) == 0 |
|
|
|
| Power of Two Problem |
Easy
|
amazon
apple
google
microsoft
nvidia
|
|
| x&(x-1) Explained |
|
|
|
| Calculate Rolling Hashcode for String |
|
|
|
| Optimized Brute Force String Search Algorithm |
|
|
|
| Naive Brute Force String Search Algorithm |
|
|
|
| Can Place Flowers Problem |
Easy
|
amazon
cisco
facebook
google
linkedin
yahoo
|
|
| Remove duplicates from Sorted List 2 |
Medium
|
adobe
amazon
apple
bloomberg
google
microsoft
paypal
salesforce
|
|
| Isomorphic Strings |
Easy
|
adobe
amazon
bloomberg
facebook
google
linkedin
microsoft
oracle
salesforce
yahoo
yelp
|
|
| Kth Largest Element in a Stream |
Easy
|
adobe
amazon
apple
bloomberg
ebay
facebook
google
microsoft
nutanix
|
|
| Number of 1 Bits |
Easy
|
adobe
amazon
apple
box
cisco
facebook
google
microsoft
qualcomm
|
|
| Valid Palindrome 2 Problem |
Easy
|
atlassian
facebook
google
microsoft
yahoo
|
|
| Min Cost Climbing Stairs |
Easy
|
amazon
bloomberg
google
yahoo
|
|
| Unique Email Addresses Problem |
Easy
|
adobe
amazon
facebook
google
microsoft
|
|
| Length of Last Word |
Easy
|
amazon
|
|
| Search Insert Position in sorted array |
Easy
|
adobe
amazon
apple
bloomberg
google
microsoft
sap
|
|
| Remove Linked List Elements Problem |
Easy
|
adobe
amazon
apple
bloomberg
capital-one
facebook
google
microsoft
paypal
pure-storage
uber
|
|
| Min Stack |
Medium
|
adobe
amazon
apple
bloomberg
ebay
facebook
flipkart
goldman-sachs
google
groupon
intuit
linkedin
lyft
microsoft
morgan-stanley
netflix
oracle
pure-storage
servicenow
snapchat
uber
visa
wish
zenefits
|
|
| Happy Number |
Easy
|
adobe
airbnb
amazon
apple
bloomberg
ebay
evernote
facebook
google
jpmorgan
microsoft
nutanix
pinterest
pure-storage
twitter
uber
|
|
| Lowest Common Ancestor of a Binary Tree 4 - for array of nodes |
Medium
|
|
|
| Lowest Common Ancestor Definition |
|
|
|
| Lowest Common Ancestor of a Binary Tree 3 - Given Parent Pointer |
Medium
|
facebook
twitter
|
|
| Lowest Common Ancestor for a n-ary Tree |
Medium
|
amazon
|
|
| Lowest Common Ancestor of a Binary Tree 2 - Nodes may not exist in Tree |
Medium
|
|
|
| Replace Elements with Greatest Element on Right Side |
Easy
|
amazon
|
|
| Invert Binary Tree |
Easy
|
amazon
apple
bloomberg
facebook
google
microsoft
salesforce
vmware
|
|
| First Unique Character in a String |
Easy
|
adobe
amazon
apple
bloomberg
facebook
goldman-sachs
google
huawei
jpmorgan
linkedin
microsoft
servicenow
yahoo
zillow
zulily
|
|
| Substring with Concatenation of All Words |
Hard
|
adobe
amazon
apple
bloomberg
dropbox
facebook
google
microsoft
|
|
| Merge Two Binary Trees |
Easy
|
adobe
amazon
apple
bloomberg
facebook
huawei
oracle
|
|
| Palindrome Linked List Problem |
Easy
|
adobe
amazon
apple
bloomberg
cisco
facebook
google
grab
intel
ixl
microsoft
nutanix
snapchat
vmware
|
|
| Climbing Stairs - Take atmost 3 steps |
Easy
|
|
|
| Intersection of Two Sorted Array |
|
|
|
| Swap two number in place without temporary variables |
|
|
|
| Swap Kth node from beginning with Kth node from end in a Linked List |
Medium
|
|
|
| Subarray with sum divisible by k |
|
|
|
| Second largest element in binary search tree |
|
dropbox
|
|
| Replace all occurrences of a pattern in a text by another string |
|
|
|
| Reverse a stack in place using recursion |
|
|
|
| Reverse the given Array without using built in function |
|
|
|
| Reverse a string in C using as little additional memory as possible |
|
|
|
| Print all sub sequences of a given array |
|
|
|
| Number of elements less than or equal to a given number in a given subarray |
Medium
|
|
|
| Minimum Number of Deletions Of a String |
|
|
|
| Minimum Distance Between Two Elements in an Array |
Easy
|
|
|
| Merge K Sorted Arrays |
|
|
|
| Maximum Product of Three Numbers |
Easy
|
amazon
apple
bloomberg
cisco
citadel
coursera
facebook
goldman-sachs
intuit
redfin
symantec
|
|
| Maximum Pairwise Product 2 - Find pair with maximum product in array of Integers |
|
|
|