Interview experience
Hexaware Interview Questions and Answers (2026)
Overview
Section titled “Overview”Hexaware hires freshers through parallel GET and PGET tracks, and the round most candidates underestimate - a proctored Communication Assessment - turns out to be a genuine elimination gate, not a formality.
Hexaware interview process at a glance
Section titled “Hexaware interview process at a glance”| Round | Duration | What they test |
|---|---|---|
| Aptitude Test | 60 min | Quantitative aptitude, verbal ability, logical reasoning (no negative marking) |
| Technical MCQ + domain test | 30-45 min | CS fundamentals, domain pseudocode/basics |
| Coding round (PGET track) | 45-60 min | Coding problems, LeetCode easy-medium |
| Communication Assessment (SpeechX/Mettl) | 15-20 min | Spoken and written English proficiency |
| Technical / EC Interview | 15-25 min | DSA, OOPs, DBMS, resume languages, projects |
| HR Interview | 15-20 min | Confidence, teamwork, relocation, dedication |
Aptitude Test
Section titled “Aptitude Test”A roughly 60-minute test on quantitative aptitude, verbal ability, and logical reasoning, with no negative marking. This is the first filter and, by candidate accounts, cuts a meaningful share of applicants on its own.
Common questions
- Quantitative aptitude - percentages, time-speed-distance, profit/loss
- Verbal ability and reading comprehension
- Logical reasoning - puzzles, seating arrangements, data interpretation
Technical MCQ + domain test
Section titled “Technical MCQ + domain test”CS fundamentals MCQs (OS, DBMS, OOPS, networks) plus, in some drives, domain-specific pseudocode or fundamentals questions. Exact format has varied year to year, so treat this as a general shape rather than a fixed spec.
Common questions
- MCQs on OS concepts - scheduling, deadlock, memory management
- DBMS fundamentals - normalization, joins, keys
- OOPS concepts - inheritance, polymorphism, encapsulation
- Basic pseudocode / logic-tracing questions
Coding round (PGET track)
Section titled “Coding round (PGET track)”Candidates on the PGET track (or those offered a GET-to-PGET upgrade) get an added coding round with problems around LeetCode easy-to-medium difficulty, on top of the standard GET process.
Common questions
- Array and string manipulation problems
- Basic sorting/searching implementation
- Simple recursion or pattern-based coding problems
Communication Assessment
Section titled “Communication Assessment”Run on a proctored platform like SpeechX or Mettl, this checks spoken and written English - listening comprehension, sentence construction, and speaking fluency. Multiple candidate write-ups flag this as a genuine elimination round with a real rejection rate, catching people who cleared the technical stages comfortably.
Common questions
- Listening comprehension followed by response questions
- Spoken fluency prompts scored for clarity and grammar
- Sentence correction and written English MCQs
Round-by-round accounts, including how tough this round can be, are on the Hexaware interview experience page.
Technical / EC Interview
Section titled “Technical / EC Interview”A relatively short round (often 15-25 minutes) on your resume languages, OOPs, DBMS, DSA basics, and projects. Candidate reports describe clearing this as feeling close to final, since the HR round after it is comparatively brief.
Common questions
- Explain OOPs concepts with examples from your own code
- Walk through a project on your resume - your specific contribution
- Basic DSA questions - array/string problems, simple data structure operations
- SQL query questions relevant to a project you mention
HR Interview
Section titled “HR Interview”A closing round on personality, relocation, and standard behavioral questions. Some drives mention a service agreement or a training-upgrade path (GET to PGET) discussed here.
Common questions
- Tell me about yourself and why Hexaware
- Are you open to relocating to Chennai, Pune, Mumbai, or Bengaluru?
- Describe a situation where you worked in a team to meet a tight deadline
- Strengths, weaknesses, and how you handle failure
Sample answer frameworks for each of these are on the Hexaware HR interview questions page.
Common technical interview questions and answers
Section titled “Common technical interview questions and answers”Q: What is the difference between abstraction and encapsulation in OOPs?
Abstraction is about hiding complexity by exposing only what an object does, not how it does it - an abstract class or interface such as PaymentGateway declaring a pay() method is abstraction. Encapsulation is about hiding data by keeping fields private and exposing controlled getters and setters, so invalid state cannot be assigned from outside. A useful one-line distinction: abstraction is design-level and solves the problem at the interface, encapsulation is implementation-level and solves it at the data. In Java, abstraction is achieved with abstract classes and interfaces, encapsulation with access modifiers.
Q: Explain database normalization up to 3NF with an example.
Normalization removes redundancy and update anomalies by splitting tables. A table is in 1NF when every column holds atomic values and there are no repeating groups - so storing phone1, phone2 in one row breaks 1NF. It reaches 2NF when it is in 1NF and no non-key column depends on only part of a composite key; if the key is (student_id, course_id) and student_name depends only on student_id, that partial dependency must move to a Student table. It reaches 3NF when it is in 2NF and no non-key column depends on another non-key column; if a row stores dept_id and dept_name, dept_name is transitively dependent and belongs in a Department table.
Q: What is the difference between INNER JOIN and LEFT JOIN, and how would you find employees with no department?
INNER JOIN returns only the rows where the join condition matches in both tables, so an employee with a NULL or invalid dept_id disappears from the result. LEFT JOIN returns every row from the left table and fills the right table columns with NULL where there is no match. To find employees with no department you use a LEFT JOIN and filter on the NULL: SELECT e.emp_id, e.name FROM employees e LEFT JOIN departments d ON e.dept_id = d.dept_id WHERE d.dept_id IS NULL; This anti-join pattern is a very common Hexaware technical-round SQL question.
Q: Write a program to check whether a string is a palindrome, and state its complexity.
Use two pointers, one at index 0 and one at the last index, compare the characters, and move them toward each other while they match; return false the moment two characters differ, and true if the pointers cross. This runs in O(n) time and O(1) extra space, which is better than reversing the string into a new buffer and comparing, since that costs O(n) extra space. If the interviewer adds a case-insensitive or alphanumeric-only requirement, normalize with a lowercase conversion and skip non-alphanumeric characters while advancing the pointers.
Q: How does binary search work and why is it O(log n)?
Binary search works only on a sorted array: compute mid as low + (high - low) / 2, compare the target with the element at mid, and discard half the range each iteration by moving low to mid + 1 or high to mid - 1. Because the search space halves every step, the number of steps needed is log base 2 of n, giving O(log n) time and O(1) space for the iterative version. Writing mid that way rather than as (low + high) / 2 avoids integer overflow on very large indices, which is a follow-up interviewers like to ask.
Q: What are the four necessary conditions for deadlock in an operating system?
Deadlock requires all four of mutual exclusion (at least one resource is non-shareable), hold and wait (a process holds one resource while waiting for another), no preemption (a resource cannot be forcibly taken from a process), and circular wait (a closed chain of processes each waiting on the next). Breaking any single condition prevents deadlock - for example, requiring processes to request all resources up front breaks hold and wait, and imposing a global ordering on resource acquisition breaks circular wait. The Banker’s algorithm is the classic deadlock-avoidance approach, which grants a request only if the resulting state is still safe.
Q: What is the difference between method overloading and method overriding?
Overloading means several methods in the same class share a name but differ in parameter list (number, type, or order); it is resolved by the compiler at compile time, which is why it is called static or compile-time polymorphism. Overriding means a subclass provides its own implementation of a method with the same signature as the parent’s; it is resolved by the JVM at run time based on the actual object, which is dynamic or run-time polymorphism. Return type alone cannot distinguish overloaded methods, and an overriding method cannot reduce the visibility of the method it overrides.
Q: How would you find the second largest element in an array in one pass?
Keep two variables, largest and secondLargest, both initialized to the smallest possible value. Walk the array once: if the current element is greater than largest, set secondLargest to largest and largest to the current element; else if the element is greater than secondLargest and not equal to largest, set secondLargest to the element. This is O(n) time and O(1) space, versus O(n log n) if you sort first. Mention the edge cases the interviewer is listening for: arrays of fewer than two elements, and arrays where every element is identical, in which case no second largest exists.
Frequently asked questions about Hexaware interviews
Section titled “Frequently asked questions about Hexaware interviews”What is the Hexaware interview process for freshers?
Hexaware runs two related fresher tracks - GET (Graduate Engineer Trainee) and PGET (a step up from GET) - through roughly 5 rounds: 1. Aptitude Test (~60 minutes, quantitative, verbal, logical reasoning, no negative marking). 2. Technical MCQ + domain test. 3. Coding round (PGET track adds this; GET may skip straight to interviews). 4. Communication Assessment on a platform like SpeechX or Mettl - a real elimination round, not a formality. 5. Technical/EC (Engineering Competency) Interview and a closing HR Interview. Eligibility is typically 60% aggregate or 6.0 CGPA in B.E./B.Tech with no active backlogs.
What is the difference between Hexaware’s GET and PGET tracks?
GET (Graduate Engineer Trainee) is the standard fresher entry track. PGET adds a coding round on top of the GET process and is pitched as an upgrade path - one candidate account cites a higher CTC (around ₹6 LPA in that specific post) for PGET versus GET, but treat any single number as one report, not a universal figure. Some candidates start on GET and are later offered a PGET upgrade via additional coding plus an EC interview.
What is the Communication Assessment round at Hexaware?
It’s a proctored test (commonly on SpeechX or Mettl) that checks spoken and written English proficiency. Candidate reports consistently describe it as a genuine elimination round with a meaningful rejection rate - not a rubber-stamp step - since Hexaware’s delivery roles are client-facing.
How many rounds are there in the Hexaware interview?
Most freshers go through an aptitude test, a technical MCQ/domain round, the Communication Assessment, a Technical or EC interview, and a closing HR interview - roughly 5 touchpoints. PGET-track candidates add a coding round. Some accounts note that clearing the technical round feels close to final, since the HR round that follows is comparatively short.
How should I prepare for Hexaware interviews?
Practice quantitative aptitude, verbal, and logical reasoning under a 60-minute time limit, revise CS fundamentals (OS, DBMS, OOPS, networks) for the technical round, and specifically prepare for the Communication Assessment - it trips up more candidates than the technical stages. Be ready to discuss your resume languages and projects clearly in the technical/EC interview.