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

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

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. 
I used maxheap to keep track of max element  [(frequency, taskname),...] and queue to keep track of used elements [(time last used, (frequency, taskname)),...] I used t as current time. I removed max from heap, added max to result , updated the timestamp and pushed to queue each time Then I checked from queue if I could use it based on timestamp, if yes I pushed to heap and repeated above step again
Answered Anonymously
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. 
Hint: DFS on matrix
I had solved this problem before. Didn't require much thinking on the spot. Always prepare company archives.
Answered Anonymously
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. 
Tip 1 : Do not use bookish language
Tip 2 : Use examples
Tip 3 : Be to the point
Answered Anonymously
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.