Challenge: Remove Edge from a Directed Graph

Try to solve the Remove Edge from a Directed Graph problem.

We'll cover the following


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.


  • 00 \leqn102 \leq 10^2

  • 00 \leqedges.length n(n1)/2\leq n(n-1)/2

  • edges[i].length ==2== 2

  • 11 \leqsource, destination \leqn

  • source\neqdestination

  • There are no multiple edges between any two vertices

  • There are no self-loops


Level up your interview prep. Join Educative to access 70+ hands-on prep courses.