Good competitive growth and learning, stable.
Hectic workload, competitiveness, location, culture
After finishing the OA, there were two technical rounds. The questions were pretty basic and straight from your computer fundamentals. The second technical round tested if you knew in depth about the languages and tools used. Finally, there was an
The interview was easy. I had to answer two questions: 1. How a ternary tree can be used for storing numbers. 2. Random linked list pointer clone. The interviewer was quite nice and allowed hints, as well as some corrections.
The interview was predominantly data structures and algorithms-based. There were some theoretical questions based on my background. They were relatively basic and didn't go too deep. All in all, it was a decent interview.
After finishing the OA, there were two technical rounds. The questions were pretty basic and straight from your computer fundamentals. The second technical round tested if you knew in depth about the languages and tools used. Finally, there was an
The interview was easy. I had to answer two questions: 1. How a ternary tree can be used for storing numbers. 2. Random linked list pointer clone. The interviewer was quite nice and allowed hints, as well as some corrections.
The interview was predominantly data structures and algorithms-based. There were some theoretical questions based on my background. They were relatively basic and didn't go too deep. All in all, it was a decent interview.