KKKunal Krishnainthe-dsa.hashnode.dev·May 25 · 10 min readDAG - Directed Acyclic GraphTL’DR : in a DAG, a mutually unreachable pair (s, t) can exist if and only if there exists at least one topological level with at least two nodes. An interesting question came during the Course COMP-500
KKKunal Krishnaincompator-vs-comparable.hashnode.dev·Feb 18 · 2 min readCollection Framework : Javato be completed soon… To do : List, Queue, Set Done : Map Broadly there exist 5 distinct group of maps based on their internal behavior & guarantees : General Purpose (Hashing) Ordered (Insertion Sequence) Sorted (Natural / Custom Ordering) ...00
KKKunal Krishnainthe-dsa.hashnode.dev·Feb 5 · 5 min readMonotonic StackIn this article I intend to provide greater insight on how to Construct a MS. Many articles exist explaining its applicability. But constructing MS might be confusing. However, after reading this article reader will be able to intuitively design diff...00
KKKunal Krishnaincompator-vs-comparable.hashnode.dev·Jan 2 · 13 min readComparison in Java : Comparator vs ComparableLearning Objectives : Understanding broader architectural support in Java to facilitate custom object comparison/sorting Two Specific Interfaces in depth : Comparable<T> vs Comparator<T> Why Comparator is usually preferred ? Implementation examp...00