Curefit interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Curefit
3 rounds | 4 Coding problems
Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, System Design, Graphs, Competitive Programming, Operating Systems
Tip

Tip 1 : Have some understanding of Competitive Programming
Tip 2 : Be well versed in Operating systems and other theory subjects
Tip 3 : Always speak out your approach out load and discuss with interviewer before coding

Application process
Where: Campus
Eligibility: 8+ CGPA
Resume tip

Tip 1 : Have some good projects that match with job responsibility
Tip 2 : Mention Competitive Programming only if you are well versed in it. Else they will ask competitive questions.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date3 Aug 2021
Coding problem1

There were 3 coding questios in this round, one of each category - Easy, Medium and Hard. I only remember 1.

1. Next Permutation
Moderate
15m average time
85% success
0/80

#### You have been given a permutation of â€˜Nâ€™ integers. A sequence of â€˜Nâ€™ integers is called a permutation if it contains all integers from 1 to â€˜Nâ€™...

View more
02
Round
Easy
Face to Face
Duration60 Minutes
Interview date5 Aug 2021
Coding problem2

It was a face-to-face interview. The interviewer was very nice and helpful. She only asked me 3 DS questions and did not ask any theoretical questions in this round.

1. Maximum Size Rectangle Sub-matrix With All 1's
Hard
10m average time
80% success
0/120

#### You are given an 'N' * 'M' sized binary-valued matrix 'MAT, where 'N' is the number of row...

View more
Problem approach

Step 1: Using dynamic programming, at every index store the side length of the maximum square whose bottom right corner is the cell with index (i,j) in the original matrix.
Step 2: In this way, we traverse the original matrix once and find out the required maximum size

2. System Design Question

Design a Parking System that returns the number of cars that are parked in the area, given maximum n cars can be parked at one time.

Problem approach

Tip 1 : Create seperate functions for arrival, departure and to get the number of cards parked at that time.
Tip 2 : Make sure departure is not more than arrival.
Tip 3 : Store in a list, the cars that arrive if all the slots are filled.

03
Round
Easy
Video Call
Duration60 minutes
Interview date6 Aug 2021
Coding problem1

It was a theoretical round. I was asked questions related to core-subjects and also questions related to my resume.

1. OS Questions

Explain how Semaphores Work. What are the conditions for a system to be in deadlock?

Problem approach

Tip 1 : Explain slowly and clearly
Tip 2 : If you do not know the answer, say it clearly instead of making wild guessed
Tip 3 : Go through the Deadlock and Semaphore parts in OS properly. They are asked a lot in interviews.

Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 4 problems
Interviewed by Curefit
770 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Curefit
751 views
SDE - Intern
3 rounds | 6 problems
Interviewed by Curefit
1772 views
Software Engineer
3 rounds | 5 problems
Interviewed by Curefit
1313 views
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
11742 views