Decrypt Word with cumulative ASCII shift |
Easy
|
|
|
Delete Columns to Make Sorted III |
Hard
|
google
|
|
Dice Roll Simulation |
Hard
|
akuna-capital
atlassian
bloomberg
google
|
|
Earliest Possible Day of Full Bloom |
Hard
|
|
|
Find K Pairs with Smallest Sums |
Medium
|
amazon
apple
facebook
google
linkedin
microsoft
uber
|
|
Find largest 1M numbers in 1B numbers |
Hard
|
|
|
Find no of reverse pairs in an array which is sorted in two parts |
Medium
|
|
|
Find the Kth Largest Integer in the Array |
Medium
|
|
|
Find the median in a row-wise sorted 2D matrix |
Medium
|
|
|
Find the Nth Largest Element in a Rotated Sorted Array |
Medium
|
|
|
Flatten 2D Vector |
Medium
|
airbnb
apple
facebook
google
lyft
salesforce
twitter
uber
zenefits
|
|
Fractional knapsack problem |
Medium
|
|
|
Frog Jump |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
nutanix
oracle
snapchat
|
|
Frog Jump II |
Medium
|
|
|
Furthest Building You Can Reach |
Medium
|
|
|
Identify the Largest Outlier in an Array |
Medium
|
|
|
Integer Break |
Medium
|
adobe
apple
google
|
|
Integer Partition Algorithm |
Medium
|
|
|
Job Sequencing Problem _ Set 2 (Using Disjoint Set) |
Medium
|
|
|
Jump Game 7 |
Medium
|
|
|
Karatsuba Fast Multiplication |
Medium
|
|
|
Longest Bitonic Subsequence |
Medium
|
microsoft
|
|
Longest Increasing Path in a Matrix |
Hard
|
adobe
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
snapchat
uber
|
|
Longest increasing subarray |
Medium
|
uber
|
|
Longest Increasing subarray with one change allowed |
Medium
|
|
|
Longest Palindromic Subsequence - Get Subsequence |
Medium
|
|
|
Matrix Chain Multiplication |
Medium
|
|
|
Matrix Chain Multiplication 2 - Print brackets |
Medium
|
|
|
Maximizing Revenue in Online Ad Placement |
Easy
|
|
|
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
Medium
|
|
|
Maximum Erasure Value |
Medium
|
|
|
Maximum Number of Matching Indices After Right Shifts |
Easy
|
|
|
Maximum revenue by selling K tickets from N windows |
Medium
|
bloomberg
|
|
Minimize the Maximum Difference of Pairs |
Medium
|
|
|
Minimum Deletions to Make Character Frequencies Unique |
Medium
|
|
|
Minimum Number of Flips to Make the Binary String Alternating |
Medium
|
|
|
Minimum Switch Presses to Light All Bulbs on Right |
Easy
|
|
|
Nth Smallest Element in Two Sorted Arrays |
Medium
|
|
|
Number of elements greater than K in the range L to R |
Medium
|
|
|
Number of Longest Increasing Subsequence |
Medium
|
amazon
bloomberg
facebook
|
|
Print Expression Tree Graphically |
Medium
|
|
|
Queue Reconstruction by Height |
Medium
|
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
|
|
Reduce Array Size to The Half |
Medium
|
akuna-capital
|
|
Russian Doll Envelopes |
Hard
|
amazon
google
microsoft
|
|
Strassen Matrix Multiplication Algorithm |
Medium
|
|
|
The Number of Weak Characters in the Game |
Medium
|
|
|
Two City Scheduling |
Medium
|
amazon
bloomberg
facebook
google
|
|
Unbounded Knapsack Problem |
Medium
|
|
|
Unique Paths in Grid without crossing main diagonal |
Medium
|
|
|
Wave Sort |
Medium
|
adobe
google
|
|