24/7 Customer Interview Questions, Process, and Tips for Freshers

Round duration - 90 mintues
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. 
Reverse Stack with Recursion
Reverse a given stack of integers using recursion. You must accomplish this without utilizing extra space beyond the internal stack space used by recursion. Additionally, you ...read more
Ans. 
Reverse a given stack of integers using recursion without using extra space or loops.
• Use recursion to pop all elements from the original stack and store them in function call stack.

• Once the stack is empty, push the elements back in reverse order using recursion.

• Make use of the top(), pop(), and push() stack methods provided.

• Example: If the input stack is [1, 2, 3], after reversal it should be [3, 2, 1].
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Environment was very friendly but questions asked are very hard.

Q1. 
Maximum Subarray Problem Statement
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...read more
Ans. 
Find the subarray with maximum sum in an array, considering length if sums are equal.
• Iterate through the array and keep track of the maximum sum subarray seen so far

• Consider the length of subarrays if the sums are equal to determine the maximum subarray

• Handle edge cases like negative numbers in the array
Answered by AI
Add your answer
Q2. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge, return -1 if no merging occurs.
• Traverse both lists to find the lengths and the last nodes

• Align the starting points of the longer list with the shorter list

• Traverse both lists simultaneously until a common node is found
Answered by AI
Add your answer