Given a directed graph we need to find a set of minimum vertices to be removed so that there will be no path from the given start node to the end node.
I tried to find the solution for this and I got to know that there is a solution with max-flow min-cut but I didn't get that. Or is there any other solution for this. By seeing the problem statement it looks pretty standard. Can anyone help me?
This seems suspiciously like a question from an ongoing hiring test ;)
Yup it is.
I'm pretty sure this is from an ongoing contest, I got messaged the same question by someone else who I don't even know
Remove the end node, answer is 1 :)