Cult.fit Software Developer Intern Interview Questions, Process, and Tips

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

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. 
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
• Iterate through all possible combinations of strings from the list to form the target string.

• Use recursion to try different combinations of strings.

• Check if the current combination forms the target string.

• Return true if a valid combination is found, otherwise return false.
Answered by AI
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. 
The task is to minimize the cost of breaking a board into smaller squares by making horizontal and vertical cuts.
• Iterate through all possible horizontal and vertical cuts to find the minimum cost

• Use dynamic programming to optimize the solution by storing intermediate results

• Calculate the total cost by summing up the costs of all cuts
Answered by AI
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. 
Determine if a valid balanced sequence can be achieved by replacing 'X's with suitable brackets.
• Iterate through the string and keep track of the count of opening and closing brackets.

• If at any point the count of closing brackets exceeds the count of opening brackets, return False.

• If all 'X's can be replaced to form a valid balanced sequence, return True.
Answered by AI
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. 
Given a Balanced BST and a target integer, determine if there exists a pair of nodes with sum equal to the target.
• Traverse the BST in-order to get a sorted array of values.

• Use two pointers approach to find the pair with sum equal to target.

• Consider edge cases like negative numbers and duplicates.

• Time complexity can be optimized to O(n) using a HashSet to store visited nodes.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Had to solve 2 easy coding problems. Could be solved in 25 minutes if you are well prepared with DS-Algo.

Q1. 
Job Scheduling Problem Statement
Given a list of ‘N’ jobs, each associated with a deadline and a profit obtainable if completed by the deadline, schedule the jobs to maximize the total profit. Each job ta...read more
Ans. 
The job scheduling problem involves maximizing profit by scheduling jobs with deadlines and profits optimally.
• Sort the jobs in decreasing order of profit.

• Iterate through the sorted jobs and schedule them based on their deadlines.

• Keep track of the maximum profit achievable by scheduling jobs within their deadlines.

• Example: For input Jobs: 'A'(profit=20, deadline=1), 'B'(profit=30, deadline=2), 'C'(profit=40, deadline=2)...read more
Answered by AI
Add your answer
Q2. 
Water Flow Problem Statement
Given a matrix A with dimensions 'N' x 'M', where each cell represents the height of water in that location, determine the coordinates from which water can flow to both the Pa...read more
Ans. 
Given a matrix representing water heights, find coordinates where water can flow to both Pacific and Atlantic oceans.
• Create a function that performs a depth-first search to find coordinates where water can flow to both oceans.

• Keep track of visited cells and check if a cell can flow to both oceans by comparing its height with neighboring cells.

• Return the coordinates in lexicographical order as the output.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Questions on Computer science subjects like OS, DBMS, OOP

Q1. What are the different types of memory in operating systems?
Ans. 
Different types of memory in operating systems include RAM, ROM, virtual memory, cache memory, and registers.
• RAM (Random Access Memory) - volatile memory used for storing data that is actively being used by the CPU

• ROM (Read-Only Memory) - non-volatile memory that stores firmware and boot-up instructions

• Virtual Memory - a memory management technique that uses disk space as an extension of RAM

• Cache Memory - high-speed me...read more
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

General Discussion on Resume, some in depth questions on a project of interviewer's choice.