I was able to solve the questions that were asked in the interview with the help of some of the FS concepts. The DFS concepts involved a question called largest sum cycle of converging maze. You are given a grid where each cell itself may have multiple entry points, but not the one except the cells are named with an integer value from 0 to n.

Hehbsbsbsndndnsn ahau sia siso kaka dksks.