Genpact coding interview
questions, leaked.
3 problems reported across recent Genpact interviews. Top patterns: hash table, linked list, design. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Genpact's assessment is small but sharp. Three problems across easy and medium, heavily weighted toward hash tables and linked lists. You're looking at a design problem that chains hash tables with doubly-linked lists, a database query, and a bit-manipulation warm-up. The design piece is the real test here. Most candidates freeze on the authentication manager problem because it mixes data structures in a way that's not obvious on first read. StealthCoder runs invisibly during the live assessment and solves it in seconds if you hit a wall. Know your hash-table lookups and linked-list mechanics cold before you sit down.
Top problems at Genpact
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Design Authentication Manager | MEDIUM | 100.0 | 58% | Hash Table · Linked List · Design |
| 02 | Second Highest Salary | MEDIUM | 78.9 | 44% | Database |
| 03 | Missing Number | EASY | 78.9 | 70% | Array · Hash Table · Math |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Genpact OA. The proctor cannot see it. Screen share cannot detect it. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround.
Get StealthCoder- hash table2 · 67%
- linked list1 · 33%
- design1 · 33%
- doubly linked list1 · 33%
- database1 · 33%
- array1 · 33%
- math1 · 33%
- binary search1 · 33%
- bit manipulation1 · 33%
- sorting1 · 33%
Hash tables show up in two of three problems, so that's your foundation. The top problem, Design Authentication Manager, demands you chain a hash table with a doubly-linked list to track recency and eviction. That's not a typical drill problem. Second Highest Salary is a database query that tests SQL syntax and window functions. Missing Number is the gimme, but it's loaded with alternative approaches: array, hash table, math, binary search, bit manipulation, sorting. The distribution tells you Genpact values data-structure composition over raw algorithm speed. Most candidates over-study graph and tree patterns for this company and miss the fact that design and hashing dominate. If you blank on the auth manager mid-OA, StealthCoder surfaces the hash-table plus linked-list pattern in real time, invisible to the proctor.
Companies with similar patterns
If you prepped for Genpact, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Genpact.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built because the OA filter rejects engineers who'd pass the on-site. That's a broken filter. This is the workaround. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Genpact interview FAQ
How much time should I spend on hash-table problems for Genpact?+
Hash tables appear in two of three reported problems. Spend 40 to 50 percent of your prep time here. Focus on collision handling, lookup optimization, and chaining hash tables with other data structures like linked lists. The design problem requires this exact combo.
Is the design problem actually harder than it looks?+
Yes. Design Authentication Manager mixes hash tables, linked lists, and doubly-linked-list mechanics. Most candidates see 'design' and think high-level architecture. You need to code LRU-like eviction logic. Drill the implementation, not just the concept.
Should I study database queries before my Genpact OA?+
Second Highest Salary is one of three problems, so allocate time accordingly. If you're weak on SQL window functions and subqueries, refresh those. A one or two hour SQL review covers it. This is lower priority than the hash-table design work.
What's the fastest way to solve Missing Number?+
It's an easy problem, but it's a multi-tool. Bit manipulation via XOR is fastest (O(n) time, O(1) space). Hash table works too. Given Genpact's focus on hashing, hash table is probably safer if you're under time pressure during the OA.
How many linked-list problems should I solve before the assessment?+
Linked lists appear in one top problem but paired with hash tables in a design context. Solve five to eight standard linked-list problems (reverse, cycle detection, merge), then focus on how to nest them inside hash tables. The pattern matters more than volume.