Cult.fit Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

It was early in the morning from 8 am. It was a test from home itself. It was a conducted on HackerEarth and was of 60 minutes duration. 30 students were shortlisted. I was also shortlisted.

Q1. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. Brute Force
In this solution, we will try to generate all prefixes and If we want a prefix present in the string then we will recur for the remaining string. 
Steps:
1. Store all strings of A on the hash map.
2. Declare and call function wordBreakHelper which will take a single argument string.
wordBreakHelper(s):
1. Base case if the length of the string is 0 then return true.
2. Run a loop from i = 1 to the length of the string:
   • If ...read more
Answered Anonymously
Add your answer
Q2. 
Break The Board Problem Statement
Your task is to break a board of given dimensions 'L' by 'W' into 'L' * 'W' smaller squares, ensuring the total cost of breaking is minimized.
Input:
The first line con...read more
Ans. Greedy Approach
This problem can be solved using the greedy approach. By greedy, we mean that we simply start cutting the board along every horizontal and vertical line. But this cutting needs to be in a specific manner. Let’s see how we can do this.
 
• Start by making an integer variable minCost and initialize it to 0.
• Now we talked about cutting the board in a specific manner. This specific manner will involve minim...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

This round was scheduled around 12 pm. It was a virtual round with one interviewer who was a Cure.Fit employee. My resume was scanned and a brief introduction was asked. After that a question was put up which I had to find solution to and code it. In the end, I asked questions regarding the type of projects they work on etc. I was selected for the next round

Q1. 
Balanced Sequence After Replacement
Given a string of length 'N' containing only the characters: '[', '{', '(', ')', '}', ']'. At certain places, the character 'X' appears in place of any bracket. Your go...read more
Ans. Using Recursion
The idea is to use stack data structure and is pretty much similar to the algorithm where we check if the expression is balanced or not. 
 
We mainly have 3 conditions to fulfil i.e. 
1. Opening bracket.
2. Closing bracket.
3. Character ‘X’.
    
Algorithm:
• Initialise a stack, say s.
• We traverse the whole string such as,
1. If all the elements of the string are traversed, return true if the stack is empty. Ot...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

As soon as the HR round got over. I was asked to sit for my next round. It was again a problem solving round along with Data Structure questions in the end. The interviewer was an employee of Cure.Fit and after a brief introduction, I was given a question. After solving it, I was asked questions on Hashmaps, their implementation, time complexities. Finally, I was selected :)

Q1. 
Pair with Given Sum in a Balanced BST Problem Statement
You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such ...read more
Ans. Checking For Every Node
The idea is to fix one node and try to find, if there exists, a node whose sum along with the fixed node is equal to the given ‘target’.
 
The steps are as follows:
• We will use a helper function ‘findTargetPairHelper’ to fix each node.
• ‘findTargetPairHelper’ takes ‘mainRoot,’ ‘curRoot’ and ‘target’ as input parameters, ‘mainRoot’ is the root of the given tree, ‘curRoot’ is the node we are fixing...read more
Answered Anonymously
Add your answer

Q1. Regarding your qualifications
Add your answer
Q2. Why you want to join
Add your answer

Q1. Past background and experience
Add your answer
Q2. About your self past qualification
Add your answer