HPE Interview Experience | On-Campus

Round 1 — Technical Assessment

There were 4 sections:

1. Aptitude (15) — 20 min
2. Technical (33) — 40 min
3. Coding(2) — 30 min
4. Coding(2) — 30 min

The options for languages were — c++, c, python, java and 2 out of these had to be chosen

Coding Questions — CPP
1. You’re given a number, and the challenge is to find the first palindrome that emerges when you add the reverse of the number to itself. For example, with the number 12, you can construct a palindrome like this: 12 + 21 = 33. However, not all numbers work this way; for instance, 57 doesn’t yield a palindrome. So, the question is, what’s the first palindrome you can create using this operation for a given number?

2. A car requires 4 wheels , 2 chairs and 1 body . Given wheels, chairs, body, find out the number of cars that can be manufactured.

Coding Questions — Python
1. Given length, breadth and height of two cubes, find the absolue volume difference between the two.

2. Given an array, modify it such that the value at the ith position is the sum of the values of it’s next two neighbors.

Round 2 — Technical Interview

There were 2 interviewers in my panel. It started with my resume description.

1. Resume was discussed in depth. I was asked to explain 2 of my projects in depth. Questions on gradle were asked as I had used it in one of my springboot projects.
2. Standard valid parenthesis stack question
   https://leetcode.com/problems/valid-parentheses/
3. Application based queue question was asked in depth.
4. CN related questions. Differentiatiation between routers, switches and Hubs and where they are used in day-to-day life. Later discussion on Congestion Control and Virtual LANS.
5. After this another interviewer asked me to code up a N-ary tree question given input and output.

class organisation {
   int id;
   string name;
   list<organisation> childOrgs;
   int rank;
   int parentOrg;
}
rootOrg - 1
    - childOrg1 - 2
    - childOrg2 - 1
          - childOrg11 - 3
          - childOrg12 - 1
               - childOrg121 - 2
               - childOrg122 - 1
          - childOrg13 - 2
List:
rootOrg
childOrg2
childOrg12
childOrg122
childOrg121
childOrg13
childOrg11

Here I had to visit the nodes in depth taking care of the priority while visiting nodes of same level.

This round lasted for an hour.

After 30 min, I recieved my link for the second round.

Round 3 — Managerial Round

1. This began with me explaning a High Level Design of one of my projects in my resume. As I mentioned Regex in my project, I was asked to write Regex for IPv4 and IPv6 network address. After this I was asked to differentiate between the two and need to shift for IPv6.
2. Sum of all the nodes of a binary tree
   https://www.geeksforgeeks.org/sum-nodes-binary-tree/
3. Searching and sorting techniques were asked in depth with their time complexities.
4. 2 puzzles - 1st one I had prepared priorily but then 2nd one I really loved the way I came up with the solution. For second one, I played couple of rounds with my interviewer and could gradually pick the pattern.
   https://www.geeksforgeeks.org/puzzle-7-3-bulbs-and-3-switches/
   https://riverbendmath.org/modules/Nim_Games/ — Counting to 30

Interviewers seemed pretty satisfied and was called for hr round. The round lasted again for an hour.

Round 4 — HR Round

This was nothing technical but a basic question on my projects. Later My chose given to work in a startup or fintech company early in my career. Then discussion on service based and product based companies.

Results

On the same day, at around 7pm, the results were announced, and I was fortunate to find my name among the selected students. This news has filled me with excitement for the journey ahead. I am eagerly looking forward to embarking on this new path with enthusiasm and dedication, ready to contribute my skills and grow personally and professionally.

EMBRACE EVERY OPPORTUNITY WITH ENTHUSIASM AND DEDICATION, FOR IT IS THE JOURNEY THAT SHAPES US AND THE DEDICATION THAT DEFINES OUR SUCCESS.

If you liked the article then please clap and follow me. You can connect with me here. For your information, you can clap more than once try it. ;P

Thank you and Good Luck ❤