https://adeveloperdiary.github.io/A Developer DiaryA minimal, responsive and feature-rich Jekyll theme for technical writing. 2024-04-22T19:37:13+00:00 Abhisek Jana https://adeveloperdiary.github.io/ Jekyll © 2024 Abhisek Jana /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png Tree - Course Schedule2024-04-22T00:00:00+00:00 2024-04-22T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/graph/course-schedule/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Medium Backtracking, DFS Problem There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are g... Tree - Word Ladder2024-04-21T00:00:00+00:00 2024-04-21T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/graph/word-ladder/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Medium Adjacency List, BFS Problem A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequ... Tree - Graph Valid Tree2024-04-21T00:00:00+00:00 2024-04-21T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/graph/graph-valid-tree/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DFS, Map Problem Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a fun... Tree - Clone Graph2024-04-20T00:00:00+00:00 2024-04-20T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/graph/clone-graph/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy DFS, Map Problem Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node... Tree - Network Delay Time2024-04-17T00:00:00+00:00 2024-04-17T00:00:00+00:00 https://adeveloperdiary.github.io/algorithm/graph/network-delay-time/ Abhisek Jana All diagrams presented herein are original creations, meticulously designed to enhance comprehension and recall. Crafting these aids required considerable effort, and I kindly request attribution if this content is reused elsewhere. Difficulty : Easy Dijkstra’s Algorithm (Graph), BFS, Min-Heap Problem You are given a network of n nodes, labeled from 1 to n. You are also given t...