I applied through college or university.

It was a slow process, the first round is the major one try to get the DSA questions right by practicing questions that were previously asked and they may not allow you to use languages like Python so try learning C/C++/C#

You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit.

You are given an array Edge[] of N integers, where Edge[i] contains the cell number that can be reached from cell i in one step. Edge[i] is -1 if the i-th cell doesn’t have an exit. Your task is to find the sum of the largest cycle in the maze. The sum of a cycle is the sum of node numbers of all nodes in that cycle.

Note: Cells are numbered from 0 to N-1

Constraints: 1 <= N <= 10⁵