Welcome to my Blind 75 series.
Here, I break down each DSA problem step by step, showing my thought process, failed attempts, optimizations, and final solutions.
Check out each problem below and follow along!
| Problem | Solution | LeetCode |
|---|---|---|
| How to check if a string is a Valid Palindrome: O(n) two pointer solution explained | View | LeetCode |
| How to check Valid Parentheses: O(n) Stack solution explained | View | LeetCode |
| How to Group Anagrams: O(n · m log m) Solution Explained | View | LeetCode |
| How to find if string is Valid Anagram: O(n) solution explained | View | LeetCode |
| Minimum Window Substring: Sliding Window Explained | View | LeetCode |
| Longest Repeating Character Replacement: Sliding Window Explained | View | LeetCode |
| Longest Substring Without Repeating Characters: Sliding Window Explained | View | LeetCode |
| Remove Nth Node from the End of the Linked List (Blind 75) | View | LeetCode |
| Merge two sorted linked list (Blind 75) | View | LeetCode |
| How to Detect a Cycle in a Linked List (Blind 75) | View | LeetCode |
| How to Reverse a Linked List (Blind 75) | View | LeetCode |
| Word Search (Blind 75): DFS + Backtracking Explained | View | LeetCode |
| Rotate Image (Blind 75): 90° Matrix Rotation Explained | View | LeetCode |
| Spiral Matrix (Blind 75): Matrix traversal in spiral order | View | LeetCode |
| Set Matrix Zeroes (Blind 75): O(1) Space Solution | View | LeetCode |
| Find the container with most water (Blind 75) — O(n) Solution | View | LeetCode |
| Three Sum (Blind 75) — O(n²) Solution | View | LeetCode |
| Search in Rotated Sorted Array (Blind 75) — O(log n) Solution | View | LeetCode |
| Blind 75: Find Minimum in Rotated Sorted Array — Understanding Binary Search Deeper | View | LeetCode |
| Blind 75: Best Time to Buy and Sell Stock — One Pass Solution Explained | View | LeetCode |
| Blind 75: Two Sum — From Brute Force to Hash Map | View | LeetCode |