It was an on-campus opportunity with 6M+ FTE. First round was an online coding test with easy to medium difficulty. Questions were mostly graph-based. Next, the interview had two rounds, both eliminatory. * The first round was completely DSA-bas
I was asked two questions. They were the same questions with two variations. Initially, I had to search for a target string in a list of strings. In a follow-up, I was required to determine whether the search string is present as a substring in the l
First, there was a 90-minute coding round consisting of three questions: * One was easy. * One was medium. * The last one was on segment trees if we aimed for the optimal solution. Then, there were interview rounds.
It was an on-campus opportunity with 6M+ FTE. First round was an online coding test with easy to medium difficulty. Questions were mostly graph-based. Next, the interview had two rounds, both eliminatory. * The first round was completely DSA-bas
I was asked two questions. They were the same questions with two variations. Initially, I had to search for a target string in a list of strings. In a follow-up, I was required to determine whether the search string is present as a substring in the l
First, there was a 90-minute coding round consisting of three questions: * One was easy. * One was medium. * The last one was on segment trees if we aimed for the optimal solution. Then, there were interview rounds.