Emergent Interview Experience
Emergent Interview Experience for Experienced SDE - 1, Mar 2026
SDE - 1
Experienced
Naukri
2.5 months
NA, (Salary package: 28 LPA)
Computer Science Engineering
1 Rounds
Application Experience
I applied on Naukri.com. HR called to ask if I was interested, and if yes, asked about my current and expected salary. Then, they explained the process.
Preparation
Topics Prepared: Arrays, Dynamic Programming, Monotonic Stack, Two Pointers, Linked List
Preparation Tips
Tip 1: Prepare all standard DSA questions thoroughly. Tip 2: Prepare common system design topics. For ex - Distributed Lock. Tip 3: Practice explaining your solution beforehand.
Resume Tips
Tip 1: Have your tech stack at the top of your resume for better visibility. Tip 2: Highlight your achievements clearly to make your profile stand out.
Interview Rounds (1)
Detailed breakdown of each evaluation round, questions asked, and candidate approaches.
Round 1 — Video Call
Problems & Questions Asked (3)
Palindrome number
Check whether a given number ’n’ is a palindrome number. Note : Palindrome numbers are the numbers that don't change when reversed. You don’t need to print anything. Just implement the given function. Example: Input: 'n' = 51415 Output: true Explanation: On reversing, 51415 gives 51415. Input Format: The first and only line of the input contains the number 'n'. Output format: Return a boolean value True or False.
First gave naive approach of converting the integer to a string and checking if the string is a palindrome or not. Then told about the optimized approach of checking the last half of the string to match the first half such that to only compare the halfs of the strings.
4Sum
You are given an array ‘NUMS’ of length ‘N’ . You are also given an integer ‘TARGET’ . Return an array of all the unique quadruplets [ ‘NUMS[ a ]’, ‘NUMS[ b ]’, ‘NUMS[ c ]’, ‘NUMS[ d ]’ ] with the following conditions: i. 0 <= a, b, c, d < ‘N’ and a, b, c, and d are distinct. ii. NUMS[ a ] + NUMS[ b ] + NUMS[ c ] +NUMS[ d ] = TARGET Return the array in any order. Note: (NUMS[ a ], NUMS[ b ], NUMS[ c ], NUMS[ d ]), (NUMS[ a ], NUMS[ d ], NUMS[ c ], NUMS[ b ]), (NUMS[ a ], NUMS[ c ], NUMS[ b ], NUMS[ d ])... all of them are treated or considered the same quadruplets. Two quadruplets are different if there is any integer in one quadruplet which is not in the other. The solution will be verified by the number of valid quadruplets returned. In the output, only the number of valid quadruplets will be printed. Example: Input: ‘N’ = 5, ‘TARGET’ = 5, ‘NUMS’ = [ 1, 2, 1, 0, 1 ] Output: 1. There is only one unique quadruplet with sum = 5 and that is [1, 2, 1, 1]. Input Format : The first line contains two integers, ‘N’ and ‘TARGET’, denoting the length of the array ‘NUMS’ and an arbitrary integer. The second line contains ‘N’ space-separated integers. Output format : Prints the number of unique quadruplets. Note : You don't need to print anything. It has already been taken care of. Just implement the given function.
The idea is to reduce the 4Sum problem into a combination of sorting + two pointers, similar to how we solve 3Sum. First, I sort the array. This helps in: Efficient traversal Avoiding duplicates Using the two-pointer technique Then, I fix the first two elements using two loops: The outer loop picks the first number i The inner loop picks the second number j Now, for the remaining two elements, I use a two-pointer approach: One pointer (left) starts just after j Another pointer (right) starts from the end of the array
Selection Perspective
I was rejected. I was able to solve the DSA question, and two common topics related to distributed systems were also asked, which I answered, but I didn’t hear back afterward.
Key Preparation Tips
Prepare DSA thoroughly.
Practice aptitude and puzzle-based questions.
Have at least two good projects on your resume.
Be prepared to explain your projects clearly.
Practice coding problems involving Arrays, Binary Search, DP and Recursion.
Prepare common HR questions such as Tell me about yourself and Who is your role model?
More Interview Experiences
BrowserStack
SDE - 1
BrowserStack Interview Experience for Experienced SDE - 1, Mar 2026
Intuit
SDE - 1
Intuit Interview Experience for Experienced SDE - 1, Jan 2026
Incedo
SDE - 1