Lots of logistics trainings onsite.
Loads of work, not enough people.
The interview started with basic questions and then progressed to a coding round. They asked two questions, requiring details on time and space complexity. They also asked about the approaches used and whether they were optimizable. If an approach w
First online assessment on HackerRank. Easy in general, similar to most LeetCode problems. The second step is an online technical interview. The question is to consider that we don't have a dictionary data structure in Python, and we have to write a
The interview started with an introduction, followed by two data structures and algorithm questions. The first question was based on priority queues, which could have alternatively been done using a multiset. The second question was based on the lea
The interview started with basic questions and then progressed to a coding round. They asked two questions, requiring details on time and space complexity. They also asked about the approaches used and whether they were optimizable. If an approach w
First online assessment on HackerRank. Easy in general, similar to most LeetCode problems. The second step is an online technical interview. The question is to consider that we don't have a dictionary data structure in Python, and we have to write a
The interview started with an introduction, followed by two data structures and algorithm questions. The first question was based on priority queues, which could have alternatively been done using a multiset. The second question was based on the lea