Kunal Krishna (@kunalkrishna85)

DAG - Directed Acyclic Graph

TL’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-5

May 25 · 10 min readthe-dsa.hashnode.dev

Collection Framework : Java

to 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) ...

Feb 18 · 2 min readcompator-vs-comparable.hashnode.dev

Monotonic Stack

In 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...

Feb 5 · 5 min readthe-dsa.hashnode.dev

Comparison in Java : Comparator vs Comparable

Learning Objectives : Understanding broader architectural support in Java to facilitate custom object comparison/sorting Two Specific Interfaces in depth : Comparable<T> vs Comparator<T> Why Compar

Jan 2 · 16 min readcompator-vs-comparable.hashnode.dev

Kunal Krishna

About

Available for

Kunal Krishna's blogs

DAG - Directed Acyclic Graph

Collection Framework : Java

Monotonic Stack

Comparison in Java : Comparator vs Comparable

Kunal Krishna

About

Available for

Kunal Krishna's blogs

DAG - Directed Acyclic Graph

Collection Framework : Java

Monotonic Stack

Comparison in Java : Comparator vs Comparable

Kunal Krishna

About

Available for

Kunal Krishna's blogs

DAG - Directed Acyclic Graph

Collection Framework : Java

Monotonic Stack

Comparison in Java : Comparator vs Comparable

Search Hashnode

Kunal Krishna

About

Available for

Kunal Krishna's blogs

DAG - Directed Acyclic Graph

Collection Framework : Java

Monotonic Stack

Comparison in Java : Comparator vs Comparable