IndustryBuying.com Sourcing Engineer Interview Questions and Answers

Q1. Tell about ur self
Add your answer
Q2. Why u leave last company
Add your answer
Q3. Why u join us
Add your answer

Q1. Salary expectations
Add your answer

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Total of 8 questions:

4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.

Q1. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of the running sum modulo K.

• Use a hashmap to store the frequency of remainders.

• For each prefix sum, check how many previous prefix sums have the same remainder.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Ans. 
Sort an array in a wave-like pattern where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap elements at even indices with their adjacent odd indices to form a wave pattern.

• There can be multiple valid wave arrays, so any valid wave array is acceptable.

• Ensure the first element is greater than or equal to the second element to start the wave pattern.
Answered by AI
Add your answer
Q2. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
Convert a given integer number into its corresponding word representation.
• Implement a function that takes an integer as input and returns the word representation of that number.

• Break down the number into its individual digits and convert each digit into its word form.

• Handle special cases like numbers between 10 and 19, and multiples of 10.

• Combine the word forms of individual digits to form the final word representation...read more
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.

Q1. How does Facebook store comments in its database?
Ans. 
Facebook stores comments in its database using a combination of relational and non-relational databases.
• Comments are typically stored in a relational database like MySQL for structured data storage.

• For scalability and performance, Facebook may also use a NoSQL database like Cassandra or HBase for storing comments in a denormalized format.

• Metadata related to comments such as likes, timestamps, and user information may b...read more
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer

Round duration - 60 minutes
Round difficulty - Easy

This Round was based on CS fundamentals and One coding question was there as a Code-pair.

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
Find the Next Greater Element for each element in a list of integers.
• Iterate through the list of integers from right to left.

• Use a stack to keep track of elements whose NGE is yet to be found.

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

• Assign the NGE as the top element of the stack or -1 if the stack is empty.
Answered by AI
Add your answer

Q1. Introduction qualification hobbies
Add your answer

Q1. Introduction , qualification,hobbies
Add your answer

Q1. Past experiences, family background
Add your answer

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
Add your answer

Q1. Impliment counter using closure in js
Ans. 
Implement a counter using closure in JavaScript.
• Create a function that returns another function which increments a counter variable.

• The counter variable should be defined in the outer function's scope and only accessible to the inner function.

• Each time the inner function is called, increment the counter variable and return its value.
Answered by AI
Add your answer
Q2. Explain promises, promise.all(), impliment binary search
Ans. 
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
• Promises are used in JavaScript to handle asynchronous operations.

• promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...read more
Answered by AI
Add your answer

Q1. Questions on kafka, cache invalidation, diff b/w authentication and authorization
Add your answer