| Check if Duplicates Exist Within K Manhattan Distance in Matrix |
Medium
|
|
|
| Check if given undirected graph is connected |
Easy
|
|
|
| Circus tower sorting |
Medium
|
|
|
| Climbing Stairs - At most m steps |
Medium
|
|
|
| Coin Change - Count Number of Ways of representing Amount given Finite supply of denominations |
Medium
|
|
|
| Coin Change with Fewest Number of Coins Given Finite Supply |
Medium
|
|
|
| Coloring a Graph with Maximum Degree D Using D+1 Colors |
Medium
|
|
|
| Construct Quad Tree |
Medium
|
amazon
apple
google
uber
|
|
| Construct Target Array With Multiple Sums |
Hard
|
quora
|
|
| 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 reverse pairs in two individually sorted parts of an array |
Medium
|
|
|
| Count Sorted Vowel Strings |
Medium
|
|
|
| Count The Repetitions |
Hard
|
amazon
|
|
| Count Vowels Permutation |
Hard
|
c3ai
|
|
| Counting roundtrip paths in a graph given a number of steps |
Medium
|
|
|
| Critical Connections in a Network |
Hard
|
adobe
amazon
google
microsoft
mozilla
|
|
| Data Stream as Disjoint Intervals |
Hard
|
amazon
facebook
google
oracle
|
|
| Decode a string to all valid interpretations |
Medium
|
uber
|
|
| Decrypt Word with cumulative ASCII shift |
Easy
|
|
|
| Delete Columns to Make Sorted III |
Hard
|
google
|
|
| Design Snake Game |
Medium
|
amazon
apple
bloomberg
facebook
google
salesforce
uber
zillow
|
|
| Design Twitter (Data Structure Design) |
Medium
|
amazon
doordash
oracle
twitter
yelp
|
|
| Design Underground System |
Medium
|
|
|
| Detect Cycle in Directed Graph |
|
|
|
| Detect Cycle in Undirected Graph |
Easy
|
pandora
|
|
| Determine whether two lines would intersect on a Cartesian plane |
Easy
|
|
|
| Detonate the Maximum Bombs |
Medium
|
|
|
| Dice Roll Simulation |
Hard
|
akuna-capital
atlassian
bloomberg
google
|
|
| Distinct Subsequences II |
Hard
|
google
|
|
| Distribute Repeating Integers |
Hard
|
|
|
| Divide Chocolate |
Hard
|
google
|
|
| Double Stacks |
Easy
|
|
|
| Earliest Possible Day of Full Bloom |
Hard
|
|
|
| Edge-Disjoint Hamiltonian Circuits and the Round Table Seating ProblemShow thinking |
Medium
|
|
|
| Find a line to cut two squares in half |
Easy
|
|
|
| Find a line which passes the most number of points |
|
|
|
| Find All Elements Appearing More Than Size by k Times in Array |
Medium
|
|
|
| Find All Good Strings |
Hard
|
|
|
| Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
Hard
|
amazon
|
|
| Find distinct elements common to all rows of a matrix |
Medium
|
|
|
| Find Even Occurring Element |
Easy
|
|
|
| Find First Index Where Zeros Begin in Binary Array |
Easy
|
|
|
| Find if there is a path between two vertices in a directed graph |
Easy
|
google
facebook
amazon
microsoft
|
|
| Find K Pairs with Smallest Sums |
Medium
|
amazon
apple
facebook
google
linkedin
microsoft
uber
|
|
| Find k Smallest Numbers from a million numbers |
Medium
|
|
|
| Find largest 1M numbers in 1B numbers |
Hard
|
|
|
| Find Largest element in array |
Easy
|
|
|