Hexaware Hiring Process Overview

Hexaware recruits freshers for two major roles:

• GET – Graduate Engineer Trainee
• PGET – Premier Graduate Engineer Trainee

---

Selection Rounds for GET (Graduate Engineer Trainee)

Total 4 rounds:

1. Aptitude Test
2. Communication Test
3. Technical Interview
4. HR Interview

---

Selection Rounds for PGET (Premier Graduate Engineer Trainee)

Total 5 rounds:

1. Aptitude Test
2. Coding Test
3. Communication Test
4. Technical Interview
5. HR Interview

---

Recruitment Modes

Hexaware conducts hiring via:

• On-Campus placements (Tier 1, Tier 2 & Tier 3 colleges)
• Off-Campus drives
• Referral drives

---

Salary Structure

Hexaware provides different salary packages for both roles, including base pay and additional benefits:

Role	Pay Structure
GET	Standard fresher salary with fixed pay + allowances
PGET	Higher package than GET with extra benefits

(Exact figures vary every year and depend on candidate performance & location)

---

Hexaware Hiring Process – Detailed Explanation

1. Aptitude Test

The first step evaluates a candidate’s:

• Logical reasoning
• Quantitative ability
• Analytical skills

The aptitude test helps shortlist candidates for further rounds.

---

2. Coding Test (Only for PGET role)

A coding assessment is conducted to test:

• Programming knowledge
• Algorithmic thinking
• Problem-solving skills

⏳ 2 questions — 40 minutes

Candidates can usually choose from multiple programming languages.

---

3. Communication Assessment

Hexaware gives high importance to communication skills.
This test checks:

• Grammar
• Spoken English fluency
• Pronunciation
• Listening and comprehension ability

---

4. Technical Interview

In this round, candidates are evaluated based on:

• Core subject knowledge
• Programming fundamentals
• Database & OS concepts
• Project explanation
• Troubleshooting and problem-solving approach

---

5. HR Interview

The final discussion focuses on:

• Personality & attitude
• Work ethics and values
• Career goals
• Knowledge about company
• Relocation & shift flexibility

---

About Hexaware Technologies

Hexaware Technologies is a global IT & BPO services company that provides:

• Application development & maintenance
• Digital transformation services
• Enterprise solutions
• Cloud & infrastructure management
• Business process outsourcing (BPO)

Founded: 1990
Founder: Atul K. Nishar
Headquarters: Navi Mumbai, Maharashtra, India

Hexaware’s Business Strategy

• End-to-end IT services
• Industry-specific technology solutions
• Large BPO service network
• Expansion through acquisitions and partnerships

---

If you want, I can also provide:
✔ Hexaware aptitude syllabus
✔ Communication test solved samples
✔ Top technical interview questions with answers
✔ Resume format for Hexaware GET & PGET

Hexaware GET & PGET Technical Interview Questions

---

A. Programming / DSA (Coding)

1. Reverse a string
   Tests basic string manipulation and understanding of loops or inbuilt functions.
2. Check if a number is prime
   Evaluates conditional logic and efficiency of iterative solutions.
3. Find factorial of a number (iterative & recursive)
   Checks recursion understanding and iterative logic handling.
4. Print Fibonacci series up to N terms
   Examines knowledge of loops, recursion, and sequence generation.
5. Find the largest and smallest element in an array
   Tests array traversal and comparison logic.
6. Sum of all elements in an array
   Basic array manipulation, checks iteration and arithmetic operations.
7. Reverse an array
   Evaluates array indexing, swapping, and memory handling.
8. Find second largest number in an array
   Tests logic implementation and corner-case handling.
9. Find duplicates in an array
   Checks problem-solving and understanding of hashing / frequency count.
10. Implement linear search
    Tests basic searching algorithms and iteration concepts.
11. Implement binary search
    Checks understanding of divide-and-conquer algorithms.
12. Find missing number in 1 to N array
    Tests arithmetic and array sum logic or XOR method.
13. Count vowels in a string
    Evaluates string processing and condition handling.
14. Check if a string is palindrome
    Tests string reversal logic and comparison.
15. Remove duplicates from an array
    Checks problem-solving skills using loops or hash sets.
16. Merge two sorted arrays
    Tests understanding of sorting and merging techniques.
17. Check if two strings are anagrams
    Evaluates character frequency logic or sorting methods.
18. Find GCD of two numbers
    Tests Euclid’s algorithm and recursion basics.
19. Print all prime numbers up to N
    Checks loops, conditions, and efficiency in number handling.
20. Implement stack using arrays / linked list
    Tests understanding of stack operations (push, pop, peek).
21. Implement queue using arrays / linked list
    Evaluates FIFO concept and pointer or index management.
22. Implement circular queue
    Tests modular arithmetic and efficient space usage.
23. Find max subarray sum (Kadane’s algorithm)
    Checks dynamic programming and optimal solution logic.
24. Reverse a linked list
    Tests pointer manipulation and linked list basics.
25. Detect a cycle in linked list
    Evaluates understanding of Floyd’s cycle detection algorithm.

---

B. OOPS / Object-Oriented Programming

26. What is OOPS? Explain its principles
    Checks knowledge of abstraction, encapsulation, inheritance, and polymorphism.
27. Difference between method overloading & overriding
    Tests compile-time vs run-time polymorphism understanding.
28. What is inheritance and types of inheritance
    Evaluates class hierarchy and code reuse understanding.
29. Explain abstraction vs encapsulation
    Checks ability to separate implementation from interface.
30. What is a constructor & destructor?
    Tests understanding of object lifecycle and memory management.
31. What is polymorphism?
    Checks ability to implement multiple forms for a class or function.
32. What is a virtual function?
    Tests knowledge of dynamic method dispatch in C++/Java.
33. Difference between class & object
    Fundamental OOPS concept check.
34. What is multiple inheritance?
    Evaluates understanding of class relationships and diamond problem.
35. What is static vs dynamic binding?
    Checks understanding of compile-time vs run-time decision making.
36. What is a pure virtual function?
    Tests abstract class implementation knowledge.

---

C. DBMS / SQL Questions

37. What is DBMS? Difference between DBMS & RDBMS
    Evaluates knowledge of database fundamentals and relational concepts.
38. What are primary key, foreign key, and unique key?
    Tests relational database integrity knowledge.
39. What are SQL joins and types of joins?
    Checks practical SQL query knowledge: INNER, LEFT, RIGHT, FULL joins.
40. What is normalization? Explain 1NF, 2NF, 3NF
    Evaluates data redundancy minimization and schema design understanding.
41. What is ACID property in DBMS?
    Tests understanding of transaction reliability and database integrity.
42. What is a trigger in SQL?
    Checks procedural SQL knowledge and event handling in databases.
43. Difference between delete and truncate
    Evaluates understanding of DML vs DDL commands.
44. What is indexing? Explain clustered vs non-clustered index
    Tests optimization and query performance knowledge.
45. Write a query to find the second highest salary from employee table
    Checks practical SQL query building and analytical thinking.
46. Explain database schema and keys
    Evaluates ability to describe tables, attributes, and relationships.

---

D. General Technical / Programming Concepts

47. Explain stack vs heap memory
    Checks memory allocation understanding in programming languages.
48. What is recursion? Provide an example
    Tests knowledge of function calling itself and base cases.
49. Explain array vs linked list
    Evaluates understanding of memory, insertion/deletion efficiency, and use-cases.
50. Difference between compiler & interpreter
    Checks knowledge of how code is executed in different environments.

Most Asked 30 Questions during Hexaware interview

Question 1:

What is Inheritance?

Answer:

Inheritance is a mechanism by which one object acquires all the properties and behavior of another object of another class. It is used for Code Reusability and Method Overriding. The idea behind inheritance in Java is that you can create new classes that are built upon existing classes. When you inherit from an existing class, you can reuse methods and fields of the parent class. Moreover, you can add new methods and fields to your current class also. Inheritance represents the IS-A relationship which is also known as a parent-child relationship.

---

Question 2:

What is DBMS?

Answer:

DBMS is a collection of programs that provides users to create and maintain a database. It manages incoming data, Organizes to provide a better and easier way to users. Or in a Simpler way, DBMS provides us an interface or tool for performing different operations such as the creation of a database, inserting data into it, deleting data from it, updating the data, etc. DBMS is a software in which data is stored in a more secure way as compared to the file-based system. Using DBMS, we can overcome many problems such as data redundancy, data inconsistency, easy access, more organized and understandable, and so on.

---

Question 3:

What is the difference between the final method and the abstract method?

Answer:

The main difference between the final method and the abstract method is that the abstract method cannot be final as we need to override them in the subclass to give its definition.

---

Question 4:
What are the advantages of DBMS?

Answer:

1. Data Independence: It allows to change the structure of the data without affecting the structure of any of the running application programs.
2. Sharing of Data: Multiple users can use data from the same database simultaneously.
3. Integrity constraints: These constraints allow the data to be stored in a database in a refined manner.
4. Redundancy control: Supports a mechanism to control the redundancy of data by integrating all the data into a single database.
5. Provide backup and recovery facility: Provides a feature of ‘backup and recovery’ to automatically create the data backup and restore the data as and when required.

---

Question 5:

Give an example for the ternary operator in C.

Answer:

“?:” is known as a ternary operator or conditional operator. It is similar to if-else control flow. And also it takes less space.

Syntax: result = condition ? ValueReturnedIfTrue : ValueReturnedIfFalse

Example:

Output: b is the greatest number

---

Question 6:

What is a class?

Answer:

Class is a blueprint or template from which objects are created and describes the contents of the object. A class should be defined before creating an object.

---

Question 7:

What is method overloading?

Answer:

Method overloading is the polymorphism technique that allows us to create multiple methods with the same name but different signatures. We can achieve method overloading in two ways.

• Changing the number of arguments
• Changing the return type

---

Question 8:

What is a queue? How is it different from a stack?

Answer:

A queue is another common data structure that places elements in a sequence, similar to a stack. A queue uses the FIFO method (First In First Out), by which the first element that is enqueued will be the first one to be dequeued.

In a stack, the item that is most recently added is removed first. Contrary to this, the item least recently added is removed first in case of a queue.

---

Question 9:

What are the access specifiers in Java?

Answer:

There are four types of access specifiers. They are :

1. Public: If a class or method is defined as public then it can be accessed by any class or method.
2. Protected: If a class is defined as protected then it can be accessed by the class of the same package or by the sub-class of this class.
3. Private: If a class or method is defined as private then it can be accessed within that class only.
4. Default: It is accessible within the package only. This is a normal access specifier.

---

Question 10:

What is bubble sort and how bubble sort works?

Answer:

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. Bubble sort is a comparison-based algorithm in which each pair of adjacent elements is compared and elements are swapped if they are not in order. It is not suitable for a large set of data because the time complexity is Ο(n²).

---

Question 11:

What is a Stack?

Answer:

Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). The Stack is a list in which insertion and deletion can be performed only at one end which is called the top. It is a recursive data structure having a pointer to its top element. Last-In-First-Out (LIFO) means the element which is inserted first will be deleted last from the stack.

---

Question 12:

What is the purpose of normalization in DBMS?

Answer:

Normalization is the process of analyzing the relational schemas which are based on their respective functional dependencies and the primary keys to fulfilling certain properties.

• The properties include:
• To minimize the redundancy of the data.
• To minimize the Insert, Delete, and Update Anomalies.

---

Question 13:

What is JRE?

Answer:

JRE means Java Runtime Environment. It is a software package that contains  JVM(Java Virtual Machine), class libraries, and other components.

---

Question 14:

What are Infix, prefix, and Postfix notations?

Answer:

1. Infix notation:  X + Y – Operators are written in-between their operands. This is the usual way we write expressions. An expression such as
   A * ( B + C ) / D
2. Postfix notation (also known as “Reverse Polish notation”):  X Y + Operators are written after their operands. The infix expression given above is equivalent to
   A B C + * D/
3. Prefix notation (also known as “Polish notation”):  + X Y Operators are written before their operands. The expressions given above are equivalent to
   / * A + B C D

---

Question 15:

State some applications of Stack.

Answer:

The applications of stack are:

• Infix to Postfix Conversion can be done using Stack.
• Evaluation of Postfix Expression is also possible.
• Reverse a String using Stack can be done.
• Implementing two stacks in an array is also a nice use case.
• Check for balanced parentheses in an expression is done using stacks.

---

Question 16:

How is an Abstract class different from an Interface?

Answer:
There are several differences between an Abstract class and an Interface in Java, summed up as follows:

1. Constituents: An abstract class contains instance variables, whereas an interface can contain only constants.
2. Constructor and Instantiation: While an interface has neither a constructor nor it can be instantiated, an abstract class can have a default constructor that is called whenever the concrete subclass is instantiated.
3. Implementation of Methods: All classes that implement the interface need to provide an implementation for all the methods contained by it. A class that extends the abstract class, however, doesn’t require implementing all the methods contained in it. Only abstract methods need to be implemented in the concrete subclass.
4. Type of Methods: Any abstract class has both abstract as well as non-abstract methods. Interface, on the other hand, has only a single abstract method.

---

Question 17:

What is JDK?

Answer:

JDK means Java Development Kit. It is a software development kit that is used to develop applications in Java. It contains JRE, Compilers, Debuggers, Java DOC etc.,

---

Question 18:

How many types of database languages are there?

Answer:
There are four types of database languages:

1. Data Definition Language (DDL): These commands are used for updating the data. CREATE, ALTER, DROP, TRUNCATE, and RENAME are some examples of DDL commands.
2. Data Manipulation Language (DML): These commands are used for the manipulation of already updated data. SELECT, UPDATE, INSERT, DELETE are some examples of DML commands.
3. DATA Control Language (DCL): These commands are used for giving and removing user access to the database. GRANT and REVOKE are examples of DCL commands.
4. Transaction Control Language (TCL): These are the commands used for managing transactions in the database. TCL is used for managing the changes made by DML. COMMIT, ROLLBACK, and SAVEPOINT are examples of TCL commands.

---

Question 19:

What is a destructor?

Answer:

A destructor is a member function of the class and also deletes the creation of an object. Destructor contains the same name as the class name.
The destructor cannot be overloaded.
It gets executed automatically with respect to the objects as soon as the object loses its scope.

---

Question 20:

What do you know about Interfaces in Java?

Answer:

A Java interface is a template that has only method declarations and not method implementations. It is a workaround for achieving multiple inheritances in Java. Some worth remembering important points regarding Java interfaces are:

• A class that implements the interface must provide an implementation for all methods declared in the interface.
• All methods in an interface are internally public abstract void.
• All variables in an interface are internally public static final.
• Classes do not extend but implement interfaces.

Hexaware Coding Questions

Question 1

Explain the SDLC Model.

---

Question 2

Write the program for Bubble Sort.

---

Question 3

Create a program that minimizes a string by eliminating consecutive sets of K identical characters.

---

Question 4

Create a program to determine the maximum sum of the array elements achievable by executing two specified operations, each performed once. The operations involve selecting a consecutive subset of elements at either the beginning or end of the array and multiplying them by -1.

Examples:

• Given arr[] = {-1, 10, -5, 10, -2}, the output should be 18.
  After the first operation: 1 10 -5 10 -2
  After the second operation: 1 10 -5 10 2
• Given arr[] = {-9, -8, -7}, the output should be 24.
  After the first operation: 9 8 -7
  After the second operation: 9 8 7

---

Question 5

Create a program that returns the count of words in a string, where each word does not contain any vowels.

Example 1:
Input: “Hello world, this is a sample string.”
Output: 3
Explanation: Words without vowels – “world,” “this,” and “string.”

Example 2 :
Input: “Programming is fun without vowels.”
Output: 4
Explanation: Words without vowels – “Programming,” “is,” “fun,” and “without.”

---

Question 6

Create a program that counts the number of substrings in a given string with precisely K unique characters.

---

Question 7

Write a program to input a word and print the output in which each character is incremented by 2 i.e. P will be R.

---

Question 8

Write a program to input 3 digits and using the digits print the maximum and minimum numbers.

---

Question 9

Write a program to find the quotient and remainder.

---

Question 10

Write a Pseudocode to implement Abstraction in Code in reference to real-life Applications.

---

Question 11

Write a program to reverse a string.

Example 1:
String s = “kishan”
Output: “nahsik”

Example 2:
String s = “vibudh”
Output: “hdubiv”

---

Question 12

Write the code to implement polymorphism.

---

Question 13

Write a program to find the Factorial of a number.

---

Question 14

Write the code in any language to count the occurrence of each character in a given string.

---

Question 15

Write a program to remove an Element at Specific Index from an Array in Java.

---

Question 16

Write a code to find the 2nd largest element of a list

---

Question 17

Write the SQL queries related to Cross Join, Join etc. 

---

Question 18

Write a program to find the maximum element from 3 numbers.

---

Question 19

Write a program to reverse a number.

---

Question 20

Write a program to implement the use of pointers.

---

Question 21

Write a program to implement the use of the “this” keyword.

---

Question 22

Create a program to display both the first name and last name, avoiding the use of any form of loops or recursion methods.

---

Question 23

Implement an SQL query to create a table and insert some rows and columns in it.

---

Question 24

Write a program to assign grades to students based on their marks.

---

Question 25

Given a string str, Write a program to find the length of the longest substring without repeating characters.

Example 1:
Input: “ABCDEFGABEF”
Output: 7

Explanation: The longest substring without repeating characters are “ABCDEFG”, “BCDEFGA”, and “CDEFGAB” with lengths of 7

---

Question 26

Develop a program that calculates the amount of water trapped after rainfall, given an array of N non-negative integers (arr[]), which represents an elevation map. Each bar in the elevation map has a width of 1.

Input: arr[] = {2, 0, 2}

Output: 2

Explanation: We can trap 2 units of water in the middle gap.

---

Question 27

Write a program to merge two sorted Linked lists.

---

Question 28

Write the code to implement “Convert Infix expression to Postfix expression”.

---

Question 29

Create a program that determines whether there are two elements in an array A[] of n numbers whose sum equals a given number x.

Input: arr[] = {0, -1, 2, -3, 1}, x= -2

Output: Yes

Explanation:  If we calculate the sum of the output,1 + (-3) = -2

---

Question 30

Given an array of distinct elements. Create a program to find triplets in the array whose sum is zero.

Example 1 :
Input: arr[] = {0, -1, 2, -3, 1}
Output: (0 -1 1), (2 -3 1)
Explanation: The triplets with zero sum are 0 + -1 + 1 = 0 and 2 + -3 + 1 = 0  

Example 2 :
Input: arr[] = {1, -2, 1, 0, 5}
Output: 1 -2  1
Explanation: The triplets with zero sum is 1 + -2 + 1 = 0