| Find Words Containing Character |
Easy
|
|
|
| Find the Maximum Sum of Node Values |
Hard
|
|
|
| Print all unique substrings of a given string |
|
|
|
| Print all substrings of a given string |
Easy
|
|
|
| 0-1 Knapsack Problem |
Medium
|
|
|
| Airplane Seat Assignment Probability |
Medium
|
microstrategy
|
|
| Array With Elements Not Equal to Average of Neighbors |
Medium
|
|
|
| Breaking an integer into the sum of pairwise distinct positive integers |
Medium
|
|
|
| Button with Longest Push Time |
Easy
|
|
|
| Car Refuelling Algorithm |
Medium
|
|
|
| Celebration Party |
|
|
|
| Cellphone base covering |
|
|
|
| Check if a string contains an anagram of another string |
|
|
|
| Circus tower sorting |
|
|
|
| Climbing Stairs - At most m steps |
Medium
|
|
|
| Coin Change - Count Number of Ways of representing Amount given Finite supply of denominations |
|
|
|
| Coin Change with Fewest Number of Coins Given Finite Supply |
|
|
|
| Count All Valid Pickup and Delivery Options |
Hard
|
doordash
|
|
| Count Different Palindromic Subsequences |
Hard
|
facebook
google
linkedin
pure-storage
|
|
| Count number of ways to fill an n x 4 grid using 1 x 4 tiles |
Easy
|
|
|
| Count Numbers with Unique Digits |
Medium
|
google
|
|
| Count Sorted Vowel Strings |
Medium
|
|
|
| Decode a string to all valid interpretations |
Medium
|
uber
|
|
| 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 no of reverse pairs in an array which is sorted in two parts |
Medium
|
|
|
| Flatten 2D Vector |
Medium
|
airbnb
apple
facebook
google
lyft
salesforce
twitter
uber
zenefits
|
|
| Fractional knapsack problem |
|
|
|
| Frog Jump |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
nutanix
oracle
snapchat
|
|
| Frog Jump II |
Medium
|
|
|
| Furthest Building You Can Reach |
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
|
|
|
| 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 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
|
|
|
| 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 |
|
|
|
| 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
|
|