Challenge: Remove Edge from a Directed Graph

Implement a function that removes a given edge from a directed graph represented by an adjacency list. Understand constraints like no self-loops or multiple edges between vertices. This challenge helps you practice manipulating graph structures commonly encountered in coding interviews.