Challenge: Remove Edge from a Directed Graph

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:

• $0 \leq$n$\leq 10^2$

• $0 \leq$edges.length $\leq n(n-1)/2$

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

• $1 \leq$source, destination $\leq$n

• source$\neq$destination

• There are no multiple edges between any two vertices

• There are no self-loops

Examples