Cult.fit Interview Questions, Process, and Tips for Freshers

Find lexicographically next Greater Permutation.
Second question was a sorting technique question. Given an array the basic idea of the problem was to find the minimum difference between the number and the next smaller number on the right side of the array

Q1. The question was to find a sorted sub-sequence of size 3. The Interviewer was expecting a solution in linear time. It took almost 15 to 20 minutes for me to come up with the linear time solution. In the en...read more
Add your answer
Q2. Other questions were related to Map Data Structure. What is Map? Explain how ordered Map works.. etc.
Add your answer

Q1. What is your Prior experience in particular sector?
Add your answer
Q2. How fitness brands are competing with the competitions?
Ans. 
Fitness brands are competing by offering unique experiences, personalized training, and innovative technology.
• Brands are creating unique experiences to differentiate themselves from competitors.

• Personalized training programs are becoming more popular to cater to individual needs.

• Innovative technology such as wearables and fitness apps are being integrated into workouts.

• Brands are also focusing on community building and...read more
Answered by AI
Add your answer

Q1. It was all about salary negotiation.
Add your answer

Q1. Introduce yourself
Add your answer
Q2. If experience why are leaving pervious company
Add your answer
Q3. Ask about real-time situation to check problem solving skills
Add your answer
Q4. Checking how you handle pressure and stress situation
Add your 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. 
Merge overlapping intervals and return sorted list of merged intervals by start time.
• Sort the intervals based on start time.

• Iterate through intervals and merge overlapping intervals.

• Return the list of merged intervals sorted by start time.
Answered by AI
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. 
The Josephus problem involves eliminating every Kth person in a circle until only one person remains. Determine the position of the last person standing.
• Use a circular linked list to simulate the circle of people.

• Iterate through the list, skipping K-1 nodes and removing the Kth node until only one node remains.

• Return the position of the last remaining node.

• Example: For N=5, K=2, the last person standing is at position
Answered by AI
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. 
Compute the area of the largest rectangle that can be formed within the bounds of a given histogram.
• Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

• Calculate the area of the rectangle by considering the current height and the width of the rectangle.

• Update the maximum area found so far as you iterate through the histogram.

• Handle edge cases like when the stack is empty or when ...read more
Answered by AI
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. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in top-down order

• Traverse the leaf nodes in left-right order

• Traverse the right boundary nodes in bottom-up order

• Handle duplicates by including them only once
Answered by AI
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. 
Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.
• Use Kadane's algorithm to find the maximum subarray sum in O(N) time.

• Initialize two variables: max_sum and current_sum to keep track of the maximum sum found so far and the current sum of the subarray being considered.

• Iterate through the array and update current_sum by adding the current element or starting a new subarray if the current...read more
Answered by AI
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. 
Search for integers in a rotated sorted array efficiently using binary search.
• Use binary search to efficiently find the index of each query integer in the rotated sorted array.

• Handle the rotation of the array by finding the pivot point first.

• Check which half of the array the query integer falls into based on the pivot point.

• Return the index of the query integer if found, else return -1.
Answered by AI
Add your answer