Elgin Industries Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Easy

Q1. 
Maximise the OR Sum Problem Statement
You are provided with two arrays of positive integers. The goal is to select two sub-arrays of the same length, one from each of the provided arrays, such that the su...read more
Ans. 
Select two sub-arrays of the same length from two arrays to maximize the sum of bitwise OR.
• Iterate through all possible sub-arrays of the same length from both arrays.

• Calculate the bitwise OR sum for each pair of sub-arrays.

• Keep track of the maximum sum obtained.

• Return the maximum sum found.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Q1. 
Maximum of All Subarrays of Size K
You are provided with an array A containing N integers. Your task is to determine the maximum element in every contiguous subarray of size K as you move from left to rig...read more
Ans. 
Find maximum element in every contiguous subarray of size K in an array.
• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque that are out of the current window and add the maximum element to the result.

• Return the result array containing maximum elements in each subarray of size K.
Answered by AI
Add your answer