Prune Unary nodes to form Full Binary Tree |
Medium
|
yahoo
|
|
External Sorting of integers |
Medium
|
amazon
|
|
Three-Word Additive Cryptarithmetic Solver |
Medium
|
google
|
|
Check if words chain to form a circle |
Medium
|
dropbox
|
|
Prime Generator |
Medium
|
|
|
Minimum and Maximum in an array with Optimal Comparisons |
Medium
|
facebook
|
|
Point in Polygon |
Medium
|
nvidia
|
|
Minimum Insertion OR Deletion Steps to Make a String Palindrome |
Medium
|
|
|
Minimum Deletion Steps to Make a String Palindrome |
Medium
|
|
|
Closest Equal Element Queries |
Medium
|
|
|
Choose K Elements With Maximum Sum |
Medium
|
|
|
Count Beautiful Splits in an Array |
Medium
|
|
|
Count Cells in Overlapping Horizontal and Vertical Substrings |
Medium
|
|
|
Count Covered Buildings |
Medium
|
|
|
Count Mentions Per User |
Medium
|
|
|
Count Paths With the Given XOR Value |
Medium
|
|
|
Count Special Subsequences |
Medium
|
|
|
Design Spreadsheet |
Medium
|
|
|
Design Task Manager |
Medium
|
|
|
Digit Operations to Make Two Integers Equal |
Medium
|
|
|
DNA Pattern Recognition |
Medium
|
|
|
Eat Pizzas! |
Medium
|
|
|
Equal Sum Grid Partition I |
Medium
|
|
|
Fill a Special Grid |
Medium
|
|
|
Find Minimum Cost to Remove Array Elements |
Medium
|
|
|
Find Mirror Score of a String |
Medium
|
|
|
Find Product Recommendation Pairs |
Medium
|
|
|
Find Students Who Improved |
Medium
|
|
|
Find the Minimum Amount of Time to Brew Potions |
Medium
|
|
|
Find the Most Common Response |
Medium
|
|
|
Find the Number of Copy Arrays |
Medium
|
|
|
Find X Value of Array I |
Medium
|
|
|
Fruits Into Baskets III |
Medium
|
|
|
Implement Router |
Medium
|
|
|
Longest Palindrome After Substring Concatenation I |
Medium
|
|
|
Longest Palindromic Subsequence After at Most K Operations |
Medium
|
|
|
Longest Subsequence With Decreasing Adjacent Difference |
Medium
|
|
|
Make Array Non-decreasing |
Medium
|
|
|
Maximize Active Section with Trade I |
Medium
|
|
|
Maximize Amount After Two Days of Conversions |
Medium
|
|
|
Maximum Amount of Money Robot Can Earn |
Medium
|
|
|
Maximum and Minimum Sums of at Most Size K Subsequences |
Medium
|
|
|
Maximum Area Rectangle With Point Constraints I |
Medium
|
|
|
Maximum Coins From K Consecutive Bags |
Medium
|
|
|
Maximum Frequency After Subarray Operation |
Medium
|
|
|
Maximum Number of Distinct Elements After Operations |
Medium
|
|
|
Maximum Subarray Sum With Length Divisible by K |
Medium
|
|
|
Maximum Sum With at Most K Elements |
Medium
|
|
|
Maximum Weighted K-Edge Path |
Medium
|
|
|
Minimize the Maximum Edge Weight of Graph |
Medium
|
|
|