Since new joiner, no cons as of now.
The DSA round included two questions. One was to find the lexicographically smaller word from an n x n matrix, given a variable k that specifies how many times you can change a letter to a different letter. The second question was based on disjoint
It was pretty tough. It had: * 1 online assessment * 2 offline technical rounds * 1 HR round Each round was an elimination round, and only 3 students were selected out of 32.
The first round was an OA elimination based on DSA, where we were asked four questions covering Graphs, DP, and bit manipulation. I answered two completely and submitted one partially. I was selected for interviews. There were three interviews. The
The DSA round included two questions. One was to find the lexicographically smaller word from an n x n matrix, given a variable k that specifies how many times you can change a letter to a different letter. The second question was based on disjoint
It was pretty tough. It had: * 1 online assessment * 2 offline technical rounds * 1 HR round Each round was an elimination round, and only 3 students were selected out of 32.
The first round was an OA elimination based on DSA, where we were asked four questions covering Graphs, DP, and bit manipulation. I answered two completely and submitted one partially. I was selected for interviews. There were three interviews. The