Round 1
Questions:
- Easy level SQL question: Finding the employee with the highest salary in each department.
- DSA question (medium): N horses problem, similar to the N queen problem.
- DSA question (medium): If n is odd, then n = 3n + 1; if n is even, then n = n / 2. The rank of number n is how many steps it will take for the given n to become 4. (Example: n = 10 → 10 → 5 → 16 → 8 → 4, total 4 steps). Given a range from 1 to N, find the number with the maximum rank.
- Two more easy DSA questions related to arrays, solved using frequency count (details not remembered).
- A few HR questions.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Implementation of a sorted circular singly linked list. Asked to write functions for insertion, deletion, and searching.
- Printing a pyramid:
1 1 2 1 1 3 4 3 1 1 4 7 8 7 4 1
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Find the next greater element using a stack.
- Merge sort implementation.
- Question on arrays using prefix sum (exact question not remembered).
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.