i
Ingram Micro
Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
1 hour basic aptitude questions , pen and paper based
Top trending discussions
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
Logical reasoning, grammar, and coding: two basic level questions.
I appreciate the collaborative team environment and innovative projects at my current company, and I am excited about the opportunities for growth and learning at your organization.
Collaborative team environment fosters creativity and productivity
Innovative projects challenge me to learn and grow
Excited about the opportunities for growth and learning at your organization
I was interviewed in Jan 2025.
Test will be in hacker rank there would be a difficulty level between easy to medium
Design and code a REST API for a software developer interview.
Define the endpoints and HTTP methods for the API (e.g. GET /users, POST /users)
Implement authentication and authorization mechanisms (e.g. JWT tokens)
Use proper status codes for responses (e.g. 200 OK, 401 Unauthorized)
Include error handling and validation for input data
Document the API using tools like Swagger or OpenAPI
Calculate word frequency using Stream API and lambda expressions
Use Stream API to convert array of strings to stream
Use Collectors.groupingBy to group words by their frequency
Use Collectors.counting to count the occurrences of each word
DSA questions and programming concepts
Reverse array of strings efficiently
Use two pointers approach to swap characters from start and end of each string
Optimize by using in-place reversal instead of creating new strings
Consider edge cases like empty strings or strings with only one character
posted on 17 Jul 2024
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
The question is about implementing a children sum property in trees and finding the height of a binary tree.
Children sum property in trees means that the value of a node must be equal to the sum of the values of its children nodes.
To find the height of a binary tree, you can recursively calculate the height of the left and right subtrees and return the maximum height plus one.
Example: For a binary tree with nodes 1, 2,
I was interviewed in Aug 2024.
C++ coding questions and logical questions
posted on 13 Jun 2024
How to reverse linked list.
Dynamic memory allocation is the process of allocating memory during program execution.
Allows programs to request memory at runtime
Helps in efficient memory management
Commonly used in languages like C and C++
Example: using malloc() function in C to allocate memory for an array
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Software Engineer
142
salaries
| ₹3 L/yr - ₹13.3 L/yr |
Senior Software Engineer
124
salaries
| ₹6 L/yr - ₹20 L/yr |
DEP Manager, Sales
103
salaries
| ₹5 L/yr - ₹13 L/yr |
Product Manager
73
salaries
| ₹7.1 L/yr - ₹25 L/yr |
Senior Associate
57
salaries
| ₹3 L/yr - ₹7.3 L/yr |
Tech Data
Redington
Tech Data Corporation
SYNNEX Corporation