CChetan Datta·Sep 14, 2025 Djisktra's AlgorithmProblem Given an undirected, weighted graph with V vertices numbered from 0 to V-1 and E edges, represented by 2d array edges[][], where edges[i]=[u, v, w] represents the edge between the nodes u and6 min read·chetan77.hashnode.dev
MMohit jain·Aug 8, 2025Mastering PriorityQueue in Java: Use Cases, Internals & Custom ComparatorsGet to Know PriorityQueue and How to Personalize It for Your Projects.11 min read·jainmohit0807.hashnode.dev
SSubhradeep Saha·May 19, 2024Solving a Leetcode problem daily — Day 12 | 347. Top K frequent elementsA detailed blog on how to use min heap for solving Leetcode’s 347 Top K frequent elements problem.8 min read·subhradeepsaha.hashnode.dev
AArpan Abhishek·May 10, 2023Min Heap ConstructionMin heap is a binary tree-like structure, which satisfies the following conditions: Each node value is lesser than the children's. It should be a complete tree, if not then the extra children should be added on the left leaf nodes. Min heap is i...3 min read·blog.arpancodes.io