'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Curefit interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Curefit
3 rounds | 6 Coding problems
Interview preparation journey
Preparation
Duration: 3 months
Topics: Dynamic Programming, Greedy Techniques, Data Structures, OOPs, DBMS, Graph Theory
Tip

Tip 1 : Prepare OS,DBMS,OOPs too
Tip 2 : Mention at-least one project or past work experience in your resume
Tip 3 : Try maintaining 8+ CGPA as sometimes shortlist is done based on CGPA
Tip 4 : Try past interview questions from Leetcode,Interviewbit.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Try to Keep Resume 1 Pager
Tip 2 : Have atleast one project or past work experience mentioned
Tip 3 : Don't put false things on Resume as questions are asked in detail from Resume

Interview rounds
01
Round
Medium
Online Coding Test
Duration45 Minutes
Interview date10 Nov 2020
Coding problem2

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

1. Merge Intervals
Moderate
20m average time
80% success
0/80

#### You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.

View more
Problem approach

I firstly sorted the intervals based on their second values and then I considered each interval if it overlaps with the previous one or not.
Time Complexity : O(nlogn)
Space complexity : O(n)

2. Josephus
Moderate
30m average time
70% success
0/80

#### â€˜Nâ€™ people are standing in a circle numbered from â€˜1â€™ to â€˜Nâ€™ in clockwise order. First, the person numbe...

View more
Problem approach

Firstly I tried recursively to fix my position to every place and check if I am remaining till Last to survive. But the Interviewer asked me to do better, then I thought of this question as a circular Linked List where in each step length decreases by one. Then I derived Mathematical formula for the position to survive till last with :
Time Complexity : O(n)
Space Complexity : O(n)

02
Round
Medium
Coding Test - Pen and paper
Duration75 minutes
Interview date14 Nov 2020
Coding problem2

A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.

1. Largest rectangle in a histogram
Hard
25m average time
75% success
0/120

#### You have been given an array/list 'HEIGHTS' of length â€˜N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of the histogram ...

View more
Problem approach

Firstly I tried brute force considering all possible left and right pointer and checking what all rectangle areas we can get and taking maximumm from them.
But the interviewer wanted better time complexity than O(n*n)
So I used two arrays Left and right and kept check of next shorter rectangle index to the present one.
This had Time Complexity of O(n) and Space Complexity : O(n)
The...

View more
2. Boundary Traversal
Hard
20m average time
85% success
0/120

#### The boundary nodes of a binary tree include the nodes from the left and right boundaries and the leaf nod...

View more
Problem approach

I made three functions as the order given in Problem statement and did the Traversals in the same way making sure to cover all the edge cases .
This is similar to Preorder/Postorder/Inorder type problems.
Time Complexity : O(n)

03
Round
Easy
Face to Face
Duration60 minutes
Interview date16 Nov 2020
Coding problem2

The face to face round was held on Google Meet where initially interviewer asked a DS/Algo problem. Later the manager joined and asked about our resume projects in detail.
The time was 10:00 AM.

1. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80

#### For example, given the array [34, -50, 42, 14, -5, 86], the maximum ...

View more
Problem approach

First I tried brute force approach with taking sum between all left top corner and bottom right corners rectangle formed .
This had time complexity of O(n^4).
Then I brought down the time complexity to O(n^3) by using Kadane's Algorithm and coded it on Docs Shared.

2. Search In Rotated Sorted Array
Moderate
30m average time
65% success
0/80

#### Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated ...

View more
Problem approach

Firstly I gave the solution of Linear Search but he asked to implement binary search with all corner cases .
So I implemented binary search for finding the number of rotations array has went through.

Start a Discussion
Similar interview experiences
SDE - Intern
4 rounds | 4 problems
Interviewed by Curefit
645 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Curefit
647 views
SDE - 1
3 rounds | 4 problems
Interviewed by Curefit
539 views
SDE - Intern
3 rounds | 4 problems
Interviewed by Curefit
289 views
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
10792 views