| Minimum Number of Refueling Stops | Hard | amazon
baidu
google
microsoft | |
| Number of Submatrices That Sum to Target | Hard | amazon
google | |
| Number of Ways of Cutting a Pizza | Hard | google | |
| Number of Ways to Paint N × 3 Grid | Hard | akuna-capital
facebook | |
| Out of Boundary Paths | Medium | baidu | |
| Stone Game 2 | Medium | bytedancetoutiao
google | |
| Where Will the Ball Fall | Medium | | |
| Bitwise ORs of Subarrays | Medium | | |
| Generate nth ugly number | Medium | amazon
oracle
uber
google | |
| Can I Win | Medium | google
linkedin | |
| Maximum Number of Achievable Transfer Requests | Hard | | |
| Ones and Zeroes | Medium | google | |
| Profitable Schemes | Hard | google
linkedin | |
| Reducing Dishes | Hard | | |
| House Robber 2 - Houses in circle | Medium | amazon
ebay
google
microsoft | |
| Palindrome Partitioning | Medium | adobe
amazon
bloomberg
google
microsoft
qualtrics
uber
yahoo | |
| Concatenated Words | Hard | amazon
apple
audible
facebook
google
microsoft | |
| Maximum Profit in Job Scheduling | Hard | airbnb
bytedance
cisco
google
ponyai | |
| Number of Ways to Form a Target String Given a Dictionary | Hard | | |
| Number of Ways to Reorder Array to Get Same BST | Hard | | |
| Decode Ways II | Hard | facebook
google | |
| Minimum Cost For Tickets | Medium | amazon
facebook
google
grab
uber | |
| Find duplicate elements in the array with 4KB memory only | Medium | | |
| Boats to Save People | Medium | amazon
factset
google
glassdoor | |
| 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 | Medium | | |
| Longest Valid Parentheses | Hard | adobe
amazon
apple
bloomberg
citadel
ebay
facebook
google
microsoft
oracle
samsung
uber
yahoo | |
| Candy distribution | Hard | amazon
apple
google
microsoft
salesforce
uber
atlassian | |
| 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 | | google | |
| Binary Search on a linked list | Medium | | |
| 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 | Medium | microsoft
amazon | |
| 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 | Medium | | |
| 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 | Easy | amazon
bloomberg
coursera
facebook
google
pinterest | |
| Maximum Number of Removable Characters Problem | Medium | | |
| Subarrays vs Subsequences vs Subsets Definition | Easy | | |
| Convert String to Integer atoi | 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 | Medium | | |
| Print all subarrays of a given array | Easy | | |
| Sum of all subarrays | Medium | | |
| Finding the most frequent element in an array of numbers from 0 to n-1 | Medium | | |
| Find first duplicate number in an array containing numbers from 1 to n | Medium | | |