Skip to content

Latest commit

 

History

History
112 lines (95 loc) · 7.02 KB

README.md

File metadata and controls

112 lines (95 loc) · 7.02 KB
Raw

Blind-75

Hello, freshers and DSA aspirants!

Do you feel overwhelmed by lots of DSA problems and find it difficult to touch on advanced topics while circling around the basic DSA questions?

Don’t worry; I will teach you a magic spell - The BLIND 75.

Blind 75 is a list of 75 problems that covers almost all the important data structures and algorithms.

Blind 75 is well known among software engineers because of its comprehensive coverage, efficiency, simplicity, and yet power.

These are like math formulae. You have to understand the concepts behind them instead of memorizing them.

All the best for your preparation!

Here’s the Blind 75 list:

Array

  1. Two Sum
  2. Best Time to Buy and Sell Stock
  3. Contains Duplicate
  4. Product of Array Except Self
  5. Maximum Subarray
  6. Maximum Product Subarray
  7. Find Minimum in Rotated Sorted Array
  8. Search in Rotated Sorted Array
  9. 3 Sum
  10. Container With Most Water

Binary

  1. Sum of Two Integers
  2. Number of 1 Bits
  3. Counting Bits
  4. Missing Number
  5. Reverse Bits

Dynamic Programming

  1. Climbing Stairs
  2. Coin Change
  3. Longest Increasing Subsequence
  4. Longest Common Subsequence
  5. Word Break Problem
  6. Combination Sum
  7. House Robber
  8. House Robber II
  9. Decode Ways
  10. Unique Paths
  11. Jump Game

Graph

  1. Clone Graph
  2. Course Schedule
  3. Pacific Atlantic Water Flow
  4. Number of Islands
  5. Longest Consecutive Sequence
  6. Alien Dictionary (Leetcode Premium)
  7. Graph Valid Tree (Leetcode Premium)
  8. Number of Connected Components in an Undirected Graph (Leetcode Premium)

Interval

  1. Insert Interval
  2. Merge Intervals
  3. Non-overlapping Intervals
  4. Meeting Rooms (Leetcode Premium)
  5. Meeting Rooms II (Leetcode Premium)

Linked List

  1. Reverse a Linked List
  2. Detect Cycle in a Linked List
  3. Merge Two Sorted Lists
  4. Merge K Sorted Lists
  5. Remove Nth Node From End Of List
  6. Reorder List

Matrix

  1. Set Matrix Zeroes
  2. Spiral Matrix
  3. Rotate Image
  4. Word Search

String

  1. Longest Substring Without Repeating Characters
  2. Longest Repeating Character Replacement
  3. Minimum Window Substring
  4. Valid Anagram
  5. Group Anagrams
  6. Valid Parentheses
  7. Valid Palindrome
  8. Longest Palindromic Substring
  9. Palindromic Substrings
  10. Encode and Decode Strings (Leetcode Premium)

Tree

  1. Maximum Depth of Binary Tree
  2. Same Tree
  3. Invert/Flip Binary Tree
  4. Binary Tree Maximum Path Sum
  5. Binary Tree Level Order Traversal
  6. Serialize and Deserialize Binary Tree
  7. Subtree of Another Tree
  8. Construct Binary Tree from Preorder and Inorder Traversal
  9. Validate Binary Search Tree
  10. Kth Smallest Element in a BST
  11. Lowest Common Ancestor of BST
  12. Implement Trie (Prefix Tree)
  13. Add and Search Word
  14. Word Search II

Heap

  1. Merge K Sorted Lists
  2. Top K Frequent Elements
  3. Find Median from Data Stream