CDChetan Dattainchetan77.hashnode.dev·Sep 14, 2025 · 6 min read 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 and 00
MJMohit jaininjainmohit0807.hashnode.dev·Aug 8, 2025 · 11 min readMastering PriorityQueue in Java: Use Cases, Internals & Custom ComparatorsBefore diving into PriorityQueue, it’s important to first understand the concept of heaps in Java. Heap A heap is a special kind of tree structure used to store data. It follows a simple rule: in a max-heap, parents are always bigger than or equal to...00
SSSubhradeep Sahainsubhradeepsaha.hashnode.dev·May 19, 2024 · 8 min readSolving a Leetcode problem daily — Day 12 | 347. Top K frequent elementshttps://blog.devgenius.io/solving-a-leetcode-problem-daily-day-12-347-top-k-frequent-elements-63afa6f681f3 Here is the Leetcode problem link —347. Top K frequent elements Problem Statement Given an integer array nums and an integer k, return thek...00
AAArpan Abhishekinblog.arpancodes.io·May 10, 2023 · 3 min readMin 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...00
