Hewlett Packard Enterprise Interview Questions, Process, and Tips

Round duration - 50 Minutes
Round difficulty - Easy

OOPs concept

Round duration - 80 Minutes
Round difficulty - Medium

OOPs concept.

Polymorphism and its types.

Compile-time polymorphism

Write a code to show operator overloading.

Difference between method overloading and method overriding.

Threading, multilevel scheduling, and its drawbacks and how it can be overcome.

DBMS -sql queries, same data but write using IN instead of WHERE
 

Q1. Bubble Sort
For a given a string(str) and a character X, write a function to remove all the occurrences of X from the given string.
The input string will remain unchanged if the given character(X) doesn&...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer
Q2. Subarray With Given Sum
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subar...read more
Ans. Bruteforce Approach
• In this approach, we will traverse all the subarrays and for each subarray, we will check whether the sum of the elements of the subarray matches with the given sum.
• To traverse all the subarrays we will use two nested loops.
• The outer loop will select the start index and the inner loop will fix the end index of the subarray. While incrementing the inner pointer(inner loop pointer) we will also maintai...read more
Answered Anonymously
Add your answer
Q3. Count Frequency
You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.
Example :
Given 'S' : abcd...read more
Ans. Count Frequency
Since there are just 26 lower case characters, we can use an array of size 26 to store the result.
 
Here is the algorithm : 
 
1. Create an array (say, ‘FREQ’), where 0-th index stores the frequency of ‘a’, 1st index stores the frequency of ‘b’ and so on. So the last index i.e. 25th index stores the frequency of ‘z’.
2. Run a for loop from 0 to ‘N’ - 1 (say, iterator ‘i’), on the string and do the f...read more
Answered Anonymously
Add your answer
Q4. Find Duplicate
You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered Anonymously
Add your answer
Q5. Remove character
For a given string(str) and a character X, write a function to remove all the occurrences of X from the given string and return it.
The input string will remain unchanged if the given ch...read more
Ans. Iterative Solution
• We create an empty string that will store our final result. We will return it at the end.
• We iterate from 0 to the length of the string. Say, our loop variable is i. We can then access the ith character as input[i]
• If the ith character equals the character c i.e input[i] == c, then we skip this character and do nothing.
• Else we need to append the character to the output string.
• We finally return the outpu...read more
Answered Anonymously
Add your answer

Q1. Profile screening to find the relevance
Ans. 
Profile screening is a process of evaluating a candidate's qualifications and experience to determine their relevance to a job position.
• Profile screening involves reviewing resumes, cover letters, and job applications.

• Employers use profile screening to identify candidates who meet the job requirements.

• Screening criteria may include education, work experience, skills, and certifications.

• Applicant tracking systems (ATS) ...read more
Answered by AI
Add your answer

Q1. In detail discussion about previous job experiences.
Add your answer

Q1. Package discussion and joining formalities
Add your answer