I was asked the question https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/ in google phone screening round. I have given the solution with time complexity O(V^4log(V)) and the interviewer is not completely satisifed as it can be done in O(E(log(v))). Any chances of getting shortlisted for the further rounds