Ingram Micro Senior Java Developer Interview Questions and Answers

Q1. Tell about you and why Arrow?
Ans. 
I am a software developer with a passion for problem-solving and innovation. I chose Arrow for its reputation for cutting-edge technology and collaborative work environment.
• I have a strong background in programming languages such as Java, Python, and JavaScript.

• I enjoy working on challenging projects that require creative solutions.

• Arrow's focus on innovation and continuous learning aligns with my career goals.

• I apprec...read more
Answered by AI
Add your answer
Q2. What do you know about Arrow?
Ans. 
Arrow is a high-performance JVM library for building and manipulating data structures.
• Arrow is a library for building and manipulating data structures in Java and Scala.

• It provides a functional, immutable, and type-safe approach to working with data.

• Arrow is commonly used in functional programming and big data applications.

• Examples of data structures in Arrow include Option, Either, and Try.
Answered by AI
Add your answer

Code paring round was conducted. they will assist you what there expectations are

Q1. Internal working of Hash Map
Ans. 
Hash Map is a data structure that stores key-value pairs and uses a hash function to map keys to their corresponding values.
• Hash Map uses a hash function to determine the index of the key-value pair in the underlying array.

• Collisions can occur when multiple keys hash to the same index, which can be resolved using techniques like chaining or open addressing.

• Hash Map typically has a load factor threshold to determine whe...read more
Answered by AI
Add your answer

Q1. Interview was good but questions asked was very hard. You must have good technical knowledge.
Add your answer

Q1. Remove Duplicates
Ans. 
Remove duplicates from a given array or list.
• Iterate through the array and add each element to a set.

• If the element already exists in the set, remove it from the array.

• Return the modified array without duplicates.
Answered by AI
Add your answer
Q2. Find closest using binary search
Ans. 
Binary search algorithm to find the closest element in a sorted array
• Sort the array in ascending order

• Find the middle element of the array

• Compare the middle element with the target value

• If the middle element is greater than the target value, search the left half of the array

• If the middle element is less than the target value, search the right half of the array

• Repeat until the closest element is found
Answered by AI
Add your answer

DSA

About Social changes

Q1. Tell me about yourself.
Add your answer
Q2. Very basic questions
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Mcq + Data structures questions

Q1. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.
• Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

• Initialize two variables: max_sum and current_sum to keep track of the maximum sum subarray

• Iterate through the array and update current_sum by adding the current element or starting a new subarray

• Update max_sum if current_sum is greater than max_sum

• Return...read more
Answered by AI
View 1 more answer

Round duration - 70 minutes
Round difficulty - Medium

Standard System Design round

Q1. Design a Doctor Appointment System and provide some test cases.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interview of DSA + OOPS + Databse(SQL query) + Operating System

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the leftmost node at each level.

• Use a queue to perform level order traversal.

• Print the leftmost node at each level to get the left view of the binary tree.
Answered by AI
Add your answer
Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
Ans. 
CHAR is fixed length while VARCHAR2 is variable length in SQL.
• CHAR stores fixed length strings, padding with spaces if necessary.

• VARCHAR2 stores variable length strings, not padding with spaces.

• CHAR is faster for fixed length data, VARCHAR2 is more flexible for varying length data.
Answered by AI
View 1 more answer
Q3. What are the various types of constructors in C++?
Ans. 
There are three types of constructors in C++: default constructor, parameterized constructor, and copy constructor.
• Default constructor: Constructor with no parameters.

• Parameterized constructor: Constructor with parameters.

• Copy constructor: Constructor that initializes an object using another object of the same class.

• Example: // Default constructor ClassName() {} // Parameterized constructor ClassName(int x, int y) :...read more
Answered by AI
Add your answer
Q4. What is the difference between overloading and overriding?
Ans. 
Overloading is having multiple methods in the same class with the same name but different parameters, while overriding is implementing a method in a subclass that is already defined in the superclass.
• Overloading involves multiple methods with the same name but different parameters.

• Overriding involves implementing a method in a subclass that is already defined in the superclass.

• Overloading is resolved at compile time ba...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Hr round - normal hr questions + situational 

Thoughtworks community discussion

Q1. Why should we hire you?
Add your answer

Q1. Based on projects
Add your answer
Q2. Skills n courses
Add your answer