Role: SDE-1
College: Not Specified
Interview Date: Not Specified (Posted July 23, 2025)
Interview Type: On-Campus
Result: Selected
Difficulty: Medium
Rounds: 4 rounds
Topics Asked: SQL queries, Data Structures, Algorithms, MCQs, OOPs (Polymorphism, Inheritance, Data Abstraction), Projects, Behavioral Questions
Experience:
The candidate applied through a referral and the entire process was completed in 10-12 days with immediate feedback after each round.
Round 1: Online Assessment (2 hours)
- 2 SQL queries.
- 2 coding questions.
- Some MCQs.
Round 2: Technical Interview Round 1 (1 hour)
- Started with introductions.
- Coding problem: Given a row-wise and column-wise sorted matrix, search an element and then delete that element while maintaining the property of that matrix. The interviewer provided hints, and the candidate wrote the code, mailing it after resolving compilation errors.
- Coding problem: Find pairs of elements in an array such that i < j but arr[i] > arr[j]. The interviewer hinted at using a divide and conquer approach, and the candidate solved it using merge sort.
- Behavioral questions were asked alongside coding.
- Questions on multithreading, difference between threads and processes, parallelism, and concurrency.
Round 3: Technical Interview Round 2 (1 hour)
- Introductions.
- Explanation of internship project in brief.
- Coding problem: The candidate started with a brute force approach, then optimized it using the same array as a map to arrive at a solution.
- Another coding problem where the candidate struggled initially but discussed with the interviewer and arrived at a solution, writing the function and dry-running cases.
- OOPs questions related to Polymorphism, Inheritance, and Data Abstraction.
Round 4: Telephonic (HR)
- HR informed about selection and discussed compensation.
The candidate was selected.