Tip 1 : Have a good practice of aptitude and English paragraph questions
Tip 2 : Be thorough with the projects you mention in your resume. Right from tech stack used to how you used and its impact
Tip 3 : Express your thought process while solving any problem clearly
Tip 1 : Mention projects that are done by you(at least two)
Tip 2 : Not more than 1-page long resume
It was an approximately 75-minute long online assessment round on the Amcat platform. The entire round was MCQ based.
There were 4 sections- Aptitude, English paragraphs, Reasoning, Computer Science fundamentals on Software Engineering, HTML/ CSS etc.
It was a group discussion round but with a slight variation. All 10 of us were given 1 common topic and then were sub-divided into small groups of 2-3. Then we discussed points within our sub-group for 10 minutes. After that each one of us was given 5 minutes to note down in bullet points about our view on the topic and submit it. Then each one of us went in front of everyone and explained our points as written in our note submitted earlier to everyone in the room. We were allowed to speak only for 2 minutes.
After everyone was done, the interviewer of the discussion master explained his thought process and explained how he would have approached the topic. He was quite motivating and explained us about the role in general. 3 folks out of this 10 people group were selected for the next round. It was quite a good experience and a healthy discussion on the topic.
This was the last round and first face to face, 2 on 1(meaning 2 interviewers and 1 interviewee) technical interview. They started with a basic intro and straightforward deep-dived into projects. They asked about the tech stack used and questions around those tech stacks. In my case, I was asked to write SQL queries on various scenarios. I was also asked DBMS problems like 2-NF and 3-NF. One simple data structure question on arrays was also asked to me. However, they did focus on optimizing my code.



Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Method 1 : Use STL map to keep a track of elements in the array, and to check if a pair exists.
Method 2 : Sort the array, and use two pointer approach i.e. two pointers one from both the ends.
What is BCNF?
Be thorough with the DBMS normalization and ACID properties.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?