Prune Unary nodes to form Full Binary Tree |
Medium
|
yahoo
|
|
Egyptian Fraction |
Easy
|
palantir
|
|
External Sorting of integers |
Medium
|
amazon
|
|
Three-Word Additive Cryptarithmetic Solver |
Medium
|
google
|
|
Check if words chain to form a circle |
Medium
|
dropbox
|
|
Infinite Prime Generator |
Medium
|
|
|
Maximum of Two Numbers Without Conditionals |
Hard
|
nvidia
|
|
Maximum Weight Spanning Tree |
Hard
|
microsoft
|
|
Minimum and Maximum in an array with Optimal Comparisons |
Medium
|
facebook
|
|
Point in Polygon |
Medium
|
nvidia
|
|
Symmetric N-ary Tree Detection |
Easy
|
amazon
|
|
Blackjack Optimal Strategy with Known Card Sequence |
Hard
|
MIT
|
|
Custom Sort String |
Medium
|
amazon
facebook
google
uber
|
|
Find All Conflicting Appointments |
Easy
|
|
|
Maximum flow and bipartite matching |
Hard
|
|
|
Remove a vertex and all connected edges from a graph |
Easy
|
|
|
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
|
|
|
Check If Digits Are Equal in String After Operations I |
Easy
|
|
|
Check If Digits Are Equal in String After Operations II |
Hard
|
|
|
Choose K Elements With Maximum Sum |
Medium
|
|
|
Concatenated Divisibility |
Hard
|
|
|
Count Beautiful Numbers |
Hard
|
|
|
Count Beautiful Splits in an Array |
Medium
|
|
|
Count Cells in Overlapping Horizontal and Vertical Substrings |
Medium
|
|
|
Count Connected Components in LCM Graph |
Hard
|
|
|
Count Covered Buildings |
Medium
|
|
|
Count Mentions Per User |
Medium
|
|
|
Count Non-Decreasing Subarrays After K Operations |
Hard
|
|
|
Count Numbers with Non-Decreasing Digits |
Hard
|
|
|
Count Partitions with Even Sum Difference |
Easy
|
|
|
Count Paths With the Given XOR Value |
Medium
|
|
|
Count Special Subsequences |
Medium
|
|
|
Count Substrings Divisible By Last Digit |
Hard
|
|
|
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
|
|
|
Equal Sum Grid Partition II |
Hard
|
|
|
Fill a Special Grid |
Medium
|
|
|
Find Closest Person |
Easy
|
|
|
Find Followers Count |
Easy
|
|
|
Find Invalid IP Addresses |
Hard
|
|
|
Find Minimum Cost to Remove Array Elements |
Medium
|
|
|
Find Mirror Score of a String |
Medium
|
|
|
Find Most Frequent Vowel and Consonant |
Easy
|
|
|
Find Product Recommendation Pairs |
Medium
|
|
|