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 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·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 18🌳 Binary Tree Construction PatternsAs part of my Binary Tree revision, I recently focused on Tree Construction problems.
Harsh Jaiswal·Sep 9🌳 Binary Tree Revision: From Height to Maximum Path SumAs part of my Binary Tree revision, I recently solved six important LeetCode problems:
Harsh Jaiswal·Sep 4🌳 Binary Tree Traversals: Understanding DFS & BFS PatternsAs part of my Binary Tree revision, I solved 5 important LeetCode problems:
Harsh Jaiswal·Sep 2🌳 Binary Tree Revision: Understanding the FundamentalsToday, I started my Binary Tree revision with a simple but important problem:
Harsh Jaiswal·Aug 25Understanding Queue: From FIFO Basics to Circular Queue, Deque & Queue Using Stacks 🚀While revising Queue, I realized that many problems that look different are actually based on a few simple ideas:
Harsh Jaiswal·Jul 30Starting My Linked List Revision Journey: Solving LeetCode 707 — Design Linked ListProblem Link
