Harsh Jaiswal·1d ago🌳 Understanding Trie (Prefix Tree) — From Fundamentals to LeetCode ProblemsIntroduction
Harsh Jaiswal·4d 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 23Mastering Heap Patterns “Top K” : Maintain Heap Of Size KHere , We understand about Custom Comparator. While practicing Heap problems on LeetCode, I solved three important problems that helped me…
Harsh Jaiswal·Oct 22Basics of Heap: Stop Searching, Start Understanding!A beginner-friendly guide to Min Heap, Max Heap, and the fundamentals of Heap in C++.
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·Oct 6Two Pointers, Differences & Greedy Reconstruction — Greedy AlgorithmsAfter completing the basic Greedy problems, I moved to the next phase where Greedy starts becoming a little more interesting.
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.
