Given an directed graph and two vertices u and v, remove minimum number of vertices such that v becomes unreachable from u. How to approach this problem?

Note: This question was asked in Juspay Hiring challenge on Hackerearth and contest has been ended.

Hey @galencolin, can you help me out??