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$ ...