Associate Software Developer (Intern + Full Time)
Interview Date
2023
Result
Selected
Difficulty
Hard
Rounds
4 rounds
Drive Type
On-Campus (Intern + Full Time)
Topics asked
Detailed experience
College: Not Specified (On-Campus Hiring)
Interview Date: 2023
Interview Type: On-Campus (Intern + Full Time)
Result: Selected
Difficulty: Hard
Rounds: 4 rounds
Topics Asked: Aptitude, Coding (Dynamic Programming, Permutations, OOPS, DSA), Stack Data Structure, Linked List, Real-Time Operating System, NoSQL Database, SQL, APIs, Win32 API, Master-Slave mechanism, Array (finding 2nd max element).
Sirion Labs visited a campus in 2023 to hire Associate Software Developers. A Pre-Placement Talk was conducted, outlining expectations and company culture. Out of 285 registered students, 3 were finally selected.
Round 1 (Aptitude & Coding): This round comprised Aptitude questions, code output finding, error identification in code, OOPS concepts, and two DSA-based coding questions. The coding questions were from Dynamic Programming and Permutations, which filtered out most students, making this the most difficult round to qualify.
Round 2 (Technical Interview 1): Conducted by a Software Developer, this round included questions like "What do you know about the concept of Object-Oriented Programming and its need?", "What is a Real-Time Operating System? Define it with an example.", "Implement Stack Data Structure with array.", "What do we need to implement 2 Stacks?", and "Add two numbers represented by two LinkedLists."
Round 3 (Technical Interview 2): This round focused on database knowledge and project discussions. Questions included "What do you know about the NoSQL-based Database?", "Write an SQL query to find the maximum and minimum salary from the given table." As the candidate had a project on a Computer Chat application, questions about APIs and Win32 API were asked, along with the "Concept of Master-Slave mechanism."
Round 4 (Technical Interview 3): This round involved finding the 2nd max element from an array using multiple approaches and discussing their time complexity, along with other basic DSA questions.