Impactsure Technologies Interview Questions and Answers

Q1. Find cousine of a node in a binary tree
Ans. 
Find the cousin of a node in a binary tree.
• Cousins are nodes at the same level but with different parents.

• Traverse the tree to find the level and parent of the given node.

• Traverse the tree again to find all nodes at the same level with different parents.

• Return the cousin node if found, else return null.
Answered by AI
Add your answer
Q2. One question on 2 pointer appraoch
Ans. 
The two-pointer approach is an efficient technique for solving problems involving arrays or linked lists by using two indices.
• 1. The two-pointer technique involves using two pointers to traverse the data structure, often from opposite ends.

• 2. It is commonly used in problems like finding pairs in a sorted array that sum to a specific value.

• 3. Example: Given a sorted array [1, 2, 3, 4, 5] and a target sum of 6, use point...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Aptitude+Coding
Both the rounds were easy only student should have confidence in himself.
Coding Round 3 question-:
1.Array related
2.Level order traversal
3. Graph

Q1. 
Sum At Kth Level
Given the root of a binary tree, calculate the sum of all nodes located at the Kth level from the top. Consider the root node as level 1, and each level beneath it sequentially increases ...read more
Ans. 
Calculate the sum of nodes at the Kth level of a binary tree given the root.
• Traverse the binary tree level by level using BFS.

• Keep track of the current level while traversing.

• Sum the nodes at the Kth level and return the result.
Answered by AI
Add your answer
Q2. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array of integers.
• Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

• At each index, decide whether to include the current element in the subarray or start a new subarray.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

• Example: For arr...read more
Answered by AI
Add your answer
Q3. 
Number of Triangles in an Undirected Graph
Determine how many triangles exist in an undirected graph. A triangle is defined as a cyclic path of length three that begins and ends at the same vertex.
Input...read more
Ans. 
Count the number of triangles in an undirected graph.
• Iterate through all possible triplets of vertices to check for triangles.

• Use the adjacency matrix to determine if there is an edge between vertices.

• Count the number of triangles found in the graph and return the total count.
Answered by AI
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

Were were given the test link and 3 days, we could take the test anytime during these three days and diffrent candidates got different questions in their tests. 
The online assessment consists of the following sections:
Code Debug: In this portion of the online assessment, you will be asked to find bugs in seven pieces of code. 

Coding Test: This portion of the online assessment consists of DS algo questions. There were 2 questions.

Work Styles Assessment: This is built around Amazon’s Leadership Principles, you have to choose what extent a provided statement represents your work style

Logical Ability: During this logical ability section, you will be asked a series of problem solving multiple choice questions.

Once you move to next section, you cannot go back to previous one.

Q1. 
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 to the result list.

• Sort the result list based on the criteria mentioned in the problem statement.
Answered by AI
Add your answer
Q2. 
Running Median Problem
Given a stream of integers, calculate and print the median after each new integer is added to the stream.
Output only the integer part of the median.
Example:
Input:
N = 5  
Stre...read more
Ans. 
Calculate and print the median after each new integer is added to the stream.
• Use a min heap to store the larger half of the numbers and a max heap to store the smaller half.

• Keep the sizes of the two heaps balanced to efficiently calculate the median.

• If the total number of elements is odd, the median is the top element of the max heap.

• If the total number of elements is even, the median is the average of the top elements...read more
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.

Q1. 
Remainder When Divided By 11 Problem Statement
Determine the remainder when a given number, 'N' in the form of a string, is divided by 11.
Input:
The first line contains an integer 'T' denoting the numb...read more
Ans. 
Find the remainder when a given number is divided by 11.
• Convert the string number to an integer for easier calculation.

• Use the property that the remainder when a number is divided by 11 is the same as the remainder when the alternating sum of its digits is divided by 11.

• Repeat the process until you get a single digit number as the result.
Answered by AI
Add your answer
Q2. 
Missing Number Problem Statement
You are provided with an array named BINARYNUMS consisting of N unique strings. Each string represents an integer in binary, covering every integer from 0 to N except for ...read more
Ans. 
Given an array of unique binary strings representing integers from 0 to N, find and return the missing integer's binary representation.
• Iterate through the binary strings and convert them to integers.

• Calculate the sum of integers from 0 to N using the formula (N * (N + 1)) / 2.

• Subtract the sum of the integers in the array from the total sum to find the missing integer.

• Convert the missing integer to binary and return it ...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.

Q1. 
Fish Eater Problem Statement
In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The sizes of these fishes are provided in an array c...read more
Ans. 
Given a river with fishes of different sizes and speeds, determine how many fishes survive after encounters.
• Iterate through the array of fishes and simulate encounters between fishes to determine survivors

• Use a stack to keep track of surviving fishes

• Compare sizes of fishes to determine which fish eats the other
Answered by AI
View 1 more answer
Q2. 
Fishmonger Toll Optimization Problem
A fishmonger needs to transport goods from a port to a market, crossing multiple states each requiring a toll. The goal is to minimize the toll costs while ensuring th...read more
Ans. 
The Fishmonger Toll Optimization Problem involves minimizing toll costs while ensuring timely delivery of goods from a port to a market.
• Given 'N' states and a time limit 'M', find the smallest toll amount to reach the market from the port within the given time.

• Use dynamic programming to solve the problem efficiently.

• Consider both time and toll matrices to calculate the minimum toll cost.

• Return -1 if it is not possible ...read more
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.

Q1. 
Battalions and Tanks Problem Statement
Given 'N' battalions and 'M' tanks, along with an array representing the number of soldiers in each battalion, you need to allocate the tanks such that the maximum r...read more
Ans. 
Allocate tanks to battalions to minimize maximum ratio of soldiers per tank.
• Calculate the ratio of soldiers to tanks for each battalion.

• Sort the ratios in ascending order.

• Return the maximum ratio from the sorted list.
Answered by AI
Add your answer
Q2. 
Diagonal Traversal of a Binary Tree
Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal.
Example:
Explanation:
Consider lines at a...read more
Ans. 
Diagonal traversal of a binary tree involves printing nodes at the same diagonal in a specific order.
• Traverse the tree in a diagonal manner, starting from the root node and moving towards the right child and then the left child.

• Use a queue to keep track of nodes at each level of the tree.

• Print the nodes in the order they are encountered while traversing the tree diagonally.
Answered by AI
Add your answer