I applied for the Coding Mart On-Campus drive. There were a total of 4 rounds.
Interview Process :
-
Day 1:
- MCQ
- DSA program
-
Day 2:
- HR Round
Round 1: It was an MCQ round. There were 25 easy-level DSA questions. Codes were on simple topics like linked lists, trees, graphs, DP, etc., Level of Difficulty: Easy-Medium.
Round 2: In round 2 there was 1 DSA programming test held in the college lab.
- Create a binary search tree (BST) and Delete all the given arrays of nodes then traverse in order. Level of Difficulty: Easy.
- There were questions on Arrays and Queues.
Round 3: There were 2 interview rounds a technical and an HR.
Technical interview: In a technical interview, I was asked 3 DSA questions. And they gave a topic to present for at least 3 minutes. Major questions arise from my resume. The questions that I asked in DSA coding questions are listed below:
- Program to find the frequency of each element in an array.
- Ex: Input: arr [] = {1,1,2,3,3,4}
Output: {1 : 2, 2 : 1, 3 : 2, 4 : 1}
- Ex: Input: arr [] = {1,1,2,3,3,4}
- Given a string and n is the no of rows. Print the string in a zigzag manner.
- For example, if str = ‘PROGRAMMING’ and n=3 then the output is ‘PRIRGAMNOMG’.
- [ P R I
R G A M N
O M G ]
- [ P R I
- For example, if str = ‘PROGRAMMING’ and n=3 then the output is ‘PRIRGAMNOMG’.
- Program to find the sum of the value of nodes having only one child.
- For example,
- Input :
1
/ \
2 3
/ \
4 5
/ \ \
6 7 8 - Output is 2 + 3 + 5 = 10. Because 2, 3, and 5 have a single child.
HR round: It was simple negotiation with HR, like Are you ready to relocate and other simple questions.