Hewlett Packard Enterprise interview experience Real time questions & tips from candidates to crack your interview

Fullstack Developer

Hewlett Packard Enterprise
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 8 months
Topics: Data Structures, Operating Systems, Computer Networks, SQL Queries, Dynamic Programming
Tip
Tip

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.

Application process
Where: Campus
Eligibility: 7 CGPA and 70% in boards
Resume Tip
Resume tip

Tip 1 : Have some good projects and know the tech stack well enough.
Tip 2 : Never include anything which you are not confident about.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration100 minutes
Interview date21 Aug 2021
Coding problem2

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)

1. Count Set Bits

Hard
15m average time
85% success
0/120
Asked in companies
AmazonHewlett Packard EnterpriseSnapdeal

You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.

Since the count of ‘1’ can be huge, you are required to return it modulo 1e9+7.

Note:
Do not print anything, just return the number of set bits in the binary representation of all integers between 1 and ‘N’.
Try solving now

2. Smallest number whose digits multiplication is ‘N’

Moderate
15m average time
85% success
0/80
Asked in companies
OlaTata Consultancy Services (TCS)Hewlett Packard Enterprise

You are given a positive integer ‘N’. The task is to find and return the smallest number, ‘M’, such that the multiplication of all the digits in ‘M’ is equal to ‘N’. If no such ‘M’ is possible or ‘M’ cannot fit in a 32-bit signed integer, return 0.

Example:
‘N’ = 90

Possible values for ‘M’ are:
1. 259 (2*5*9 = 90) 
2. 3352 (3*3*5*2 = 90) 
3. 2335 (2*3*3*5 = 90) 
4. 952 (9*5*2 = 90), and so on.
Here, ‘259’ is the smallest possible ‘M’. Thus, you should return ‘259’ as the answer.
Try solving now
02
Round
Medium
Video Call
Duration45 minutes
Interview date24 Aug 2021
Coding problem1

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.

1. Merge Sort

Easy
15m average time
85% success
0/40
Asked in companies
Thought WorksAccentureInfosys

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

subsequence

The above illustrates shows how merge sort works.
Note :
It is compulsory to use the ‘Merge Sort’ algorithm.
Try solving now
03
Round
Medium
Video Call
Duration50 minutes
Interview date24 Aug 2021
Coding problem1

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.

1. Find a Node in Linked List

Easy
10m average time
97% success
0/40
Asked in companies
Hewlett Packard EnterpriseCadence Design SystemsBetsol

You have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise.

Note :
Assume that the Indexing for the singly linked list always starts from 0.
Try solving now
04
Round
Easy
HR Round
Duration15 minutes
Interview date24 Aug 2021
Coding problem1

Typical HR questions were asked in this round.

1. Basic HR Questions

Introduce yourself.
Mention something that is not in your resume.
Why are you fit for this role?
Why HPE?
Plans for higher studies.

Problem approach

Tip 1 : Be Honest
Tip 2 : Be confident.
Tip 3 : Keep a smile always.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
R&D Intern
4 rounds | 4 problems
Interviewed by Hewlett Packard Enterprise
1231 views
1 comments
0 upvotes
company logo
Quantitative Research
4 rounds | 5 problems
Interviewed by Hewlett Packard Enterprise
1584 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 11 problems
Interviewed by Hewlett Packard Enterprise
888 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 10 problems
Interviewed by Hewlett Packard Enterprise
864 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Fullstack Developer
6 rounds | 5 problems
Interviewed by Microsoft
1794 views
0 comments
0 upvotes
company logo
Fullstack Developer
4 rounds | 10 problems
Interviewed by Paytm (One97 Communications Limited)
1533 views
1 comments
0 upvotes
company logo
Fullstack Developer
2 rounds | 2 problems
Interviewed by Samsung
1659 views
0 comments
0 upvotes