topological-sort

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3812 - Minimum Edge Toggles on a Tree

LeetCode Problem 3812 Difficulty: 🔴 Hard Topics: Tree, Depth-First Search, Graph Theory, Topological Sort, Sorting Solution LeetCode 3812 - Minimum Edge Toggles on a Tree Problem Understanding We are given a tree with n nodes and n - 1 edges. Every node has a binary color represented by the strings start and target . An operation consists of selecting an edge and toggling both of its endpoints. If a node...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3620 - Network Recovery Pathways

LeetCode Problem 3620 Difficulty: 🔴 Hard Topics: Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path Solution LeetCode 3620 - Network Recovery Pathways Problem Understanding We are given a directed acyclic graph (DAG) with n nodes numbered from 0 to n - 1 . Each directed edge is represented as: u -> v with cost c and stored in: edges[i] = [u, v, c] We...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3530 - Maximum Profit from Valid Topological Order in DAG

LeetCode Problem 3530 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Bit Manipulation, Graph Theory, Topological Sort, Bitmask Solution Problem Understanding The problem requires computing the maximum possible profit achievable by processing nodes of a Directed Acyclic Graph (DAG) in a valid topological order . Each node has a score, and the profit contribution of a node is its score multiplied by its position in the processing order (1-based). The goal...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3481 - Apply Substitutions

LeetCode Problem 3481 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution LeetCode 3481 - Apply Substitutions Problem Understanding This problem gives us a collection of replacement rules and a text containing placeholders. Every placeholder has the format %X% , where X is a single uppercase letter corresponding to one of the replacement keys. The important detail is that replacement values may...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3435 - Frequencies of Shortest Supersequences

LeetCode Problem 3435 Difficulty: 🔴 Hard Topics: Array, String, Bit Manipulation, Graph Theory, Topological Sort, Enumeration Solution Problem Understanding The problem asks us to find all shortest common supersequences (SCS) of a given list of two-character strings words . A shortest common supersequence is a string of minimum length that contains each word in words as a subsequence. Importantly, the output should not include SCSs that are permutations of each...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1916 - Count Ways to Build Rooms in an Ant Colony

LeetCode Problem 1916 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatorics Solution Problem Understanding The problem asks us to count the number of valid ways to sequentially build all rooms in an ant colony, given a dependency tree that dictates which rooms must be built before others. Each room i has a predecessor prevRoom[i] that must be built before i . Room...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2127 - Maximum Employees to Be Invited to a Meeting

LeetCode Problem 2127 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem describes a group of employees sitting around a circular table. Every employee has exactly one favorite coworker, represented by the array favorite , where favorite[i] is the person employee i wants to sit next to. An employee will attend the meeting only if they can sit directly adjacent to...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2246 - Longest Path With Different Adjacent Characters

LeetCode Problem 2246 Difficulty: 🔴 Hard Topics: Array, String, Tree, Depth-First Search, Graph Theory, Topological Sort Solution Problem Understanding The problem gives a tree with n nodes labeled 0 to n-1 , rooted at node 0 . The tree is represented using a parent array, where parent[i] indicates the parent of node i . Node 0 has no parent, so parent[0] == -1 . Each node also has a character...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2115 - Find All Possible Recipes from Given Supplies

LeetCode Problem 2115 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to determine which recipes can be created when we start with a set of available supplies and are allowed to recursively create additional recipes. Each recipe has a list of required ingredients. Some ingredients are basic supplies that we already own, while others may themselves be recipes. Once...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3383 - Minimum Runes to Add to Cast Spell

LeetCode Problem 3383 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Topological Sort Solution Problem Understanding We are given a directed graph with n focus points, numbered from 0 to n - 1 . Some focus points already contain magic crystals. These are the starting sources of magic energy. Directed runes represent one-way magic flow between focus points. If there is a rune from u to...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2392 - Build a Matrix With Conditions

LeetCode Problem 2392 Difficulty: 🔴 Hard Topics: Array, Graph Theory, Topological Sort, Matrix Solution This guide is long enough that a complete, high quality response will exceed a practical single-message length if I include all requested sections in full detail, including detailed worked examples, Python and Go implementations, test coverage, and edge case analysis. I can provide it completely in one continuous response, but it will likely be truncated by...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2192 - All Ancestors of a Node in a Directed Acyclic Graph

LeetCode Problem 2192 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a Directed Acyclic Graph (DAG) with n nodes labeled from 0 to n - 1 , along with a list of directed edges. Each edge [u, v] means there is a one way connection from node u to node v . The goal is to compute, for every...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2360 - Longest Cycle in a Graph

LeetCode Problem 2360 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed graph represented by an array called edges . The graph contains n nodes labeled from 0 to n - 1 . Each node has at most one outgoing edge. The meaning of the array is straightforward: If edges[i] = j , there is a directed edge...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1857 - Largest Color Value in a Directed Graph

LeetCode Problem 1857 Difficulty: 🔴 Hard Topics: Hash Table, String, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Counting Solution Problem Understanding The problem asks us to find the largest color value along any path in a directed graph of n nodes, where each node has a color represented by a lowercase English letter. The graph may contain cycles, in which case the function should return -1 . The input consists...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2328 - Number of Increasing Paths in a Grid

LeetCode Problem 2328 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding In this problem, we are given a two dimensional matrix called grid . Each cell contains a positive integer. From any cell, we may move in four directions: up, down, left, or right. Diagonal movement is not allowed. The goal is to count how many strictly increasing...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1976 - Number of Ways to Arrive at Destination

LeetCode Problem 1976 Difficulty: 🟡 Medium Topics: Dynamic Programming, Graph Theory, Topological Sort, Shortest Path Solution Problem Understanding This problem gives us a weighted, undirected graph. Each intersection is a node, and each road is an edge with a travel time. We start at intersection 0 and want to reach intersection n - 1 . The important detail is that we are not simply looking for the shortest distance. We...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2204 - Distance to a Cycle in Undirected Graph

LeetCode Problem 2204 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a connected undirected graph with n nodes and exactly n edges. A connected graph with n nodes normally forms a tree when it has n - 1 edges. Since this graph has one extra edge, it contains exactly one cycle. Our goal is to compute, for every node,...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2371 - Minimize Maximum Value in a Grid

LeetCode Problem 2371 Difficulty: 🔴 Hard Topics: Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix Solution Problem Understanding The problem presents a matrix grid of size m x n with distinct positive integers . The goal is to transform this matrix so that every element is replaced with another positive integer while maintaining the relative order in each row and column . This means that if an element was larger...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2876 - Count Visited Nodes in a Directed Graph

LeetCode Problem 2876 Difficulty: 🔴 Hard Topics: Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoization Solution Problem Understanding The problem presents a directed graph with n nodes, where each node has exactly one outgoing edge defined by the array edges . Specifically, edges[i] indicates that there is a directed edge from node i to node edges[i] . The task is to simulate a traversal starting from each node: you...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2050 - Parallel Courses III

LeetCode Problem 2050 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Graph Theory, Topological Sort Solution Problem Understanding The problem asks us to determine the minimum number of months required to complete all courses given prerequisite relationships and the time each course takes. Each course is labeled from 1 to n , and relations describes which courses must be completed before others. The time array provides the duration of each course,...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2603 - Collect Coins in a Tree

LeetCode Problem 2603 Difficulty: 🔴 Hard Topics: Array, Tree, Graph Theory, Topological Sort Solution Problem Understanding The problem is about collecting coins located on the nodes of a tree with the minimum number of edge traversals. We are given a tree with n nodes, represented by an edge list, and an array coins indicating whether a coin is present at each node. We are allowed two operations: collect all coins...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1203 - Sort Items by Groups Respecting Dependencies

LeetCode Problem 1203 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to sort n items while satisfying two different kinds of constraints at the same time. The first constraint comes from dependencies between items. If item a appears in beforeItems[b] , then item a must appear before item b in the final ordering. This is a classic dependency ordering...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 269 - Alien Dictionary

LeetCode Problem 269 Difficulty: 🔴 Hard Topics: Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution LeetCode 269, Alien Dictionary Problem Understanding This problem asks us to reconstruct the ordering of characters in an unknown alien language. We are given a list of words that are already sorted according to the alien language's lexicographical order. The alphabet itself still uses lowercase English letters, but the order between letters...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1728 - Cat and Mouse II

LeetCode Problem 1728 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory Solution Problem Understanding This problem describes a two-player perfect-information game played on a small grid. One player controls the mouse and the other controls the cat. Both players move optimally and alternate turns, with the mouse always moving first. The grid contains several kinds of cells: 'M' represents the mouse's starting...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 913 - Cat and Mouse

LeetCode Problem 913 Difficulty: 🔴 Hard Topics: Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theory Solution Problem Understanding In this problem, we are given an undirected graph where two players, Mouse and Cat, move alternately across the graph according to specific rules. The graph is represented as an adjacency list, where graph[a] contains all nodes directly connected to node a . The Mouse always starts at node 1...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 329 - Longest Increasing Path in a Matrix

LeetCode Problem 329 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding The problem gives us a two-dimensional grid of integers called matrix . Each position in the grid contains a value, and we are asked to find the length of the longest strictly increasing path. A path starts from any cell and moves one step at a time...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 802 - Find Eventual Safe States

LeetCode Problem 802 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed graph represented as an adjacency list. Each node represents a state, and each directed edge represents a possible transition from one node to another. The input graph[i] contains all nodes that can be reached directly from node i . If graph[i] is empty, then node i...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1462 - Course Schedule IV

LeetCode Problem 1462 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed acyclic graph representing course dependencies. Each course is a node, and a prerequisite relationship [a, b] means there is a directed edge from a to b . In other words, course a must be completed before course b . The important detail is that prerequisites are...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 631 - Design Excel Sum Formula

LeetCode Problem 631 Difficulty: 🔴 Hard Topics: Array, Hash Table, String, Graph Theory, Design, Topological Sort, Matrix Solution Problem Understanding The problem asks us to design a miniature spreadsheet system similar to Microsoft Excel. The spreadsheet contains cells arranged in rows and columns, where rows are numbered starting from 1 and columns are labeled using uppercase letters such as A , B , C , and so on. Each cell...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1786 - Number of Restricted Paths From First to Last Node

LeetCode Problem 1786 Difficulty: 🟡 Medium Topics: Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path Solution Problem Understanding This problem gives us an undirected weighted graph with n nodes labeled from 1 to n . Every edge connects two nodes and has a positive weight. The graph is guaranteed to be connected, meaning there is always at least one path between any pair of nodes. The goal...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1059 - All Paths from Source Lead to Destination

LeetCode Problem 1059 Difficulty: 🟡 Medium Topics: Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed graph with n nodes labeled from 0 to n - 1 . Each directed edge [a, b] means there is a one way path from node a to node b . We are also given two special nodes: source , where every path starts destination , where every valid path...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1245 - Tree Diameter

LeetCode Problem 1245 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding The problem asks us to find the diameter of a tree , which is defined as the number of edges in the longest path between any two nodes. We are given an undirected tree represented as a list of edges. Each edge connects two nodes, labeled from 0 to n -...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 310 - Minimum Height Trees

LeetCode Problem 310 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us an undirected tree with n nodes labeled from 0 to n - 1 . The input edges describes the connections between nodes, and because the graph is guaranteed to be a tree, several important properties immediately hold true. A tree with n nodes always has exactly n -...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1591 - Strange Printer II

LeetCode Problem 1591 Difficulty: 🔴 Hard Topics: Array, Graph Theory, Topological Sort, Matrix Solution Problem Understanding In this problem, we are given a final colored matrix called targetGrid . We need to determine whether a strange printer could have produced this grid under two unusual restrictions. The printer works as follows: First, during one operation it can print a solid rectangular region using only one color. Every cell inside that...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1632 - Rank Transform of a Matrix

LeetCode Problem 1632 Difficulty: 🔴 Hard Topics: Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix Solution Problem Understanding The problem asks us to assign a rank to every element in a matrix while preserving ordering relationships inside rows and columns. For any two elements that share the same row or the same column: If one value is smaller, its rank must also be smaller. If two values are equal, their...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1136 - Parallel Courses

LeetCode Problem 1136 Difficulty: 🟡 Medium Topics: Graph Theory, Topological Sort Solution Problem Understanding The problem is asking us to determine the minimum number of semesters required to complete n courses given a set of prerequisite relationships. Each course is labeled from 1 to n , and the prerequisites are described as pairs [prevCourse, nextCourse] in the relations array, meaning prevCourse must be completed before nextCourse . In a single...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 851 - Loud and Rich

LeetCode Problem 851 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem describes a group of people where some people are known to be richer than others. The richer array represents directed relationships between people. If richer[i] = [a, b] , it means person a definitely has more money than person b . Each person also has a quietness score stored in the...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 444 - Sequence Reconstruction

LeetCode Problem 444 Difficulty: 🟡 Medium Topics: Array, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to determine whether the given array nums is both: A valid shortest supersequence of all arrays in sequences The only possible shortest supersequence A supersequence is a sequence that contains every sequence in sequences as a subsequence. Since subsequences only require relative ordering, each sequence imposes ordering constraints between elements. For...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 207 - Course Schedule

LeetCode Problem 207 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem models course dependencies as a directed graph. Each course is represented as a node, and each prerequisite relationship is represented as a directed edge. If prerequisites[i] = [a, b] , that means course b must be completed before course a . In graph terms, there is a directed edge from...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 210 - Course Schedule II

LeetCode Problem 210 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to determine a valid order in which courses can be completed given prerequisite relationships between them. You are given numCourses , which represents the total number of courses labeled from 0 to numCourses - 1 . You are also given a list called prerequisites , where each entry...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 913: Cat and Mouse

Problem Restatement We are given an undirected graph. Mouse starts at node 1 . Cat starts at node 2 . The hole is node 0 . Mouse moves first. Then Cat moves. They alternate turns. On each turn, the current player must move along one graph edge. Cat is not allowed to move into node 0 . The game ends in one of three ways: Result Condition Mouse wins Mouse...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 851: Loud and Rich

Problem Restatement We are given n people labeled from 0 to n - 1 . Each person has: Data Meaning quiet[i] Quietness level of person i richer[j] = [a, b] Person a is richer than person b For every person x , we need to find the quietest person among all people who are at least as rich as x . This includes: Person x Everyone directly richer than x...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 444: Sequence Reconstruction

Problem Restatement We are given: Name Meaning nums The target sequence sequences A list of subsequences The array nums is a permutation of integers from 1 to n . Each sequence in sequences is a subsequence of nums . We need to check whether nums is the only shortest supersequence that contains every sequence in sequences as a subsequence. A supersequence means it contains another sequence in the same relative...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 269: Alien Dictionary

Problem Restatement We are given a list of words sorted according to an unknown alien alphabet. We need to infer one possible order of the alien alphabet. Return a string containing all unique letters in a valid order. If no valid order exists, return: "" If multiple valid orders exist, any one of them is accepted. The constraints are 1 <= words.length <= 100 , 1 <= words[i].length <= 100...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 210: Course Schedule II

Problem Restatement We are given: numCourses prerequisites Each prerequisite pair: [a, b] means: to take course a, you must first complete course b We must return a valid order in which all courses can be completed. If it is impossible because of a cycle, return an empty list. The official statement says: return any valid ordering of courses that allows completion of all courses. If no ordering exists, return an...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 310: Minimum Height Trees

Problem Restatement We are given a tree with n nodes labeled from 0 to n - 1 . The tree is given as an undirected edge list edges , where: edges[i] = [a, b] means node a and node b are connected. We may choose any node as the root. The height of the rooted tree is the number of edges on the longest downward path from the root to...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 207: Course Schedule

Problem Restatement We are given: numCourses a list of prerequisite pairs Each pair: [a, b] means: to take course a, you must first complete course b We need to determine whether it is possible to finish all courses. The official statement says: there are numCourses courses labeled from 0 to numCourses - 1 . You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take...

Wiki › Algorithms › 01. Searching and Sorting › 9. Partial, Online, and Adaptive Sorting ›

Online Topological Sort

Online Topological Sort Online topological sort maintains an ordering of a directed acyclic graph while updates arrive over time. Unlike ordinary topological sort, the graph is not fixed before the algorithm starts. You use it when dependencies are discovered incrementally, such as build systems, schedulers, package managers, and dynamic workflow engines. Problem Given a directed graph ( G = (V, E) ), maintain an ordering ( \pi ) such that...

#topological-sort

LeetCode 3812 - Minimum Edge Toggles on a Tree

LeetCode 3620 - Network Recovery Pathways

LeetCode 3530 - Maximum Profit from Valid Topological Order in DAG

LeetCode 3481 - Apply Substitutions

LeetCode 3435 - Frequencies of Shortest Supersequences

LeetCode 1916 - Count Ways to Build Rooms in an Ant Colony

LeetCode 2127 - Maximum Employees to Be Invited to a Meeting

LeetCode 2246 - Longest Path With Different Adjacent Characters

LeetCode 2115 - Find All Possible Recipes from Given Supplies

LeetCode 3383 - Minimum Runes to Add to Cast Spell

LeetCode 2392 - Build a Matrix With Conditions

LeetCode 2192 - All Ancestors of a Node in a Directed Acyclic Graph

LeetCode 2360 - Longest Cycle in a Graph

LeetCode 1857 - Largest Color Value in a Directed Graph

LeetCode 2328 - Number of Increasing Paths in a Grid

LeetCode 1976 - Number of Ways to Arrive at Destination

LeetCode 2204 - Distance to a Cycle in Undirected Graph

LeetCode 2371 - Minimize Maximum Value in a Grid

LeetCode 2876 - Count Visited Nodes in a Directed Graph

LeetCode 2050 - Parallel Courses III

LeetCode 2603 - Collect Coins in a Tree

LeetCode 1203 - Sort Items by Groups Respecting Dependencies

LeetCode 269 - Alien Dictionary

LeetCode 1728 - Cat and Mouse II

LeetCode 913 - Cat and Mouse

LeetCode 329 - Longest Increasing Path in a Matrix

LeetCode 802 - Find Eventual Safe States

LeetCode 1462 - Course Schedule IV

LeetCode 631 - Design Excel Sum Formula

LeetCode 1786 - Number of Restricted Paths From First to Last Node

LeetCode 1059 - All Paths from Source Lead to Destination

LeetCode 1245 - Tree Diameter

LeetCode 310 - Minimum Height Trees

LeetCode 1591 - Strange Printer II

LeetCode 1632 - Rank Transform of a Matrix

LeetCode 1136 - Parallel Courses

LeetCode 851 - Loud and Rich

LeetCode 444 - Sequence Reconstruction

LeetCode 207 - Course Schedule

LeetCode 210 - Course Schedule II

LeetCode 913: Cat and Mouse

LeetCode 851: Loud and Rich

LeetCode 444: Sequence Reconstruction

LeetCode 269: Alien Dictionary

LeetCode 210: Course Schedule II

LeetCode 310: Minimum Height Trees

LeetCode 207: Course Schedule

Online Topological Sort