Coding questions
Hexaware Online Assessment
Overview
Here is how public prep guides and student write-ups describe the Hexaware online assessment. This is not an official company brochure.
Split GET/PGET tracks; communication assessment is a real round that rejects a lot of people; PGET adds coding.
Usual selection rounds
Rounds students usually mention: Resume shortlisting → Online aptitude + tech/domain test → Coding (PGET) → Communication assessment (SpeechX/Mettl) → Technical / EC interview → HR interview
| Item | From student reports |
|---|---|
| Platform | Superset / CoCubes reported for aptitude+domain; Mettl reported for communication |
| Online test summary | GET and PGET share a heavy aptitude+domain written filter. PGET adds a coding round. Communication assessment eliminates many candidates. |
| Eligibility notes | Drive-specific; check notification (often around 60% / 6.0+ in mass-hiring guides - check your college placement email) |
| Branches (reported) | Typically BE/BTech/MCA and related - confirm drive |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Verbal ability | 20 | part of ~60 min aptitude block | - |
| Logical ability | 20 | - | - |
| Numerical ability | 20 | - | GFG 2024: aptitude felt time-pressured (60Q / 60 min) |
| Domain / tech | 30 | ~30 min | Pseudocode + computer fundamentals commonly reported |
| Coding (PGET) | 2 problems | drive-specific | Easy-medium arrays/strings/loops style |
| Communication | n/a | ~20-30 min | Read/listen/repeat, extempore, grammar; GFG 2024: large drop here before tech interview |
Extra notes from sources
- PrepInsta 2025 pattern distinguishes GET vs PGET (coding only for PGET).
- placementpreparation.io composite: ~90 questions / 90 minutes for aptitude+domain, no negative marking claimed - still check your college placement email.
- LinkedIn GET account mentions quantitative, logical, pseudocode, and common applications (email/MS Office/fundamentals).
Sample practice question styles
These are practice questions for speed - not claimed to be from a real Hexaware live paper.
Coding Q1: Rotate array
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
Hexaware tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: First unique character
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
Hexaware tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Stack with min
Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
Hexaware tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
Hexaware tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- Drill timed aptitude (60Q/60min pace) plus pseudocode/computer fundamentals.
- Do not underestimate the AI/communication round - practice speaking clearly under timed prompts.
- For PGET: be ready for 2 easy-medium coding problems.
- Tech interview: defend resume stack and one project with basics of OOPs/DBMS.
Sources
- Hexaware Recruitment Process 2025 For Freshers - PrepInsta (prepinsta)
- Hexaware Placement Papers - PrepInsta (prepinsta)
- Hexaware Interview Experience For PGET (On-Campus) 2024 - GFG (gfg)
- Hexaware Real Life Interview Experiences (other)
- LinkedIn - Hexaware GET interview experience series (other)
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.
Comments & Suggestions
Related
Similar companies
Mphasis · Virtusa · Coforge · Persistent Systems · CGI