All DSA Sheets

    Blind 75 Sheet

    Customize study plans according to your needs. You are recommended to work on the questions in order.

    Questions Summary

    We have selected these 75 problems. It should take around 31 hours for an average person to solve these problems.

    difficulty

    Questions grouped by difficulty

    Easy: 20
    Medium: 48
    Hard: 7

    topics

    Questions grouped by topics

    Array: 13
    Stack: 1
    Linked List: 5
    String: 9
    Binary Tree: 9
    Binary Search Tree: 2
    Dynamic Programming: 11
    Binary: 4
    Graph: 9
    Trie: 3
    Binary Search: 2
    Matrix: 3
    Heap: 3
    Math: 1

    Completed 0 / 75

    You can now bookmark the page to save your preferences! We also recently changed the questions presentation settings.

    1
    Two Sum
    easy
    ·
    15 mins
    ·
    Array
    2
    Valid Parentheses
    easy
    ·
    20 mins
    ·
    Stack
    3
    Merge Two Sorted Lists
    easy
    ·
    20 mins
    ·
    Linked List
    4
    5
    Valid Palindrome
    easy
    ·
    15 mins
    ·
    String
    6
    Invert Binary Tree
    easy
    ·
    15 mins
    ·
    Binary Tree
    7
    Valid Anagram
    easy
    ·
    15 mins
    ·
    String
    8
    Lowest Common Ancestor of a Binary Search Tree
    easy
    ·
    20 mins
    ·
    Binary Search Tree
    9
    Linked List Cycle
    easy
    ·
    20 mins
    ·
    Linked List
    10
    Climbing Stairs
    easy
    ·
    20 mins
    ·
    Dynamic Programming
    11
    Reverse Linked List
    easy
    ·
    20 mins
    ·
    Linked List
    12
    Maximum Depth of Binary Tree
    easy
    ·
    15 mins
    ·
    Binary Tree
    13
    Contains Duplicate
    easy
    ·
    15 mins
    ·
    Array
    14
    Meeting Rooms
    easy
    ·
    20 mins
    ·
    Array
    15
    Counting Bits
    easy
    ·
    15 mins
    ·
    Binary
    16
    Same Tree
    easy
    ·
    20 mins
    ·
    Binary Tree
    17
    Number of 1 Bits
    easy
    ·
    15 mins
    ·
    Binary
    18
    Missing Number
    easy
    ·
    15 mins
    ·
    Binary
    19
    Reverse Bits
    easy
    ·
    15 mins
    ·
    Binary
    20
    Subtree of Another Tree
    easy
    ·
    20 mins
    ·
    Binary Tree
    21
    Maximum Subarray
    medium
    ·
    20 mins
    ·
    Dynamic Programming
    22
    Insert Interval
    medium
    ·
    25 mins
    ·
    Array
    24
    3Sum
    medium
    ·
    30 mins
    ·
    Array
    25
    Binary Tree Level Order Traversal
    medium
    ·
    20 mins
    ·
    Binary Tree
    26
    Clone Graph
    medium
    ·
    25 mins
    ·
    Graph
    27
    Course Schedule
    medium
    ·
    30 mins
    ·
    Graph
    28
    Implement Trie (Prefix Tree)
    medium
    ·
    35 mins
    ·
    Trie
    29
    Coin Change
    medium
    ·
    25 mins
    ·
    Dynamic Programming
    30
    Product of Array Except Self
    medium
    ·
    30 mins
    ·
    Array
    31
    Validate Binary Search Tree
    medium
    ·
    20 mins
    ·
    Binary Search Tree
    32
    Number of Islands
    medium
    ·
    25 mins
    ·
    Graph
    33
    Search in Rotated Sorted Array
    medium
    ·
    30 mins
    ·
    Binary Search
    34
    Combination Sum
    medium
    ·
    30 mins
    ·
    Array
    35
    Merge Intervals
    medium
    ·
    30 mins
    ·
    Array
    36
    Word Break
    medium
    ·
    30 mins
    ·
    Trie
    37
    Spiral Matrix
    medium
    ·
    25 mins
    ·
    Matrix
    38
    Longest Palindromic Substring
    medium
    ·
    25 mins
    ·
    String
    39
    Unique Paths
    medium
    ·
    20 mins
    ·
    Dynamic Programming
    41
    Container With Most Water
    medium
    ·
    35 mins
    ·
    Array
    42
    Word Search
    medium
    ·
    30 mins
    ·
    Graph
    43
    Kth Smallest Element in a BST
    medium
    ·
    25 mins
    ·
    Binary Tree
    44
    House Robber
    medium
    ·
    25 mins
    ·
    Dynamic Programming
    45
    Group Anagrams
    medium
    ·
    25 mins
    ·
    String
    46
    Maximum Product Subarray
    medium
    ·
    30 mins
    ·
    Dynamic Programming
    48
    Pacific Atlantic Water Flow
    medium
    ·
    30 mins
    ·
    Graph
    49
    Remove Nth Node From End of List
    medium
    ·
    20 mins
    ·
    Linked List
    50
    Longest Increasing Subsequence
    medium
    ·
    30 mins
    ·
    Dynamic Programming
    51
    Graph Valid Tree
    medium
    ·
    30 mins
    ·
    Graph
    52
    Longest Consecutive Sequence
    medium
    ·
    30 mins
    ·
    Array
    54
    Jump Game
    medium
    ·
    20 mins
    ·
    Dynamic Programming
    56
    Rotate Image
    medium
    ·
    25 mins
    ·
    Matrix
    57
    Decode Ways
    medium
    ·
    25 mins
    ·
    Dynamic Programming
    58
    Meeting Rooms II
    medium
    ·
    30 mins
    ·
    Array
    59
    Set Matrix Zeroes
    medium
    ·
    25 mins
    ·
    Matrix
    60
    Reorder List
    medium
    ·
    25 mins
    ·
    Linked List
    61
    Encode and Decode Strings
    medium
    ·
    25 mins
    ·
    String
    62
    Find Minimum in Rotated Sorted Array
    medium
    ·
    30 mins
    ·
    Binary Search
    63
    Non-overlapping Intervals
    medium
    ·
    20 mins
    ·
    Array
    64
    Minimum Window Substring
    hard
    ·
    30 mins
    ·
    String
    65
    Serialize and Deserialize Binary Tree
    hard
    ·
    40 mins
    ·
    Binary Tree
    66
    Find Median from Data Stream
    hard
    ·
    30 mins
    ·
    Heap
    67
    Merge k Sorted Lists
    hard
    ·
    30 mins
    ·
    Heap
    68
    Binary Tree Maximum Path Sum
    hard
    ·
    35 mins
    ·
    Binary Tree
    69
    Word Search II
    hard
    ·
    40 mins
    ·
    Graph
    70
    Alien Dictionary
    hard
    ·
    45 mins
    ·
    Graph
    71
    Longest Common Subsequence
    medium
    ·
    20 mins
    ·
    Dynamic Programming
    72
    Top K Frequent Elements
    medium
    ·
    20 mins
    ·
    Heap
    73
    Sum of Two Integers
    medium
    ·
    20 mins
    ·
    Math
    74
    House Robber II
    medium
    ·
    20 mins
    ·
    Dynamic Programming
    75
    Palindromic Substrings
    medium
    ·
    20 mins
    ·
    String

    Questions Summary

    We have selected these 75 problems. It should take around 31 hours for an average person to solve these problems.

    difficulty

    Questions grouped by difficulty

    Easy: 20
    Medium: 48
    Hard: 7

    topics

    Questions grouped by topics

    Array: 13
    Stack: 1
    Linked List: 5
    String: 9
    Binary Tree: 9
    Binary Search Tree: 2
    Dynamic Programming: 11
    Binary: 4
    Graph: 9
    Trie: 3
    Binary Search: 2
    Matrix: 3
    Heap: 3
    Math: 1