Harsh Jaiswal·2d ago🌳 Understanding Trie (Prefix Tree) — From Fundamentals to LeetCode ProblemsIntroduction
Harsh Jaiswal·5d agoHashing in DSA: From Fundamentals to Advanced Problem-Solving PatternsIntroduction
Harsh Jaiswal·Oct 25Find Median and Merge List using HeapIntroduction: When a Heap Becomes More Than a Data Structure
Harsh Jaiswal·Oct 9Greedy Algorithm : Three Problems That Taught Me to Think Beyond Brute ForceSolving a LeetCode problem is not just about finding a solution that passes all test cases. The real learning happens when we understand…A response icon1A response icon1
Harsh Jaiswal·Sep 30🚀 Reachability & Greedy Boundaries — A Powerful Greedy PatternWhile learning Greedy Algorithms, I completed four important problems:
Harsh Jaiswal·Sep 26🚀 Greedy Algorithms: Interval Scheduling & Overlapping IntervalsWhile learning Greedy Algorithms, I came across a pattern that was new for me: Intervals.
Harsh Jaiswal·Sep 23🚀 Starting My Greedy Algorithm Journey :Sorting & MatchingAfter completing several important DSA topics, including Arrays, Binary Search, Recursion, Linked Lists, Stacks, Queues, Binary Trees, and…
Harsh Jaiswal·Sep 20🌳 Mastering BST Patterns: Iterator, Construction & BalancingAs part of my ongoing DSA revision journey, I recently solved three important Binary Search Tree (BST) problems on LeetCode:
Harsh Jaiswal·Sep 19Mastering Binary Search Tree (BST) Patterns: 7 LeetCode Problems Explained in DepthIntroduction
