I applied through a college or university. First was an online test on Talscale. Then a hackathon was conducted which had two phases:

• HackerEarth test for 3 hours.
• Online coding interview with the CEO.

The questions were purely based on graph and tree.

You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (i.e., entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1. You need to find the length of the largest cycle in the maze. Return -1 if there are no cycles.

You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (i.e., entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1.