Blind 75 LeetCode Questions

LeetCode Blind 75

Bravo for both you and me! 🥳🎉

I found a list of Blind 75 Leetcode problems. And after segregating them topic-wise I am going to share them with you as one of the mot important resource you can follow to practice only the best coding problems for your interview.

Happy Coding!

Array

• 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

Binary

• Sum of Two Integers
• Number of 1 Bits
• Counting Bits
• Missing Number
• 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
• 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
• Word Search

String

• 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
• 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

DO THIS OR I WILL BE SAD 🥺

If you want to get the list saved and in your gitHub head now to our repo — Blind-75-Leetcode-Problems list.

Don’t forget to Fork the repo and star⭐ it to use the list. Also, there’s a surprise tool waiting for you to help you in your preparation the bottom of the list.

Hope you enjoyed going through the article. You can follow me to get the latest update when I upload more such amazing article.

If you got to learn something valuable from this article and clap and follow me if you found it helpful.

You can encourage me to write more such articles on: https://ko-fi.com/medusaverse

Follow me for more such awesome articles that can help you in your interview preparation and studies and learn coding.

Who am I?

Just someone who is enthusiastic to write what he likes. Tech blogs, tutorials, Coding Question solutions Editorials, Interview Tips and many more stuff that you are bound to like.

Also, I write articles for freelancing so you can contact me through the below link.

If you liked this article, do support me in this endeavor by following me on medium and get latest updates to my amazing and helpful articles.

You can encourage me to write more on: https://ko-fi.com/medusaverse

I will be happy to Connect with you : https://linktr.ee/harshit_raj_14