SDE - 1
Interview Date
—
Result
Selected
Difficulty
Medium
Rounds
4 rounds
Drive Type
Not Specified
Topics asked
Detailed experience
College: Not Specified
Interview Date: Not Specified
Interview Type: Not Specified
Result: Selected
Difficulty: Medium
Rounds: 4 rounds
Topics Asked: Data Structures, Algorithms, Coding Practices, Time and Space Complexity, Projects, SpringBoot, Autowiring, Bean, IOC, DI, HR Questions, Puzzles
The candidate interviewed for an SDE-1 role, emphasizing the importance of a well-prepared resume without misleading information.
Round 1: Technical (Video Call)
This round started with a basic introduction, followed by two DSA problems to be solved on CodeChef or a preferred IDE. The interviewer was helpful and assisted with syntax. Parameters tested included the ability to think of edge test cases, coding practices (naming variables, suitable access modifiers), and the ability to think of time and space complexity and optimize it. Reaching the correct output was preferred but not mandatory; priority was given to coding practices. One specific question mentioned was "Next Greater Element".
Round 2: Technical
The interviewer asked questions about projects mentioned in the resume and the technologies used in those projects. For example, if SpringBoot was mentioned, questions about autowiring, bean, IOC, and DI were asked.
Round 3: Technical
This round likely continued with technical problem-solving or in-depth discussions based on the candidate's profile. (Specific details are not explicitly separated from Round 2 in the source, but a 4-round structure is mentioned). A complex grid-based satisfaction problem was mentioned, involving two types of people ('A' and 'B') with varying satisfaction based on neighbors.
Round 4: HR Round
This round covered basic HR questions such as "Why do you want to join our organization?", "Are you comfortable in learning new technologies?", and "Salary Expectations".
Overall Experience: The candidate was selected. Tips included practicing popular questions from Arrays, Binary Trees, and LinkedLists, being aware of time and space complexity, and practicing explaining approaches through mock interviews.