I applied through university. I interviewed at Swabhav (Andheri) in Feb 2025
Interview
Round 1: Online Assessment
This round was slightly more than average in terms of difficulty.
Round 2: Technical Interview 1
In this round, we were given 3 DSA questions to solve on paper. The questions were mainly from Arrays and Strings.
Important: The code had to be written with a time complexity of O(n), and we were not allowed to use built-in functions like Arrays.Sort().
After writing the solutions, the interviewer called each candidate individually to explain the approach they had written and asked them to dry run the code.
In my case, I explained all three solutions correctly and completed the dry runs successfully. After that, the interviewer gave me 4–5 additional DSA questions, which I also solved properly.
Round 3: Technical Interview 2
After clearing the first technical round, this round focused entirely on Object-Oriented Programming (OOPs). I was asked detailed questions and told to write a program that demonstrated all four pillars of OOP. I was also asked to explain each concept thoroughly.
In the same round, they asked questions related to SQL queries and concepts, which I answered confidently.
Round 4: HR Round
This was a simple behavioral interview. I was asked questions like my favorite movie, biggest achievement, and similar personal questions.
Interview questions [1]
Question 1
1. peak element of an Array
2. SubString like (madam)->[mam],[mad]
I applied through university. The process took 1 day. I interviewed at Swabhav (Andheri) in May 2025
Interview
The technical test takes place in a small cramped apartment near the Andheri station (West Side), the workplace itself is just a single table around which the employees sit. Anyways, the technical test itself was quite easy with certain fixed questions asked every time, I'll list them below.
Interview questions [3]
Question 1
Write a function that accepts an array of n integers, array[]. Create a new array, prod[] such that prod[i] is equal to the product of all the elements of array[] except array[i]. The function should have a time complexity of O(n) and handle all possible input scenarios effectively.
Ex. Array{}={2,3,4,5} then prod[]={60,40,30,24}
Create a function that accepts an array of integers and finds second largest element from that array.
Ex. If arr1 = {1,2,3,4}
Then getSecondLargestNumber(arr1) -> 3
Find all duplicate elements in an array of length n.
The array contains elements only between 1 and n (1 and n included)
Element in array can only be present once or twice.
Ex:
Input Output
[1,2,3,2,4] 2
[1,2,2,3,3,4] 2,3
[4,3,6,7,3,1,2] 3
I applied online. I interviewed at Swabhav in May 2025
Interview
I applied through the website, offcampus
So it shortlisting resume based selection of candidates. The shortlisted candidates, are then selected for interview.
Before the interview, they gave 3 coding question to solve, Also you cant use nested loops, in any of the question, if used rejected.
i) Print the leader element in array(check interview experience)
ii) Merge 2 sorted arrays without using extra space(tricky one)
iii) Check if the numbers in the array is palindrome or not
After the coding round, candidates are asked to explain the code itself, and OOPs, resume based questions. If you are selected, you will be mailed for further rounds
Interview questions [1]
Question 1
Explain the codes you solved, OOPs, internships, projects