There was a total of 4 rounds for the SDE role in Saavn.
Online round: The online round was open to BTech CSE, BTech EE, MTech CSE, and MTech EE and the CGPA cutoff was 7. Questions asked in this round:
- Function to check if a singly linked list is palindrome
- Find the largest rectangle of 1’s with swapping of columns allowed
- Boundary Traversal of binary tree
All the students who solved 2 questions were shortlisted for further rounds. 4 students were selected.
2nd round: The interviewers were friendly. He asked me to explain every project which I mentioned in my resume. One of my projects was on deep learning, he asked me some questions on deep learning. And he asked me 4 coding questions, we were expected to tell the approach which we are using. He was asking questions at each and every step. Questions asked in this round:
- Find the closest pair from two sorted arrays
- Count distinct elements in every window of size k
- Longest subsegment of ‘1’s formed by changing at most k ‘0’s
- Count Negative Numbers in a Column-Wise and Row-Wise Sorted Matrix
2 students were selected after this round.
3rd round: The interviewer asked me to introduce myself. Then some coding questions were asked and he asked me to code it. Keep in mind the base cases while writing the code. Questions asked in this round:
- Find the first duplicate in an array.
- Using extra space and traversing the array once.
- Without using extra space.
- Given an array and a number k, form a subsequence with most number of elements such that the sum of any pair in that subsequence should not be divisible by k.(check for all the base cases)
- Given an array A[] and a number x, check for pair in A[] with sum as x
- A puzzle question
2 students were selected after this round.
HR round: She first asked me to introduce myself, a few questions about my projects, why do you want to work with Saavn and what do you like about us and some other behavioural questions.
2 students were given the opportunity to work as Full-time SDE and I was one of them.