Imaginnovate Software Developer Intern Interview Questions and Answers

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 Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...read more
Ans. 
Merge overlapping intervals and return sorted list of merged intervals.
• Identify overlapping intervals based on start and end times

• Merge overlapping intervals to form new intervals

• Sort the merged intervals in ascending order of start times
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 individuals in a circle until only one remains, based on a specific counting rule.
• Start counting from position 1, skip K-1 individuals, eliminate the Kth person, and continue until only one person remains.

• The position of the last surviving person can be determined based on the initial numbering and the value of K.

• Example: For N=5 and K=2, the last person standing is at position...read more
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 formed by each bar as the smallest height in the stack times the width.

• Update the maximum area found so far.

• Time complexity can be optimized to O(N) using a stack-based approach.
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 in boundary nodes by including them only once
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The face to face round was held on Google Meet where initially Interviewer asked a DS/Algo problem and then Later Manager Joined and asked about our resume projects in detail.
The time was 10:00 AM

Q1. 
Maximum Sum Rectangle Problem
Given an M x N matrix of integers ARR, your task is to identify the rectangle within the matrix that has the greatest sum of its elements.
Input:
The first line of input co...read more
Ans. 
Find the rectangle within a matrix with the greatest sum of elements.
• Iterate through all possible rectangles within the matrix and calculate their sums

• Use Kadane's algorithm to find the maximum sum subarray for each row combination

• Keep track of the maximum sum found so far
Answered by AI
Add your answer
Q2. 
Rotated Array Minimum Finder
You are provided with a sorted array that has undergone 'K' rotations (the exact value of 'K' is unknown). A rotation involves shifting each element of the array to the right,...read more
Ans. 
Find the minimum number in a rotated sorted array efficiently.
• Use binary search to find the minimum element in the rotated array.

• Compare mid element with the last element to determine which half to search.

• Adjust the search space based on the comparison to find the minimum element efficiently.
Answered by AI
Add your answer

Round duration - 150 minutes
Round difficulty - Medium

Q1. 
Check If Linked List Is Palindrome
Given a singly linked list of integers, determine if the linked list is a palindrome.
Explanation:
A linked list is considered a palindrome if it reads the same forwar...read more
Ans. 
Check if a given singly linked list of integers is a palindrome or not.
• Traverse the linked list to find the middle element using slow and fast pointers.

• Reverse the second half of the linked list.

• Compare the first half with the reversed second half to determine if it's a palindrome.
Answered by AI
Add your answer
Q2. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair (current element, complement) to the result list.

• Sort the result list based on the first element of each pair, and then based on the second element if the first elements are eq...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...read more
Ans. 
Implement a function to find the square root of a number with a specified decimal precision.
• Implement a function that takes two integers N and D as input and returns the square root of N with precision up to D decimal places.

• Use mathematical algorithms like Newton's method to approximate the square root with the required precision.

• Ensure that the difference between the computed result and the true square root is less t...read more
Answered by AI
Add your answer

Round duration - 145 minutes
Round difficulty - Easy

The online assessment consisted of four components, a code debugging section (20 minutes), a coding test (70 minutes), a workstyles assessment (20 minutes) and a reasoning ability section (35 minutes). Code debugging questions were pretty simple and straightforward. The coding test consisted of 2 questions, first was similar to two Sum problem. Second question was similar to find the critical edges in a graph. The workstyles assessment section contained certain behavioural questions.
Reasoning ability section consisted of aptitude questions. This round was basically to check the problem solving skills of the candidate.

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Ans. 
Given an array of integers and a target, find all pairs of elements that add up to the target.
• Iterate through the array and for each element, check if the difference between the target and the element exists in a hash set.

• If it exists, then print the pair (element, target-element), else add the element to the hash set.

• If no pair is found, print (-1, -1).
Answered by AI
Add your answer
Q2. 
Bridges in a Graph Problem Statement
In an undirected graph consisting of V vertices and E edges, your task is to identify all the bridges within the graph. A bridge is an edge which, when removed, result...read more
Ans. 
Identify bridges in an undirected graph by finding edges that, when removed, increase the number of connected components.
• Use depth-first search (DFS) to find bridges in the graph.

• Keep track of discovery time and low time for each vertex during DFS.

• An edge (u, v) is a bridge if low[v] > disc[u].

• Sort and print the bridge pairs in ascending order of vertices.

• Example: If the input graph has vertices 0, 1, 2, 3, 4 and ed...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I was asked two coding questions. First question was related to binary tree and second question was to implement LRU cache.
I had to code both questions. The interviewer asked me the time and space complexity for both the questions.

Q1. 
Circular Array Loop Problem Statement
Given a circular array ARR of size N consisting of positive and negative integers, determine if there is a cycle present in the array. You can make movements based on...read more
Ans. 
Determine if a circular array has a cycle present, following specific movement rules.
• Iterate through the array and check for cycles following the given movement rules.

• Keep track of visited indices to detect cycles.

• Handle both clockwise and counterclockwise movements separately.

• Return 'True' if a cycle is found, 'False' otherwise.
Answered by AI
Add your answer
Q2. 
LRU Cache Implementation
Design and implement a Least Recently Used (LRU) cache data structure, which supports the following operations:
• get(key) - Return the value of the key if it exists in the cach...read more
Ans. 
Implement a Least Recently Used (LRU) cache data structure with get and put operations.
• Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.

• Keep track of the least recently used item and update it accordingly when inserting new items.

• Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

• For get operation, return the value of th...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I was asked two coding questions and some conceptual questions about priority heap data structure. I was able to code the optimized approach for the first question. But second question was a little tricky for me as I had never heard it before. But I explained my approach confidently. The interviewer also helped me and finally I was able to code it.

Q1. 
Connect Ropes with Minimum Cost
Given 'N' ropes, each having different lengths, your task is to connect these ropes into one single rope. The cost to connect two particular ropes is equal to the sum of th...read more
Ans. 
Connect ropes with different lengths into one single rope with minimum cost by merging the smallest ropes first.
• Sort the lengths of ropes in ascending order.

• Merge the two smallest ropes at each step to minimize cost.

• Keep track of the total cost as you merge the ropes.

• Repeat the merging process until all ropes are connected.

• Return the total cost as the minimum cost to connect all ropes.
Answered by AI
Add your answer
Q2. 
Langford Pairing Problem Statement
Given a positive integer N, you are required to generate a list of integers of size 2N such that it contains all the integers from 1 to N, both included, twice. These in...read more
Ans. 
Generate Langford pairing for given N, return 'Valid' if correct, 'Invalid' if not.
• Generate a list of integers of size 2N with all integers from 1 to N twice.

• Arrange integers according to Langford pairing rules.

• Return 'Valid' if pairing is correct, 'Invalid' if not.

• If no valid pairing possible, return list with only -1 element.
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Around 4-5 pm
2 coding questions
7 debugging and output questions
20-30 aptitude questions
A section to test psychology based on various questions and situations.

Q1. 
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...read more
Ans. 
Cloning a linked list with random pointers by creating new nodes rather than copying references.
• Create a deep copy of the linked list by iterating through the original list and creating new nodes with the same values.

• Update the random pointers of the new nodes by mapping the original node's random pointer index to the corresponding new node.

• Ensure the cloned linked list is an exact copy of the original by validating th...read more
Answered by AI
Add your answer
Q2. 
Next Smaller Element Problem Statement
You are provided with an array of integers ARR of length N. Your task is to determine the next smaller element for each array element.
Explanation:
The Next Smalle...read more
Ans. 
Given an array of integers, find the next smaller element for each element in the array.
• Iterate through the array from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a smaller element is found or the stack is empty.

• If no smaller element is found, output -1 for that element.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Timing - 4pm
Just asked one question based on DSA and asked to make the code modular and well indented.
Didn’t even ask for introduction.

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find minimum time to rot all fresh oranges in a grid if adjacent to rotten oranges.
• Use Breadth First Search (BFS) to simulate the rotting process of oranges.

• Keep track of the time taken to rot all fresh oranges.

• If at the end there are still fresh oranges left, return -1 as it is impossible to rot all oranges.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Started at 4pm
Interviewer introduced himself and then asked me for a brief introduction.
Went ahead to ask 2 DSA based questions.

Q1. 
Merge k Sorted Linked Lists
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...read more
Ans. 
Merge k sorted linked lists into one single sorted linked list.
• Create a min-heap to store the heads of all k linked lists.

• Pop the smallest element from the heap and add it to the result list.

• If the popped element has a next element, push it back into the heap.

• Repeat until all elements are merged into a single sorted list.
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Recursively try moving in all directions (up, down, left, right) until reaching the destination.

• Add the current direction to the path and backtrack if the path leads to a dead end.

• Return all valid paths found in alphabetical order as an ar...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very friendly and introduced herself. She told me that she had two coding problems for this round.

Q1. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree in a spiral order, alternating between left to right and right to left.

• Use a queue to keep track of nodes at each level and a flag to switch direction.

• Handle null nodes appropriately to maintain the spiral order traversal.

• Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5
Answered by AI
Add your answer
Q2. 
Find Row With Maximum 1's in a Sorted 2D Matrix
You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...read more
Ans. 
Find the row with the maximum number of 1's in a sorted 2D matrix.
• Iterate through each row of the matrix and count the number of 1's in each row.

• Keep track of the row index with the maximum number of 1's encountered so far.

• Return the index of the row with the maximum number of 1's.

• If multiple rows have the same number of 1's, return the row with the smallest index.
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

This round was held 30 minutes after the 2nd round. There were two interviewers and both introduced themselves. Both of them were friendly and made me comfortable for the round.

Q1. 
Sort Array by Set Bit Count
You have an array of N positive integers. Your goal is to sort this array in descending order based on the number of set bits in the binary representation of each integer.
In ...read more
Ans. 
Sort array of positive integers based on set bit count in descending order.
• Count set bits for each integer using bitwise operations.

• Implement a custom comparator function to sort the array based on set bit count.

• Handle cases where integers have the same set bit count by retaining their original order.
Answered by AI
Add your answer
Q2. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
• Use Breadth First Search (BFS) to simulate the rotting process

• Keep track of the time taken to rot all fresh oranges

• Return -1 if not all fresh oranges can be rotten
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing (6pm - 8pm)
Environment was user friendly 
As usual the online round had two coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 90 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.

A few days after appearing in this round, I was informed that I have been qualified for the next round.

Q1. 
Problem Statement: Sorted Subsequence of Size 3
Given an array composed of N elements, your task is to identify a subsequence with exactly three elements where these elements maintain a strictly increasin...read more
Ans. 
Identify a subsequence of size 3 with strictly increasing order in an array.
• Iterate through the array and keep track of the smallest and second smallest elements encountered so far.

• If a third element greater than both is found, return the subsequence.

• Handle edge cases where no valid subsequence exists.
Answered by AI
Add your answer
Q2. 
Check if Two Trees are Mirror
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Explanation:
Two trees are considered mirror of each other if...read more
Ans. 
Check if two binary trees are mirrors of each other based on specific criteria.
• Compare the roots of both trees.

• Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.

• Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing (10 am- 11 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 90 minutes.

This time I had to face three technical questions and one general question on Amazon.

Q1. 
Convert a Binary Search Tree (BST) to a Greater Sum Tree
Given a Binary Search Tree of integers, transform it into a Greater Sum Tree where each node's value is replaced with the sum of all node values gr...read more
Ans. 
Convert a Binary Search Tree to a Greater Sum Tree by replacing each node's value with the sum of all node values greater than the current node's value.
• Traverse the BST in reverse inorder (right, root, left) to visit nodes in descending order.

• Keep track of the running sum of visited nodes and update each node's value with this sum.

• Modify the BST in place without creating a new tree.

• Example: For input 11 2 29 1 7 15 40 ...read more
Answered by AI
Add your answer
Q2. 
Game of 3 Problem Statement
Help the Ultimate Ninja Ankush by determining how many groups of sizes 2 and 3 can be formed from a given list of integers such that the sum of each group is divisible by 3.
I...read more
Ans. 
Count the number of groups of sizes 2 and 3 with sum divisible by 3 from a given list of integers.
• Iterate through the array and check all possible combinations of 2 and 3 integers.

• For each combination, check if the sum is divisible by 3.

• Keep track of the valid groups and return the count at the end.
Answered by AI
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

It was a coding interview that started with introducing myself. Two questions from data structures were asked.

Q1. 
Matrix Median Problem Statement
You are provided with a matrix containing 'N' rows and 'M' columns filled with integers. Each row is sorted in non-decreasing order. Your task is to find the overall median...read more
Ans. 
Find the overall median of a matrix with sorted rows.
• Merge all elements of the matrix into a single sorted array

• Calculate the median of the merged array

• Handle odd number of elements by directly finding the middle element
Answered by AI
Add your answer
Q2. 
Count Triplets in a Sorted Doubly Linked List
You are provided with an integer X and a non-decreasing sorted doubly linked list consisting of distinct nodes.
Your task is to find and return the count of ...read more
Ans. 
Count triplets in a sorted doubly linked list that sum up to a given value.
• Iterate through the list and for each node, find pairs that sum up to X-nodeValue.

• Use two pointers approach to find pairs efficiently.

• Keep track of count of triplets found while iterating through the list.
Answered by AI
View 1 more answer