Topological Sorting

28 posts

Shortest Supersequence by Sequence Reconstruction

Last Updated: 22 April 2024

Given an array arr[] and a 2D array sequences[], determine if arr is the shortest possible and the only supersequence for the given sequence ...read more

Google

Graph

Topological Sorting

Picked

DSA

Shortest Path Algorithm Tutorial with Problems

Last Updated: 23 November 2023

In this article, we are going to cover all the commonly used shortest path algorithm while studying Data Structures and Algorithm. These alg...read more

Dijkstra

Competitive Programming

Check if permutation of size N can form uniquely

Last Updated: 28 April 2023

Given array A[][2] of size M, form a new array B[] of size N, for every i from 1 to M we know BA[i][0] BA[i][1]. The task for this problem ...read more

Similar Topics

DSA

21.8k+ articles

Competitive Programming

2.2k+ articles

Algorithms

2k+ articles

Sorting

1.7k+ articles

Amazon

1.7k+ articles

Graph

900+ articles

DFS

340+ articles

BFS

210+ articles

Shortest Path

69+ articles

graph-connectivity

63+ articles

Kahn's Algorithm vs DFS Approach: A Comparative Analysis

Last Updated: 19 October 2023

Topological sorting is a common problem in computer science that involves arranging the vertices of a directed acyclic graph (DAG) in a line...read more

Data Structures-Tree Traversals

Data Structures-Stack

Data Structures-Graph

DSA

Minimize colours to paint graph such that no path have same colour

Last Updated: 24 March 2023

Given a directed graph with N nodes and M connections shown in the matrix mat[] where each element is of the form {xi, yi} denoting a direct...read more

Check if given Arrays have a Unique Shortest Common Super-sequence

Last Updated: 20 June 2022

Given a 2D array arr[][] of size N*M which denotes N arrays, each of size M. The task is to check if all these arrays have a unique common s ...read more

Equivalent Serial Schedule of Conflict Serializable Schedule in DBMS

Last Updated: 25 April 2023

Prerequisite: Conflict Serializability, Precedence GraphConflict Serializable Schedule: A schedule is called conflict serializable if it can...read more

Graph

Topological Sorting

DBMS

DBMS-Transactions and Concurrency Control

DSA

Check if the given array can be constructed uniquely from the given set of subsequences

Last Updated: 10 February 2023

Given an array arr of distinct elements and a list of subsequences seqs of the array, the task is to check whether the given array can be un ...read more

Graph

Algorithms

Competitive Programming

Topological Sorting

DSA

Find the winner of the match | Multiple Queries

Last Updated: 22 February 2023

Given an array of pairs arr of size N which represents a game situation where the first player wins against the second player. Given multipl ...read more

Lexicographically Smallest Topological Ordering

Last Updated: 03 April 2024

Given a directed graph with N vertices and M edges that may contain cycles, the task is to find the lexicographically smallest topological o...read more

Graph

Algorithms

Binary Search Tree

Competitive Programming

Topological Sorting

DSA

Maximum edges that can be added to DAG so that it remains DAG

Last Updated: 28 February 2023

A DAG is given to us, we need to find maximum number of edges that can be added to this DAG, after which new graph still remain a DAG that m...read more

Topological Sort of a graph using departure time of vertex

Last Updated: 20 February 2023

Given a Directed Acyclic Graph (DAG), find Topological Sort of the graph.Topological sorting for Directed Acyclic Graph (DAG) is a linear or...read more

Graph

Topological Sorting

DSA

Assign directions to edges so that the directed graph remains acyclic

Last Updated: 27 June 2022

Given a graph with both directed and undirected edges. It is given that the directed edges don't form cycle. How to assign directions to und...read more

1 2

1 2

1 2