Zupee | SDE 1 | Gurgaon | March 2022 [Selected]
Summary
I interviewed for an SDE 1 position at Zupee in Gurgaon, which involved three technical rounds and one HR round. I successfully received an offer after completing all the rounds.
Full Experience
I was contacted by a recruiter on LinkedIn and received a call the next day for an SDE 1 position. The interview process consisted of three technical rounds, each lasting an hour, followed by a final HR round.
Round 1
I had to write working code for two problems:Round 2
This round also involved coding two problems:- Given different intervals, the task is to print the maximum number of overlap among these intervals at any time.
- We have n persons sitting on a round table. Any person can do a handshake with any other person. In how many ways these n people can make handshakes so that no two handshakes crosses each other.
Round 3
I was asked to find the first repeating element in an array of integers with O(n) time and O(n) space complexity. The interviewer then inquired about the languages I'd worked with. Since I wasn't familiar with Rust, I was asked to code the solution in Rust, with permission to use Google for syntax while sharing my screen.HR Round
The HR round covered standard questions such as my introduction, reasons for switching jobs, how I'd handle similar situations at Zupee, and my career expectations.Overall, it was a positive experience and I received an offer.
Interview Questions (9)
Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements. Return k after placing the final result in the first k slots of nums.
Given different intervals, the task is to print the maximum number of overlap among these intervals at any time.
We have n persons sitting on a round table. Any person can do a handshake with any other person. In how many ways these n people can make handshakes so that no two handshakes crosses each other.
Given an array of integers, find the first repeating element in it. We need to find the element that occurs more than once and whose index of first occurrence is smallest. Expected time complexity - O(n), Expected space complexity - O(n).
Introduction.
Why switch ?
What will you do if similiar situation arise here ?
What exactly are you looking for ?