IndustryBuying.com Operations Engineer Interview Questions, Process, and Tips

I was fine with a lot of dsa

Q1. Related to angular, javascript
Add your answer

Q1. Coding round interview questions
Add your answer

Q1. String, array coding ques Find palindrome, merge two sorted array without using extra space, Write all rest mothods in controller All oops concept, functional interface, static and default method in inter...read more
Add your answer
Q2. Merge two sorted Array Linkedlist delete a node
Ans. 
The question asks to merge two sorted arrays and delete a node in a linked list.
• To merge two sorted arrays, we can use a two-pointer approach.

• To delete a node in a linked list, we need to update the pointers of the previous and next nodes.

• Example: Merge [1, 3, 5] and [2, 4, 6] to get [1, 2, 3, 4, 5, 6].

• Example: Delete node with value 3 from linked list [1, 2, 3, 4, 5] to get [1, 2, 4, 5].
Answered by AI
Add your answer
Q3. String is palindrome or not with recursion
Ans. 
Check if a string is a palindrome using recursion.
• Use recursion to compare the first and last characters of the string.

• If they are equal, recursively check the substring without the first and last characters.

• Continue this process until the string is empty or only has one character.

• If all comparisons are equal, the string is a palindrome.
Answered by AI
Add your answer
Q4. Puzzle related to bucket
Add your answer
Q5. Exception handling
Add your answer

Aptitude questions and two coding question

Q1. Some coding question and some Data structure like Linked list, queue
Add your answer

So after Resume shortlisting you have Round 1 as Programming Test (60%) & Aptitude Test (40%) in which you will be asked 15 aptitude questions and 2 DSA problems. You will get 1 hour to write the test.
DSA problems:
1. Merge 2 sorted arrays
2. find the target sum in given array and return their indexes

Q1. If you clear Round 1 then you will go forward to Round 2 which is one-to-one technical round. In this round you will be asked leetcode problems and some conceptual questions. I was asked to Find the Max su...read more
Add your answer
Q2. Length of Longest Substring with distinct character
Ans. 
Find the length of the longest substring with distinct characters in a given string.
• Use a sliding window approach to keep track of the current substring.

• Maintain a set to store the distinct characters in the current substring.

• Update the maximum length of the substring whenever a longer substring is found.
Answered by AI
Add your answer
Q3. Find Max sum of subarray.
Ans. 
The maximum sum of a subarray is to be found.
• Use Kadane's algorithm to find the maximum sum of a subarray.

• Initialize two variables: maxSum and currentSum.

• Iterate through the array and update currentSum by adding the current element.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• Return maxSum as the maximum sum of a subarray.
Answered by AI
Add your answer

Q1. Last round was Head of engineering round in this you will be asked some technical questions like: Apply Merge sort on a Linked List
Add your answer
Q2. 25 Horses: Google interview problem
Add your answer

Q1. Level order tree traversal
Add your answer
Q2. Find the pair element from the array
Ans. 
Find the pair element from the array
• Iterate through the array and use a hashmap to store elements and their counts

• Check if the current element's complement exists in the hashmap

• Return the pair if found, otherwise return null
Answered by AI
Add your answer