HP interview questions
Online test → Technical → Managerial → HR·50% entry level
CS fundamentals
Showing 35 of 211 reported in this area
Explain the ACID properties of DBMS.
Explain the OSI Model and its layers
What are the different types of software testing?
Explain Object Oriented Programming (OOP) concepts.
Explain storage classes in C/C++
Explain OS scheduling algorithms.
Predict the output of C programs.
Explain scheduling concepts in RTOS
Explain UML diagrams and their usage
Explain SHA algorithms and their usage.
Compare HashTable and ConcurrentHashMap.
Explain pointers and their usage in C/C++
Explain string and pointer concepts in C.
Explain virtualization and virtual memory
Explain the working process of DHCP and DNS
Explain processes vs threads and system calls.
What are system calls and why are they needed?
Explain threading concepts in operating systems
Predict the output of Java and C++ code snippets.
Explain the OSI model and functions of each layer.
Explain the internal working of ConcurrentHashMap.
How are vectors internally implemented in C++ STL?
Explain mutexes and semaphores and their use cases.
Explain semaphores and mutexes and their differences
When a program is run, what will be its page offset?
Write a program to demonstrate operator overloading.
Explain normalization and table decomposition in DBMS
Explain the difference between a process and a thread
What are race conditions and how can they be avoided?
Explain the OSI model and protocols used at each layer
What is the difference between a lock and a semaphore?
Basic networking questions about routers and protocols.
Explain OOP concepts and their real-world applications.
Explain virtual memory and paging in operating systems.
How does a router find the best route to transfer data?
DSA
Showing 16 of 56 reported in this area
Reverse a linked list.
Count the number of set bits in a given number
Implement a tree data structure.
Write a variation of Merge Sort.
Implement Merge Sort on a linked list.
Implement a stack using a linked list.
Detect whether a linked list contains a loop
Write code related to linked list operations
Explain Kruskal’s algorithm and how it works.
Implement and explain basic linked list operations
Write a program to detect a cycle in a linked list
Write code to insert a node in a doubly linked list.
Check if there exists a subarray with sum equal to 0.
Find the repeating and the missing number in an array.
Swap two nodes of a linked list without swapping data.
Add two numbers without using the '+' operator in Java.
Aptitude
Showing 3 of 15 reported in this area
Solve aptitude questions based on blood relations.
Time and work related quantitative aptitude problems.
Solve aptitude problems based on profit and loss calculations
Behavioural
Showing 3 of 14 reported in this area
If you are assigned a task by your manager to complete within a week but you have no idea about the task, what will you do?
How confident are you, and what is the reason for your confidence?
What is the difference between a product-based company and a service-based company?
Puzzles
Showing 2 of 7 reported in this area
Solve the 9 balls weighing puzzle to find the odd ball using minimum weighings.
Puzzle: You have 3 bulbs in a room and 3 switches outside. How do you determine which switch controls which bulb?
System design
1 questions reported in this area
Design a system to store articles and retrieve the most popular article.
Showing 60 of 245 questions. Ranked by how often the same question came back across reports.
Practise a HP-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does HP ask?
Candidate interview reports most often cover CS fundamentals (69%) and DSA (18%).
How many rounds does HP interview have?
Candidate interview reports show an average of 4.0 rounds per experience, with a typical sequence of Online test → Technical → Managerial → HR. Individual interview paths can vary.
Is the HP interview hard?
Among questions with a reported difficulty, the mix is easy 43%, medium 53%, hard 4%.