Challenge: Remove Edge from a Directed Graph
Try to solve the Remove Edge from a Directed Graph problem.
We'll cover the following
Statement
Given an adjacency list of a directed graph consisting of n
vertices, modify the list after removing an edge between the source
and destination
vertices.
Constraints:
n
edges.length
edges[i].length
source
,destination
n
source
destination
There are no multiple edges between any two vertices
There are no self-loops
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.