Welcome to my repository featuring the 75 Blind LeetCode Questions! 🎯 These problems are a carefully curated list of essential coding challenges designed to help you prepare for technical interviews and improve your problem-solving skills. 💪
- 📊 Array
- 🔢 Binary
- 🧩 Dynamic Programming
- 🗺️ Graph
- 📅 Interval
- 🔗 Linked List
- 🗺️ Matrix
- 🔤 String
- Tree
- Heap
- Two Sum
- Best Time to Buy and Sell Stock
- Contains Duplicate
- Product of Array Except Self
- Maximum Subarray
- Maximum Product Subarray
- Find Minimum in Rotated Sorted Array
- Search in Rotated Sorted Array
- 3 Sum
- Container With Most Water
- Sum of Two Integers
- Number of 1 Bits
- Counting Bits
- Missing Number
- Reverse Bits
- 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
- Clone Graph
- Course Schedule
- 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)
- Insert Interval
- Merge Intervals
- Non-overlapping Intervals
- Meeting Rooms (LeetCode Premium)
- Meeting Rooms II (LeetCode Premium)
- 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
- Set Matrix Zeroes
- Spiral Matrix
- Rotate Image
- Word Search
- Longest Substring Without Repeating Characters
- Longest Repeating Character Replacement
- Minimum Window Substring
- Valid Anagram
- Group Anagrams
- Valid Parentheses
- Valid Palindrome
- Longest Palindromic Substring
- Palindromic Substrings
- 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
- Merge K Sorted Lists
- Top K Frequent Elements
- Find Median from Data Stream
Thank you for checking out my repository of the 75 Blind LeetCode Questions! I hope you find it helpful for your coding journey.
If you enjoyed the content and would like to support my work, consider:
- Sponsor me 💗 -- https://github.com/sponsors/Mrsanyi123
- Buy me a coffee ☕ -- https://github.com/sponsors/Mrsanyi123
- Follow me on GitHub ✅ -- https://github.com/Mrsanyi123
- Follow me on Linkedin 🤗 -- https://www.linkedin.com/in/sanyi-diriba
- Starring this repository to stay tuned for updates ⭐ -- https://github.com/Mrsanyi123/Blind-75-Leetcode-Problems
Your support means a lot and helps me continue creating valuable resources. Happy coding and best of luck with your practice! 🚀