Blind 75 LeetCode Problems, with Visual Solutions
The Blind 75 is a list of 75 LeetCode problems that cover the patterns coding interviews keep returning to. Here it is in its original groups. Every one of the 75 links to a FaangPrep lesson that steps through the solution visually.
Working through it by pattern rather than in list order usually sticks better: see the patterns cheat sheet for a template per pattern, or the DSA 75 sheet, our own pattern-wise list with a visualizer for every problem.
Array (10)
Binary (5)
Dynamic Programming (11)
Graph (8)
Interval (5)
Linked List (6)
Matrix (4)
String (10)
Tree (14)
60
Visual solutionLeetCode61
Visual solutionLeetCode62
Visual solutionLeetCode63
Visual solutionLeetCode64
Visual solutionLeetCode65
Visual solutionLeetCode66
Visual solutionLeetCode67
Visual solutionLeetCode68
Visual solutionLeetCode69
Visual solutionLeetCode70
Lowest Common Ancestor of a BSTvia the binary tree version (LeetCode 236), which also solves the BST case
Visual solutionLeetCode71
Visual solutionLeetCode72
Visual solutionLeetCode73
Visual solutionLeetCode
