Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
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.
Interview experience
Hexaware interview experiences covering Aptitude Test, Technical MCQ + domain test, Coding round (PGET track), Communication Assessment (SpeechX/Mettl), +2 more. Round-wise notes, common questions, and what candidates report clears each stage.
HR interview questions
Hexaware HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
| 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 |
These answers are compiled from public candidate reports and prep guides, not from an official notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | PrepInsta’s pattern lists 90 questions for GET: 60 aptitude questions (20 each of quant, logical and verbal) in 60 minutes, then 30 domain questions (15 pseudocode, 15 computer fundamentals) in 30 minutes. PGET adds 2 coding problems in 60 minutes. Some candidate reports describe a shorter 75-question, 75-minute paper, so check your drive mail. |
| Does it have negative marking? | No, by consistent candidate and prep-guide report. Attempt every question. |
| Is there a sectional cutoff? | Yes, by prep-guide report. PrepInsta lists separate on-campus cutoffs for quant, verbal, logical, domain and coding, so a weak section can eliminate you even with a good total. Hexaware does not publish the numbers. |
| How much is the cutoff? | Not officially published. PrepInsta’s estimates are 65% for quant and domain, 68% for logical, 70% for verbal and 80% overall; treat these as prep-site figures. Eligibility is commonly 60% or 6.0 CGPA in 10th, 12th and degree, no live backlogs and an academic gap of no more than one year. |
| Which platform is it on? | The communication assessment runs on Mettl (SpeechX). No public source reliably names the aptitude test platform; the invite mail carries the link. |
| Is there coding? | Only on the PGET track: 2 problems in 60 minutes in C, C++, Java or Python. GET candidates take aptitude and domain MCQs only. |
| Is there a service agreement? | Yes. Most explainers describe a 3-year service agreement with a bond of about ₹2 lakh for both GET and PGET. Read the exact terms in your offer letter. |
| Is there a GD? | Some drives add one. A 2025 Chennai PGET candidate reported a group discussion before the aptitude test; most campus reports do not mention one. |
The technical interview follows your track. These are questions candidates have reported on Glassdoor for 2024-2025 Hexaware drives; they show the level and style, not a fixed list.
| Track | Reported questions and topics |
|---|---|
| GET (~₹4 LPA) | SQL queries, OOP concepts such as abstraction and encapsulation, basic Python or C++ programs, questions about your certifications, and explaining a linked list with insertion and deletion. Programming fundamentals, DBMS and OS basics tied to your project. |
| PGET (~₹6 LPA) | A resume-led technical round on DBMS and OOP: DDL versus DML, DELETE versus TRUNCATE versus DROP, DBMS versus RDBMS. Live coding with screen share for a prime-number check and the Fibonacci series. One 2025 report describes a final extra round with harder coding and a further technical interview. |
| SPGET (premium track) | Few public interview reports. 2025 off-campus listings describe a higher package, a stricter 75% or 7.5 CGPA eligibility bar and the same 3-year service agreement; expect deeper coding than PGET. |
Asked across every track: walk through your project and your exact role in it, why Hexaware, and whether you will relocate to Chennai, Pune, Mumbai or Bengaluru.
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
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
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
Run on a proctored platform like SpeechX on 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. Typical shape (~45–60 minutes, often ~67 scored items, no negative marking): read a sentence aloud within ~30 seconds; listen-once audio and repeat or answer comprehension MCQs; one-minute extempore topics (weather, sports, smart work vs hard work); jumbled-sentence speaking; grammar fill-in-the-blanks (parts of speech, prepositions). PrepInsta and GET 2024 reports score you on vocabulary, fluency, pronunciation, and sentence mastery - practice with headphones in a quiet room.
Common questions
Round-by-round accounts, including how tough this round can be, are on the Hexaware interview experience page.
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
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
Sample answer frameworks for each of these are on the Hexaware HR interview questions page.
All three are fresher hiring tracks in the same Hexaware recruitment drive, not separate companies. GET (Graduate Engineer Trainee, about ₹4 LPA) takes the aptitude, domain, communication, technical and HR rounds. PGET (Premier Graduate Engineer Trainee, about ₹6 LPA) adds a 2-problem coding test and, in some drives, an extra coding and technical round at the end. Some GET candidates are later offered a PGET upgrade through that extra coding round.
SPGET is a smaller premium track advertised off-campus in 2025 with a higher package and a stricter 75% or 7.5 CGPA eligibility bar. All three tracks carry the service agreement described above. This page covers the GET and PGET campus process; if your mail says SPGET, expect the same structure with harder coding.
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.
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.
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.
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.
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.
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.
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.
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.
No. Candidate reports and prep guides consistently say there is no negative marking in the Hexaware aptitude, domain or communication tests, so attempt every question. Check the instruction screen of your own test.
Yes, by prep-guide report. PrepInsta lists separate cutoffs for quant, verbal, logical, domain and coding, estimated at 65-80%, but Hexaware does not publish official numbers. Eligibility is commonly 60% or 6.0 CGPA throughout with no live backlogs.
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.
PGET pays more than GET (about ₹6 LPA versus ₹4 LPA in candidate reports) and adds a coding round; 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.
It is an elimination-stage 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.
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.
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.
| Stage | Strong signal | Weak signal |
|---|---|---|
| Written aptitude | Finish under time without freezing | Coding-only prep; quant blank |
| Communication (Mettl/SpeechX) | Clear read-aloud / spoken English | Freezing on mic tasks |
| Coding (PGET) | Two array/string problems without IDE panic | Blank editor on PGET track |
| HR | Bond (~3 year / ~₹2 lakh on many explainers) + Chennai/Pune honesty | “See the bond later” attitude |
GET vs PGET bands differ. Confirm which track your mail describes before you practise.
Good fit: You can finish a 60-minute aptitude paper without freezing, you will speak English into a mic, and you will relocate to Chennai or Pune. If you want PGET, you already finish two array/string problems without an IDE panic.
Harder path: You only practiced coding and skipped quant; you freeze on read-aloud; you refuse shifts; you want to “see the bond later.” Hexaware HR is a logistics round.
Use this as a default four-week loop before a Hexaware drive. Adjust to your invite timeline.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Candidate-reported fresher/early-career packages for Hexaware often cite GET ~₹4 LPA and PGET ~₹6 LPA (PGET adds a coding round). Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location. Many campus PPTs also discuss a service agreement / bond - read duration and recovery on the offer, not social-media summaries alone.
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Hexaware interview experience page. For OA papers and coding drills, use Hexaware on placementpapers.app. OA quick answers and track-wise questions draw on PrepInsta’s Hexaware test pattern page, eligibility explainers on PrepInsta and placementpreparation.io, 2025 off-campus SPGET listings and 2024-2025 Glassdoor interview reviews.
