Round 1: Online Assessment
Questions: The assessment consisted of two sections:
-
Section 1: 30 multiple-choice questions (MCQs) covering various topics, including:
- Code debugging and output analysis
- Data structures and algorithms
- SQL queries
- Concepts in Java and C++
-
Section 2: A single DSA problem to be solved within 45 minutes. The problem statement was:
An ant is traveling in a forest represented as the x-axis. Starting from the origin (position = 0), the ant must reach a target position x. With each step, the ant can move either ‘a’ units forward or ‘b’ units backward. The ant cannot move behind position 0, but it can go beyond position x if necessary to eventually reach x in a finite number of steps. The task is to find the minimum number of steps required for the ant to reach position x from the origin.
Hint: Consider using a Breadth-First Search (BFS) approach.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Online Interview (Technical)
Questions:
- Introduce yourself.
- DSA Problem: Solve the LeetCode problem #6: ZigZag Conversion.
CS Fundamentals:
- Explained the concepts of Deadlock and Starvation.
- Deadlock avoidance methods.
- Differentiate between Processes and Threads.
- Multiprogramming and Page Faults.
- Normalization in databases, including 1NF, 2NF, and 3NF.
- Explain Network topologies and their types.
- What is Deep copy and Shallow copy?
- Describe the use of a Copy constructor.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Online Interview (Technical)
Questions:
- DSA Problem Asked:
- Implement Stack Using Queue
- Some string-based problem (details not remembered, but it was easy).
CS Fundamentals: Focused on theoretical questions related to OOPs.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4: Online Interview (Technical)
Questions:
- CS Fundamentals were asked.
- Only one DSA problem was asked: Convert Sorted Array to BST.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5: HR Round
Questions:
- Basic conversation about work culture, pay structure, and related topics.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Important: Focus on CS fundamentals. They emphasize OOPs concepts. The candidate struggled with 3-4 terms related to OOPs, particularly Smart pointers, as they were more fluent in Python and less familiar with C++ concepts. DSA problems were mostly in the Easy category, except for the Zig Zag Conversion problem in Round 1.