Zupee interview experience Real time questions & tips from candidates to crack your interview

Backend developer intern

Zupee

1 rounds | 2 Coding problems

Anonymous

Fresher | Jan 2024

Rejected

Interview preparation journey

Journey

I began my coding journey in my second year by taking a course on C++ basics and Data Structures and Algorithms (DSA) through Coding Ninjas. After completing the course, I started using coding platforms to practice DSA and engage in competitive programming.

Application story

I came to know that there was an opening for an intern position in the company. I applied through a referral, and they shortlisted some candidates for the interviews.

Why selected/rejected for the role?

I applied through a referral, and I have a good rating on coding platforms as well. This might be the criteria for my interview shortlist.

Preparation

Duration: 3 months

Topics: Data Structures, Operating System, OOPS, DBMS, Algorithms, Dynamic Programming

Tip

Tip 1: Practice more and more questions (consistency matters in coding).

Tip 2: Participate in contests as well.

Tip 3: Prepare at least 2-3 good projects.

Application process

Where: Referral

Eligibility: Need good rating on coding platforms and knowledge of backend

Resume tip

Tip 1: Have some projects on your resume.

Tip 2: Do not put false information on your resume (they will catch you eventually).

Interview rounds

Round

Medium

Face to Face

Duration50 minutes

Interview date8 Jan 2024

Coding problem2

It was around morning time (8:30 am - 9:30 am). The interviewer was an SDE 2 at Zupee. He asked me 2 coding problems, both of medium level.

1. Next Greater Element

Moderate

20m average time

90% success

0/80

Asked in companies

Given an array arr[ ] of n elements, the task is to find the next greater element for each element of the array in the order of their appearance. The next greater element of an element in the array is the nearest element on the right that is greater than the current element. If there does not exist a next greater element for the current element, then the next greater element is -1. For example, the next greater element of the last element is always -1.

Problem approach

we can use two loops to find the Next Greater Element for every integer it will be on O(n2) time complexity
but we can do this in less TC using stacks
The idea is to store the elements for which we have to find the next greater element in a stack and while traversing the array, if we find a greater element, we will pair it with the elements from the stack till the top element of the stack is less than the current element.

Try solving now

2. Maximum subarray

Moderate

55m average time

35% success

0/80

Asked in companies

Given an array A[] consisting of N scores, write a program to find max score subarray.

Problem approach

We can solve this question by storing the max at each iteration instead of separately calculating it at the end.
Thus, we only need to maintain curMax which is the maximum subarray sum ending at i and maxTillNow which is the maximum sum we have seen till now. And this way of solving this problem is what we popularly know as Kadane's Algorithm

Try solving now