i
Hewlett Packard Enterprise
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed in Aug 2021.
Round duration - 100 minutes
Round difficulty - Hard
The test had 3 parts:
1. Aptitude - 20 questions to be done in 25 minutes. (Medium level)
2. Technical MCQs - 25 questions to be done in 35 minutes. (Medium-Hard level) (HTML, JS, CSS, SQL)
3. Coding - 2 out of 3 questions to be done in 40 minutes. 20 minutes were allotted for each question. No switching between the codes was allowed. (1-easy, 2-medium in total)
Given a positive integer N
, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
Iterate through numbers from 1 to N and count the set bits in their binary representation
Use bitwise operations to count the set bits efficiently
Return the count modulo 1e9+7 for each test case
Given a positive integer 'N', find and return the smallest number 'M', such that the product of all the digits in 'M' is equal to 'N'. If such an 'M' is not possib...
Find the smallest number whose digits multiply to a given number N.
Iterate through possible digits to form the smallest number with product equal to N
Use a priority queue to keep track of the smallest possible number
Check constraints to ensure the number fits in a 32-bit signed integer
Round duration - 45 minutes
Round difficulty - Medium
It was the first face-to-face technical round. The medium was ModernHire. There was only 1 member in the interview panel. This round tested me on C fundaments, Operating System basics, and problem-solving skills.
Questions asked:
What are the TRUNCATE, DELETE and DROP statements?
What are void elements in HTML?
Define multipart form data?
1. How does the C compiler works?
2. What are deadlocks and why does it happen?
3. How to resolve deadlock?
4. What is a kernel?
5. How to dynamically allocate memory in C?
6. What is makefile?
7. What is multi-threading and why is it useful?
8. What is the need for synchronization in OS?
9. How do you run a program of 10 GB using 2 GB memory?
10. What are semaphores and mutex?
11. How is HashMap implemented?
12. Difference between linker and loader.
13. Importance of header files.
14. What is Dynamic binding?
15. What type of database should you use where transactions are involved?
16. Brief discussion on the Internship experience.
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Understand the Merge Sort algorithm which involves dividing the array into two halves, sorting each half, and then merging them back together.
Recursively apply the Merge Sort algorithm until the size of each array is 1.
Merge the sorted halves to produce the final sorted array.
Ensure to handle the input constraints such as the number of...
Round duration - 50 minutes
Round difficulty - Medium
This was a managerial cum technical round. I was asked to introduce myself (both technical details and hobbies). Then I was asked about my internship experiences and what I learnt from them. After that, he asked me questions about the projects mentioned in my resume. He tested my in-depth knowledge of the technologies that I used. He also asked me about the alternative solutions and the drawbacks of my solution.
After that, he asked me to speak about Operating Systems for 5 minutes without giving a pause. Then he asked me to speak about the OSI model and the TCP/IP model for the next 5-10 minutes again without giving a pause. He appreciated my perfomance and gave me a coding question.
What is User-defined function? What are its various types in SQL. What is an Alias in SQL?
Then he asked me whether I had any questions.
Given a singly linked list of integers, your task is to implement a function that returns the index/position of an integer value 'N' if it exists in the linked list. Return -1 i...
Implement a function to find the index of a given integer in a singly linked list.
Traverse the linked list while keeping track of the index of each element.
Compare each element with the target integer 'N'.
Return the index if the element is found, otherwise return -1.
Handle cases where the target integer is not found in the linked list.
Round duration - 15 minutes
Round difficulty - Easy
Typical HR questions were asked in this round.
Tip 1 : Revise data structures and operating systems very well.
Tip 2 : Have a good resume with self-made projects and internship experiences as they add value to the candidature.
Tip 3 : Be confident and know the basics well.
Tip 1 : Have some good projects and know the tech stack well enough.
Tip 2 : Never include anything which you are not confident about.
Top trending discussions
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Puzzles, Psychometric Test
I was interviewed in Sep 2016.
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills and ability to work in a team
Completed multiple projects including a web-based inventory management system
I was interviewed in May 2017.
I was interviewed in Jun 2017.
I was interviewed in May 2017.
I was interviewed in Aug 2017.
I was interviewed before Aug 2016.
I was interviewed before Aug 2016.
I was interviewed before Nov 2016.
based on 3 reviews
Rating in categories
Technical Support Engineer
881
salaries
| ₹0 L/yr - ₹0 L/yr |
Process Associate
637
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Solutions Consultant
587
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
559
salaries
| ₹0 L/yr - ₹0 L/yr |
Financial Analyst
431
salaries
| ₹0 L/yr - ₹0 L/yr |
Dell
IBM
Cisco
Oracle