Skip to content

This github repo serves to educate any wonderer who comes upon this page of essential leetcode questions any programmer ought to know.

License

Notifications You must be signed in to change notification settings

Gyakobo/blind-75-leetcode-list

Repository files navigation

Blind 75 Leetcode List

image image image

image image image image image image image

Warning

This project as of yet is still under heavy development and any contribution is highly appreciated

Author: Andrew Gyakobo

A special thanks to my best friend Ryan Eaton for also contributing to this project!

This github repo serves to educate any wonderer who comes upon this page of the 75 essential leetcode questions any programmer ought to know.

Topics

Array

  • Two Sum - hashmap ⭐
  • Best Time to Buy and Sell Stock - sliding window ⭐
  • Contains Duplicate - set / array ⭐
  • Product of Array Except Self - arithmetic ⭐
  • Maximum Subarray - Kadane's theorem ⭐
  • Maximum Product Subarray - dynamic programming ⭐
  • Find Minimum in Rotated Sorted Array - binary search ⭐
  • Search in Rotated Sorted Array
  • 3 Sum - 3 pointers?
  • Container With Most Water

Binary

  • Sum of Two Integers
  • Number of 1 Bits
  • Counting Bits
  • Missing Number - Gauss Summation ⭐
  • Reverse Bits

Dynamic Programming

  • Climbing Stairs
  • Coin Change
  • Longest Increasing Subsequence
  • Longest Common Subsequence
  • Word Break Problem
  • Combination Sum
  • House Robber
  • House Robber II
  • Decode Ways
  • Unique Paths
  • Jump Game

Graph

  • Clone Graph
  • Course Schedule - DFS and dependency graph ⭐
  • Pacific Atlantic Water Flow
  • Number of Islands
  • Longest Consecutive Sequence
  • Alien Dictionary (Leetcode Premium)
  • Graph Valid Tree (Leetcode Premium)
  • Number of Connected Components in an Undirected Graph (Leetcode Premium)

Interval

  • Insert Interval
  • Merge Intervals
  • Non-overlapping Intervals
  • Meeting Rooms (Leetcode Premium)
  • Meeting Rooms II (Leetcode Premium)

Linked List

  • Reverse a Linked List
  • Detect Cycle in a Linked List
  • Merge Two Sorted Lists
  • Merge K Sorted Lists
  • Remove Nth Node From End Of List
  • Reorder List

Matrix

  • Set Matrix Zeroes
  • Spiral Matrix
  • Rotate Image - Linear calculus, math formula
  • Word Search

String

  • Longest Substring Without Repeating Characters
  • Longest Repeating Character Replacement
  • Minimum Window Substring
  • Valid Anagram - simple counter ⭐
  • Group Anagrams - hashmap ⭐
  • Valid Parentheses - stack ⭐
  • Valid Palindrome - Two pointers or Stack ⭐
  • Longest Palindromic Substring
  • Palindromic Substrings
  • Encode and Decode Strings (Leetcode Premium)

Tree

  • Maximum Depth of Binary Tree
  • Same Tree
  • Invert/Flip Binary Tree
  • Binary Tree Maximum Path Sum
  • Binary Tree Level Order Traversal
  • Serialize and Deserialize Binary Tree
  • Subtree of Another Tree
  • Construct Binary Tree from Preorder and Inorder Traversal
  • Validate Binary Search Tree
  • Kth Smallest Element in a BST
  • Lowest Common Ancestor of BST
  • Implement Trie (Prefix Tree)
  • Add and Search Word
  • Word Search II

Heap

  • Merge K Sorted Lists
  • Top K Frequent Elements
  • Find Median from Data Stream

Note

The following theorem's will be used to solve the aforementioned leetode questions: Boyer-Moore theorem, Gauss's Summation theorem and Kadane's theorem (Maximum Subarray).

License

MIT