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)

  1. 01

    Visual solutionLeetCode
  2. 02

    Visual solutionLeetCode
  3. 03

    Visual solutionLeetCode
  4. 04

    Visual solutionLeetCode
  5. 05

    Maximum Subarray

    Kadane's algorithm

    Visual solutionLeetCode
  6. 06

    Visual solutionLeetCode
  7. 07

    Visual solutionLeetCode
  8. 08

    Visual solutionLeetCode
  9. 09

    Visual solutionLeetCode
  10. 10

    Visual solutionLeetCode

Binary (5)

  1. 11

    Visual solutionLeetCode
  2. 12

    Visual solutionLeetCode
  3. 13

    Visual solutionLeetCode
  4. 14

    Visual solutionLeetCode
  5. 15

    Visual solutionLeetCode

Dynamic Programming (11)

  1. 16

    Visual solutionLeetCode
  2. 17

    Visual solutionLeetCode
  3. 18

    Visual solutionLeetCode
  4. 19

    Visual solutionLeetCode
  5. 20

    Visual solutionLeetCode
  6. 21

    Visual solutionLeetCode
  7. 22

    Visual solutionLeetCode
  8. 23

    Visual solutionLeetCode
  9. 24

    Visual solutionLeetCode
  10. 25

    Visual solutionLeetCode
  11. 26

    Visual solutionLeetCode

Graph (8)

  1. 27

    Visual solutionLeetCode
  2. 28

    Visual solutionLeetCode
  3. 29

    Visual solutionLeetCode
  4. 30

    Visual solutionLeetCode
  5. 31

    Visual solutionLeetCode
  6. 32

    Visual solutionLeetCode
  7. 33

    Visual solutionLeetCode
  8. 34

    Visual solutionLeetCode

Interval (5)

  1. 35

    Visual solutionLeetCode
  2. 36

    Visual solutionLeetCode
  3. 37

    Visual solutionLeetCode
  4. 38

    Visual solutionLeetCode
  5. 39

    Visual solutionLeetCode

Linked List (6)

  1. 40

    Visual solutionLeetCode
  2. 41

    Visual solutionLeetCode
  3. 42

    Visual solutionLeetCode
  4. 43

    Visual solutionLeetCode
  5. 44

    Visual solutionLeetCode
  6. 45

    Visual solutionLeetCode

Matrix (4)

  1. 46

    Visual solutionLeetCode
  2. 47

    Visual solutionLeetCode
  3. 48

    Visual solutionLeetCode
  4. 49

    Visual solutionLeetCode

String (10)

  1. 50

    Visual solutionLeetCode
  2. 51

    Visual solutionLeetCode
  3. 52

    Visual solutionLeetCode
  4. 53

    Visual solutionLeetCode
  5. 54

    Visual solutionLeetCode
  6. 55

    Visual solutionLeetCode
  7. 56

    Visual solutionLeetCode
  8. 57

    Visual solutionLeetCode
  9. 58

    Visual solutionLeetCode
  10. 59

    Visual solutionLeetCode

Tree (14)

  1. 60

    Visual solutionLeetCode
  2. 61

    Visual solutionLeetCode
  3. 62

    Visual solutionLeetCode
  4. 63

    Visual solutionLeetCode
  5. 64

    Visual solutionLeetCode
  6. 65

    Visual solutionLeetCode
  7. 66

    Visual solutionLeetCode
  8. 67

    Visual solutionLeetCode
  9. 68

    Visual solutionLeetCode
  10. 69

    Visual solutionLeetCode
  11. 70

    Lowest Common Ancestor of a BST

    via the binary tree version (LeetCode 236), which also solves the BST case

    Visual solutionLeetCode
  12. 71

    Visual solutionLeetCode
  13. 72

    Visual solutionLeetCode
  14. 73

    Visual solutionLeetCode

Heap (2)

  1. 74

    Visual solutionLeetCode
  2. 75

    Visual solutionLeetCode