Customized LeetCode study plans. Grind all 169 questions. This is a gist to help you track your progress.

LeetcodeBlind75.md

Grind 169 Leetcode questions

An updated version of Blind 75

Filters:

• View All Questions
• Order by Difficulty
• Group by Topics

Array

• 1. Two Sum

• 2. Best Time to Buy and Sell Stock

• 3. Majority Element

• 4. Contains Duplicate

• 5. Meeting Rooms

• 6. Move Zeroes

• 7. Squares of a Sorted Array

• 8. Insert Interval

• 9. 3Sum

• 10. Product of Array Except Self

• 11. Combination Sum

• 12. Merge Intervals

• 13. Sort Colors

• 14. Container With Most Water

• 15. Gas Station

• 16. Longest Consecutive Sequence

• 17. Rotate Array

• 18. Contiguous Array

• 19. Subarray Sum Equals K

• 20. Meeting Rooms II

• 21. 3Sum Closest

• 22. Non-overlapping Intervals

• 23. Employee Free Time

• 24. Sliding Window Maximum

---

Stack

• 1. Valid Parentheses

• 2. Implement Queue using Stacks

• 3. Backspace String Compare

• 4. Evaluate Reverse Polish Notation

• 5. Min Stack

• 6. Daily Temperatures

• 7. Decode String

• 8. Asteroid Collision

• 9. Basic Calculator II

• 10. Trapping Rain Water

• 11. Basic Calculator

• 12. Largest Rectangle in Histogram

• 13. Maximum Frequency Stack

• 14. Longest Valid Parentheses

---

Linked List

• 1. Merge Two Sorted Lists

• 2. Linked List Cycle

• 3. Reverse Linked List

• 4. Middle of the Linked List

• 5. Palindrome Linked List

• 6. LRU Cache

• 7. Remove Nth Node From End of List

• 8. Swap Nodes in Pairs

• 9. Odd Even Linked List

• 10. Add Two Numbers

• 11. Sort List

• 12. Reorder List

• 13. Rotate List

• 14. Reverse Nodes in k-Group

---

String

• 1. Valid Palindrome

• 2. Valid Anagram

• 3. Longest Palindrome

• 4. Longest Common Prefix

• 5. Longest Substring Without Repeating Characters

• 6. String to Integer (atoi)

• 7. Longest Palindromic Substring

• 8. Find All Anagrams in a String

• 9. Group Anagrams

• 10. Longest Repeating Character Replacement

• 11. Largest Number

• 12. Encode and Decode Strings

• 13. Minimum Window Substring

• 14. Palindrome Pairs

---

Binary Tree

• 1. Invert Binary Tree

• 2. Balanced Binary Tree

• 3. Diameter of Binary Tree

• 4. Maximum Depth of Binary Tree

• 5. Same Tree

• 6. Symmetric Tree

• 7. Subtree of Another Tree

• 8. Binary Tree Level Order Traversal

• 9. Lowest Common Ancestor of a Binary Tree

• 10. Binary Tree Right Side View

• 11. Construct Binary Tree from Preorder and Inorder Traversal

• 12. Path Sum II

• 13. Maximum Width of Binary Tree

• 14. Binary Tree Zigzag Level Order Traversal

• 15. Path Sum III

• 16. All Nodes Distance K in Binary Tree

• 17. Serialize and Deserialize Binary Tree

• 18. Binary Tree Maximum Path Sum

---

Binary Search

• 1. Binary Search

• 2. First Bad Version

• 3. Search in Rotated Sorted Array

• 4. Time Based Key-Value Store

• 5. Search a 2D Matrix

• 6. Find Minimum in Rotated Sorted Array

• 7. Maximum Profit in Job Scheduling

• 8. Median of Two Sorted Arrays

---

Graph

• 1. Flood Fill

• 2. 01 Matrix

• 3. Clone Graph

• 4. Course Schedule

• 5. Number of Islands

• 6. Rotting Oranges

• 7. Accounts Merge

• 8. Word Search

• 9. Minimum Height Trees

• 10. Pacific Atlantic Water Flow

• 11. Shortest Path to Get Food

• 12. Graph Valid Tree

• 13. Course Schedule II

• 14. Number of Connected Components in an Undirected Graph

• 15. Minimum Knight Moves

• 16. Cheapest Flights Within K Stops

• 17. Word Ladder

• 18. Longest Increasing Path in a Matrix

• 19. Word Search II

• 20. Alien Dictionary

• 21. Bus Routes

---

Binary Search Tree

• 1. Lowest Common Ancestor of a Binary Search Tree

• 2. Convert Sorted Array to Binary Search Tree

• 3. Validate Binary Search Tree

• 4. Kth Smallest Element in a BST

• 5. Inorder Successor in BST

---

Hash Table

• 1. Ransom Note

• 2. Insert Delete GetRandom O(1)

• 3. First Missing Positive

---

Dynamic Programming

• 1. Climbing Stairs

• 2. Maximum Subarray

• 3. Coin Change

• 4. Partition Equal Subset Sum

• 5. Unique Paths

• 6. House Robber

• 7. Maximum Product Subarray

• 8. Longest Increasing Subsequence

• 9. Jump Game

• 10. Maximal Square

• 11. Decode Ways

• 12. Combination Sum IV

---

Binary

• 1. Add Binary

• 2. Counting Bits

• 3. Number of 1 Bits

• 4. Single Number

• 5. Missing Number

• 6. Reverse Bits

• 7. Find the Duplicate Number

---

Math

• 1. Roman to Integer

• 2. Palindrome Number

• 3. Random Pick with Weight

• 4. Pow(x, n)

• 5. Reverse Integer

---

Heap

• 1. K Closest Points to Origin

• 2. Task Scheduler

• 3. Top K Frequent Words

• 4. Find K Closest Elements

• 5. Kth Largest Element in an Array

• 6. Find Median from Data Stream

• 7. Merge k Sorted Lists

• 8. Smallest Range Covering Elements from K Lists

---

Trie

• 1. Implement Trie (Prefix Tree)

• 2. Word Break

• 3. Design Add and Search Words Data Structure

• 4. Design In-Memory File System

---

Recursion

• 1. Permutations

• 2. Subsets

• 3. Letter Combinations of a Phone Number

• 4. Next Permutation

• 5. Generate Parentheses

• 6. N-Queens

---

Matrix

• 1. Spiral Matrix

• 2. Valid Sudoku

• 3. Rotate Image

• 4. Set Matrix Zeroes

• 5. Sudoku Solver

---

Queue

• 1. Design Hit Counter

Important Link:

14 Patterns to Ace Any Coding Interview Question