Sep 7, 2025 · 4 min read · Problem A new alien language uses the English alphabet, but the order of letters is unknown. You are given a list of words[] from the alien language’s dictionary, where the words are claimed to be sorted lexicographically according to the language’s ...
Join discussionAug 24, 2025 · 2 min read · Problem There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. For...
Join discussionAug 18, 2025 · 2 min read · Problem There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. Fo...
Join discussionAug 17, 2025 · 4 min read · Problem Given a Directed Acyclic Graph (DAG) of V (0 to V-1) vertices and E edges represented as a 2D list of edges[][], where each entry edges[i] = [u, v] denotes a directed edge u -> v. Return the topological sort for the given graph. Topological ...
Join discussionApr 12, 2025 · 4 min read · There are N courses, labelled from 1 to N. We are given relations[i] = [X, Y], representing a prerequisite relationship between course X and course Y: course X has to be studied before course Y. In one semester you can study any number of courses as ...
Join discussion
Sep 28, 2024 · 4 min read · Topological Sorting is an important concept in graph theory, especially for Directed Acyclic Graphs (DAGs). It gives a linear order of vertices so that for every directed edge u → v, vertex u comes before v in the order. This is useful when tasks or ...
Join discussion
Sep 25, 2024 · 19 min read · A graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs are an abstract data structure used to represent relationships between objects. A graph G is typically denoted as G = (V, E), where: V is the set o...
Join discussionAug 22, 2024 · 2 min read · Topological sort is crucial in scenarios like task scheduling, resolving symbol dependencies in compilers, and determining build orders in software projects. This is going to be a quick blog on the Topological Sort Algorithms. Let's start! Topologica...
Join discussion
Jul 22, 2024 · 3 min read · You are given a positive integer k. You are also given: a 2D integer array rowConditions of size n where rowConditions[i] = [above<sub>i</sub>, below<sub>i</sub>], and a 2D integer array colConditions of size m where colConditions[i] = [left<sub>i<...
Join discussion
