Skip to content

Interview Questions - Hewlett Packard Enterprise (HPE)

Round 1 : Technical - Remove the duplicate elements from an array (DeleteDuplicates.c) - Example of Recursion (Factorial.c) - Reverse Linked List (ReverseLinkedList.c)

Round 2 : Technical - Set / Clear a bit in given n and k (SetClearBit.c) - Insert in sorted linked list (SortedInsertLinkedList.c) - Difference between malloc and calloc struct node temp = (struct node)malloc(sizeof(struct node)) calloc(n, sizeof(struct node)) - Dangling pointers - Free a memory free(temp) - Segmentation fault - Binary Tree - Binary Search Tree - Binary Search Tree Traversals - Preorder, Inorder, Postorder, Inorder (BinarySearchTree.c)

Round 3 : Managerial/Technical - Binary representation of a given number (use bit manipulation) (BinaryOfNumber.c) - Pointer related questions - Output of a pointer related program (PointerOutput.c) - Create an m size array which contains pointer to n size arrays (ArrayPointer.c)