Skip to content
Interview Prep Buddy LogoInterview Prep Buddy

Striver Blind 75 — Detailed Solutions & Explanations

🚀 Striver Blind 75 Solutions Guide

Section titled “🚀 Striver Blind 75 Solutions Guide”

Welcome to the complete documentation hub for the Striver Blind 75 DSA Questions. Each problem below includes a detailed walkthrough, approach intuition, step-by-step Mermaid diagrams, brute force code, and optimal solutions.

Day 1: Arrays — Part 1 (Hashing & Kadane)

Section titled “Day 1: Arrays — Part 1 (Hashing & Kadane)”

Day 2: Arrays — Part 2 (Rotated Search & Two Pointers)

Section titled “Day 2: Arrays — Part 2 (Rotated Search & Two Pointers)”

Day 3: Binary & Bit Manipulation

Section titled “Day 3: Binary & Bit Manipulation”

Day 4: Dynamic Programming — Part 1

Section titled “Day 4: Dynamic Programming — Part 1”

Day 5: Dynamic Programming — Part 2

Section titled “Day 5: Dynamic Programming — Part 2”

Day 6: Graphs — Part 1 (Traversal & Topo)

Section titled “Day 6: Graphs — Part 1 (Traversal & Topo)”

Day 7: Graphs — Part 2 (Union-Find & Premium)

Section titled “Day 7: Graphs — Part 2 (Union-Find & Premium)”

Day 8: Intervals

Section titled “Day 8: Intervals”

Day 9: Linked Lists

Section titled “Day 9: Linked Lists”

Day 10: Matrix

Section titled “Day 10: Matrix”

Day 11: Strings — Part 1 (Sliding Window & Hashing)

Section titled “Day 11: Strings — Part 1 (Sliding Window & Hashing)”

Day 12: Strings — Part 2 (Palindromes & Parsing)

Section titled “Day 12: Strings — Part 2 (Palindromes & Parsing)”

Day 13: Trees — Part 1 (Traversal & Structure)

Section titled “Day 13: Trees — Part 1 (Traversal & Structure)”

Day 14: Trees — Part 2 (BST & Construction)

Section titled “Day 14: Trees — Part 2 (BST & Construction)”

Day 15: Tries & Heaps

Section titled “Day 15: Tries & Heaps”