Let's come to the point
I have created a list of Blind 75 because when I searched for it, it was on GFG, but I wanted it on leetcode (IDK why!!). So here it is the list of Blind 75 on leetcode
One request, some of the problems are premium, so if anyone found these problems on an alternative platform, plz comment it for all :)
If you have little bit more time plz start this repo Blind-75
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
- 3Sum
- Container With Most Water
Binary
Dynamic Programming
- Climbing Stairs
- Coin Change
- Longest Increasing Subsequence
- Longest Common Subsequence
- Word Break
- Combination Sum
- House Robber
- House Robber II
- Decode Ways
- Unique Paths
- Jump Game
Graph
- Clone Graph
- Course Schedule
- Course Schedule II
- 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 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
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 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 a Binary Search Tree
- Implement Trie (Prefix Tree)
Okay, then. My name is Jaimin Bariya. I write posts on DSA, Python, AI-ML, and React, but I love them all. So, if you found this content helpful, save it, give it all 5 likes (😅), and Share it on your LinkedIn if you are going to start this challenge today.
If you have a little bit of time, plz comment to suggest to me what my next post on. See you next time 👋 🫡
Happy Coding :)
Top comments (2)