All Problems

281 problems total

Filter by Difficulty:

Tag:

Company:

Active filters:Tag: daily-coding-problem×
TitleDifficultyVideosCompanies
2-CNF Boolean Satisfiability Problemhard-
8-Puzzle Solverhard-
Alice Joins Probability Student Club by Calculating Expected Values of Probabilistic Gameshard-
Alternating Two-Instance Singleton Patternmedium-
Approximate Median in Sub-linear Timemedium-
Area of intersection of two rectangleseasy-
Autocomplete Suggestion Systemmedium-
Balance Parentheses with Minimum Insertions and Deletionshard-
Bartender Drink Optimizationmedium-
Binary Search Without Multiplication, Division and Bit-shift Operationshard-
Binary Tree Level Order Traversalmedium
Binary Tree Path Sum - Minimum Sum Root to Leaf patheasy-
Bishop diagonally attack on chess boardmedium-
Blackjack Optimal Strategy with Known Card Sequencehard-
Bloom Filter Implementationmedium-
Boolean Parenthesization Problemhard-
Break a string into lines of length k without breaking wordsmedium-
BST Floor and Ceilingeasy-
Buildings with sunset viewmedium-
Busiest period in a buildingeasy-
Capturing Loop Variables in Lambdaseasy-
Check if a graph is minimally-connectedmedium-
Check if any pair of rectangles overlapeasy-
Check if doubly linked list is palindromeeasy-
Check if target word exists in matrix horizontally or verticallyeasy-
Check if words chain to form a circlemedium-
Chess King Check Detectorhard-
Closest leaf to root in a binary treemedium-
Closest pair of pointseasy-
Coin Change with Fewest Number of Coins Given Canonical System and Infinite Supplymedium-
Coins In a Line Gamemedium-
Collatz Sequenceeasy-
Conditional selection between x and y with bitwise operationsmedium-
Construct Binary Search Tree BST from Postorder Traversalmedium-
Construct Cartesian Tree from Sequencehard-
Count elements in range in sorted matrixhard-
Count Inversions - Count Smaller on Rightmedium-
Count Knight's Tourhard-
Count Pairs with Given Sum and XOReasy-
Crossword Grid Validationeasy-
Currency Exchange Problem as Shortest Pathmedium-
De Bruijn Sequencehard-
Describe and give an example of Ad-hoc, Parametric and Subtype polymorphismmedium-
Design a Sparse Arrayeasy-
Design and implement Connect 4hard-
Design hit counter with range querieseasy-
Design log Order recordseasy-
Detect Cycle in Undirected Grapheasy-
Determining the Existence of a Valid Secret Code in Mastermind Based on Given Guesses and Scores Guesses and Scoresmedium-
Distributed Wikipedia Crawler System Designhard-
Showing 1 to 50 of 281 results