Blind75

Description

The repository contains solutions for Blind 75 questions. The questions are taken from NeetCode.

Organization

The questions are organized by the problem type and stored in the corresponding repositories.

1. Arrays & Hashing
   • Contains Duplicate
   • Valid Anagram
   • Two Sum
   • Group Anagrams
   • Top K Frequent Elements
   • Product of Array Except Self
   • Encode and Decode Strings (Locked)
   • Longest Consecutive Sequency
2. Two Pointers
   • Valid Palindrome
   • 3Sum
   • Container With Most Water
3. Sliding Window
   • Best Time to Buy And Sell Stock
   • Longest Substring Without Repeating Characters
   • Longest Repeating Character Replacement
   • Minimum Window Substring
4. Stack
   • Valid Parentheses
5. Binary Search
   • Find Minimum In Rotated Sorted Array
   • Search In Rotated Sorted Array
6. LinkedList
   • Reverse Linked List
   • Merge Two Sorted Lists
   • Reorder List
   • Remove Nth Node From End of List
   • Linked List Cycle
   • Merge K Sorted Lists
7. Trees
   • Invert Binary Tree
   • Maximum Depth of Binary Tree
   • Same Tree
   • Subtree of Another Tree
   • Lowest Common Ancestor of a Binary Search Tree
   • Binary Tree Level Order Traversal
   • Validate Binary Search Tree
   • Kth Smallest Element In a Bst
   • Construct Binary Tree From Preorder And Inorder Traversal
   • Binary Tree Maximum Path Sum
   • Serialize And Deserialize Binary Tree
8. Tries
   • Implement Trie Prefix Tree
   • Design Add And Search Words Data Structure
   • Word Search II
9. Heap/Priority Queue
   • Find Median From Data Stream
10. Backtracking
    • Combination Sum
    • Word Search
11. Graphs
    • Number of Islands
    • Clone Graph
    • Pacific Atlantic Water Flow
    • Course Schedule
    • Number of Connected Components In An Undirected Graph
    • Graph Valid Tree
12. Advanced Graphs
    • Alien Dictionary
13. 1-D Dynamic Programming
    • Climbing Stairs
    • House Robber
    • House Robber II
    • Longest Palindromic Substring
    • Palindromic Substrings
    • Decode Ways
    • Coin Change
    • Maximum Product Subarray
    • Word Break
    • Longest Increasing Subsequence
14. 2-D Dynamic Programming
    • Unique Paths
    • Longest Common Subsequence
15. Greedy
    • Maximum Subarray
    • Jump Game
16. Intervals
    • Insert Interval
    • Merge Intervals
    • Non Overlapping Intervals
    • Meeting Rooms
    • Meeting Rooms II
17. Math & Geometry
    • Rotate Image
    • Spiral Matrix
    • Set Matrix Zeroes
18. Bit Manipulation
    • Number of 1 Bits
    • Counting Bits
    • Reverse Bits
    • Missing Number
    • Sum of Two Integers