CureFit SDE Intern Interview Experience (Virtual and On-Campus) – August 2020

Recently, CureFit, a startup, came for on-campus placement in our college. 
The test was simple with two questions:

1) Given an array of string representing words and a string. Check if the string is made by appending words from the array.
2) The same question posed in a different way: https://www.geeksforgeeks.org/minimum-cost-cut-board-squares/  (They didn’t even bother to change the example)

The test was for 1 hour and 30 minutes. My test was done within 30-40 minutes. 
Out of 300 students, about 50 were shortlisted.

First Round Of Interview

The interviewer asked me to introduce myself. Then she asked me to solve two questions –



1) Given the arrival and departure time of cars, find the minimum number of parking spots that the building should have.

2) Given a binary array, find the square with the biggest length, considering only the perimeter is covered by 1. (The insides of the square may contain 0)

I was able to solve the given problems.

5-6 students were removed from the process after this round.

Second Round Of Interview

In this the interviewer asked me questions from my Resume, asking about my internship experience and projects. Then he asked me to implement stack using queue and queue using stack.

Again, a few more students were removed from the process. About, 10-12 of us were chosen for the final round.

Third Round Of Interview

It was another technical round. The questions were comparatively hard. I was given a few encoded Strings and their meanings. Then, I was given a string as the message we’ve received. I was supposed to decode as many words as can be decoded. I implemented it using tries.

In the end, a total of 3 students were selected, I wasn’t one of them.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.