zupee logo
Zupee· SDE 1

Zupee | SDE 1 | Gurgaon | March 2022 [Selected]

Result
Offer
Location
Gurgaon
Experience
0.75 years
Posted
28 Apr 2022
318 reads

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.

How it went

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.

Questions asked (9)

  1. 01

    Number of Islands

    Data Structures & Algorithms · Medium

    Given an m x n 2D binary grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

    Open the problem
  2. 02

    Remove Duplicates from Sorted Array II

    Data Structures & Algorithms · Medium

    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.

    Open the problem
  3. 03

    Maximum Overlapping Intervals

    Data Structures & Algorithms · Medium

    Given different intervals, the task is to print the maximum number of overlap among these intervals at any time.

  4. 04

    Non-Crossing Handshakes on a Round Table

    Data Structures & Algorithms · Hard

    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.

  5. 05

    First Repeating Element in Array

    Data Structures & Algorithms · Easy

    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).

  6. 06

    Tell me about yourself

    Behavioral

    Introduction.

  7. 07

    Why are you switching jobs?

    Behavioral

    Why switch ?

  8. 08

    What will you do if similar situation arise here?

    Behavioral

    What will you do if similiar situation arise here ?

  9. 09

    What are you looking for?

    Behavioral

    What exactly are you looking for ?

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Zupee recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!