Hexaware: Graduate Engineer Trainee
Hexaware's fresher process is described as sequential elimination rounds: an aptitude test, technical MCQs, a coding round and an HR interview, with the PGET track adding a coding assessment. Guides cite a CoCubes/Superset-style platform, and lengths differ between 75 and 90 minutes. Hexaware says its recruitment is free; confirm details with your drive notice.
37 questions · 4 rounds · updated Nov 2026
How the interview works
- Aptitude test: Reported: quantitative, logical and verbal sections.
- Technical MCQs: C, C++, Java output questions, DBMS, OS, networks.
- Coding round: DS and algorithm problems; PGET adds a further assessment.
- HR interview: Fit, flexibility and communication.
Sample questions
- 01
Why should we hire you?
MediumFit
Model answer
What the interviewer checks
Whether you understand the job and can match yourself to it in three points, with confidence and without arrogance.
How to answer
"Three reasons. First, I can contribute from early on: I've already built and deployed a Spring Boot API in a real company, so the basics of Git, code review and REST aren't new to me. Second, I learn quickly. I picked up React in three weeks for our placement-tracker project, and it's now used by 400 students. Third, I'm reliable over the long run: I've practised coding every day for 14 months, and I bring the same consistency to work. Freshers here go through training and then join projects with changing tech, and I think I'd do well in that."
Common mistakes
- "Because I need this job" or "I'm hardworking" with nothing behind it.
- Comparing yourself to other candidates ("I'm better than others").
- 02
In an election between two candidates, the winner got 58% of the valid votes and won by 1,440 votes. How many valid votes were cast?
MediumPercentages
- 03
Find the second largest distinct number in an array without sorting. Return -1 if it doesn't exist. Example: [12, 35, 1, 10, 34, 1] → 34; [7, 7, 7] → -1
EasyArrays
Approach and solution
Approach
One pass with two variables. If a number beats the largest, the old largest becomes second. Otherwise, if it's strictly between them, it becomes second. Skipping equal values handles duplicates.
def second_largest(a): first = second = None for x in a: if first is None or x > first: first, second = x, first elif x != first and (second is None or x > second): second = x return -1 if second is None else second assert second_largest([12, 35, 1, 10, 34, 1]) == 34 assert second_largest([7, 7, 7]) == -1 assert second_largest([5, 9]) == 5Complexity: O(n) time, O(1) space.
34 more questions, members only
- Aptitude test13
- Technical MCQs13
- Coding round5
- HR interview6
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.