| Freedom Trail Problem |
Hard
|
google
|
|
| Stone Game 2 Problem |
Medium
|
bytedancetoutiao
google
|
|
| Generate nth ugly number |
Medium
|
amazon
oracle
uber
|
|
| House Robber 2 - Houses in circle |
Medium
|
amazon
ebay
google
microsoft
|
|
| Palindrome Partitioning Problem |
Medium
|
adobe
amazon
bloomberg
google
microsoft
qualtrics
uber
yahoo
|
|
| Maximum Profit in Job Scheduling |
Hard
|
airbnb
bytedance
cisco
google
ponyai
|
|
| Find duplicate elements in the array with 4KB memory only |
|
|
|
| Design a data structure for generic deck of cards |
|
|
|
| Design data structures for an online book reader system |
|
|
|
| Design the classes and data structures for a call center |
|
|
|
| Boats to Save People |
Medium
|
amazon
factset
google
|
|
| Find Second largest element in an array |
Easy
|
|
|
| Find duplicate number in array containing n+1 numbers between 1 and n |
Medium
|
adobe
amazon
apple
bloomberg
ebay
facebook
google
intuit
microsoft
oracle
salesforce
tencent
vmware
|
|
| Kadane's Algorithm for Maximum Subarray Sum |
|
|
|
| Candy distribution Problem |
Hard
|
amazon
apple
google
microsoft
salesforce
uber
|
|
| Binary Tree DFS Traversal |
|
|
|
| Binary Tree Level Order Traversal |
|
microsoft
|
|
| Binary Tree Level Order Traversal - Level by Level |
Medium
|
adobe
amazon
apple
atlassian
bloomberg
cisco
citadel
ebay
expedia
facebook
google
linkedin
mathworks
microsoft
oracle
sap
uber
vmware
yahoo
|
|
| Find Deepest Node in a Binary Tree |
Easy
|
google
uber
|
|
| XOR doubly linked list Implementation |
|
google
|
|
| Binary Search Algo 13 - on a linked list |
|
|
|
| Merge Two Sorted Linked Lists |
Easy
|
adobe
airbnb
alibaba
amazon
apple
arista-networks
atlassian
bloomberg
bytedance
capital-one
cisco
ebay
facebook
google
huawei
indeed
intel
linkedin
lyft
microsoft
oracle
paypal
samsung
tencent
uber
visa
vmware
yahoo
yandex
|
|
| Stack of plates |
|
|
|
| Evaluate Reverse Polish Notation |
Medium
|
amazon
atlassian
facebook
google
jane-street
linkedin
microsoft
opendoor
oracle
uber
vmware
yandex
zillow
|
|
| Linked List Cycle 3 - Find length of cycle |
|
|
|
| Reverse Words in a String |
Medium
|
amazon
apple
bloomberg
cisco
citadel
facebook
google
huawei
microsoft
nvidia
oracle
qualcomm
salesforce
snapchat
vmware
yelp
zillow
|
|
| Longest Palindromic Substring |
Medium
|
adobe
airbnb
alibaba
amazon
appdynamics
apple
bloomberg
cisco
ebay
facebook
godaddy
google
huawei
jpmorgan
mathworks
microsoft
nutanix
oracle
paypal
pure-storage
roblox
samsung
sap
servicenow
tencent
uber
vmware
wayfair
yahoo
yandex
|
|
| Subsets 1 |
Medium
|
adobe
amazon
apple
atlassian
bloomberg
bytedance
coupang
ebay
facebook
goldman-sachs
google
lyft
microsoft
uber
yahoo
|
|
| Is Subsequence Problem |
Easy
|
amazon
bloomberg
coursera
facebook
google
pinterest
|
|
| Maximum Number of Removable Characters Problem |
Medium
|
|
|
| Subarrays vs Subsequences vs Subsets Definition |
|
|
|
| Convert String to Integer atoi Problem |
Medium
|
adobe
amazon
apple
bloomberg
cisco
citadel
ebay
facebook
goldman-sachs
google
linkedin
microsoft
nvidia
oracle
redfin
sap
tencent
uber
vmware
zillow
|
|
| Check if a Matrix is Invertible |
|
|
|
| Print all subarrays of a given array |
|
|
|
| Sum of all subarrays |
|
|
|
| Finding the most frequent element in an array of numbers from 0 to n-1 |
|
|
|
| Find first duplicate number in an array containing numbers from 1 to n |
|
|
|
| Find duplicates in an array of integers within range 0 to n-1 |
|
|
|
| Majority Element 2 - With n by 3 definition |
Medium
|
adobe
amazon
apple
bloomberg
facebook
google
microsoft
uber
zenefits
|
|
| Majority Element 1 - with n by 2 definition |
Easy
|
facebook
google
microsoft
yahoo
|
|
| Check if Array is Consecutive Integers |
|
|
|
| Check if Array is Consecutive Positive Integers |
|
|
|
| Contains Duplicate 1 - Check if array has duplicates |
Easy
|
adobe
airbnb
amazon
apple
bloomberg
facebook
microsoft
oracle
palantir-technologies
yahoo
|
|
| Find element which appears maximum number of times in the ranged array |
|
|
|
| Find most frequent element in the array |
|
|
|
| Find local minima in a given array |
|
|
|
| Find local minimum or maximum in O(1) time in an array with elements differing by plus minus 1 |
|
|
|
| Find the smallest integer that cannot be represented as sum of any subset of sorted array |
|
|
|
| Count the number of elements from one array less than or equal to elements in another array |
|
amazon
|
|
| Find duplicates in a given array |
|
|
|