Cult.fit Interview Questions, Process, and Tips

Q1. How will you handle angry customer
Add your answer
Q2. How will you handle a customer who wants to lose weight
Ans. 
I would offer personalized fitness and nutrition plans to help the customer achieve their weight loss goals.
• Listen to the customer's goals and concerns

• Offer personalized fitness and nutrition plans

• Provide ongoing support and motivation

• Track progress and make adjustments as needed
Answered by AI
View 1 more answer

Q1. Why you wanted to this company?
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

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.

Q1. 
Merge Intervals Problem Statement
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...read more
Ans. 
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)
Answered Anonymously
Add your answer
Q2. 
Josephus Problem Statement
Consider 'N' individuals standing in a circle, numbered consecutively from 1 to N, in a clockwise direction. Initially, the person at position 1 starts counting and will skip K-...read more
Ans. 
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)
Answered Anonymously
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

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.

Q1. 
Largest Rectangle in Histogram Problem Statement
You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.
...read more
Ans. 
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 interviewer was pleased with this approa
Answered Anonymously
Add your answer
Q2. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
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)
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

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.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.
Input:
The first line of input contains the size of the arr...read more
Ans. 
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.
Answered Anonymously
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
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.
Answered Anonymously
Add your answer