Interview experience
KPMG interview experiences covering Online Aptitude Test, Group Discussion (if conducted), Technical Interview, HR Interview. Round-wise notes, common questions, and what candidates report clears each stage.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
KPMG Global Services (KGS, KPMG’s technology delivery arm and the entry point for most CS/IT campus hires) runs a 2-4 stage process built around a five-section timed aptitude test, a data-structures-and-project technical interview, and a closing HR round.
Interview experience
KPMG interview experiences covering Online Aptitude Test, Group Discussion (if conducted), Technical Interview, HR Interview. Round-wise notes, common questions, and what candidates report clears each stage.
HR interview questions
KPMG HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
| Round | Duration | What they test |
|---|---|---|
| Online Aptitude Test | 60 min | Math ability, logical reasoning, verbal ability, pseudocode, puzzles |
| Group Discussion (if conducted) | 20-30 min | Current affairs / business topic |
| Case study (many KGS / advisory drives) | 30-45 min | Structured problem, communication, pragmatic thinking |
| Technical Interview | 30-45 min | Projects, data structures, algorithmic problem-solving, language trivia |
| HR Interview | 20-30 min | Consulting fit, 2-year plan, client-readiness, values alignment |
These answers are compiled from public candidate reports and prep guides, not from an official KPMG notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | Reports conflict. KGS campus reports describe a 60-minute, five-section paper (maths, logical, verbal, pseudocode, puzzles); HitBullseye describes 64 questions in 40 minutes (24 numerical and 40 verbal, 20 minutes each). |
| Does it have negative marking? | No. Each section is timed separately and you cannot return to it, so attempt everything. |
| Is there a sectional cutoff? | Not published. Because sections are timed and scored separately, treat each one as something you must clear. |
| How much is the cutoff? | No official score cutoff; shortlists are relative to the batch. Eligibility is 60% or 6.0 CGPA in 10th, 12th and graduation, no backlogs at interview time. |
| Which platform is it on? | No public source reliably names one. It is a proctored online test arranged through your placement cell; the invite mail has the link. |
| Is there coding? | Usually no live coding. The pseudocode section tests reading and tracing code; one prep guide reports 2 medium coding problems on some drives. |
| Is there a GD? | On some campuses, yes. HitBullseye reports roughly half the candidates are cut at the GD where it is held, after 5 minutes to think about the topic. |
Questions below are ones candidates report on Glassdoor and Naukri Code360 for each KPMG hiring route. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| KGS technology (software, CS/IT graduates) | Java, DBMS and data structures. Normalisation with an example; hash map vs tree vs queue; memory management and OOP gotchas in your language. Open-ended: how would you approach a client’s data-migration project? |
| KGS data and analytics | Python lists and dictionaries, Python connected to a database, scenario questions. SQL joins and aggregations, Excel and Power BI. One campus report advises practising about 100 complex SQL queries. |
| Audit and tax (commerce graduates) | Basic finance and audit questions, why audit, a time you disagreed with a colleague, and teamwork stories. Some candidates report almost no technical questions. |
Asked across every role: why KPMG and why consulting, your 2-year plan, how you work under tight deadlines, and KPMG’s values.
A strictly timed, five-section paper: Mathematics Ability, Logical Reasoning, Verbal Ability, Pseudocode, and Puzzles, each with its own time block and no navigating back once a section starts. No negative marking, but pacing within each section matters since you can’t return to skipped questions.
Common questions
Held at some campuses, 15-20 candidates typically split into groups of 6-8 to discuss a current-affairs or business topic for 15-20 minutes, evaluated on structured argument and listening, not volume.
Common questions
Round-by-round breakdowns are on the KPMG interview experience page.
KPMG India’s public careers material names a case study stage for many early-career roles - distinct from a pure coding screen. You typically receive a business-technology scenario (data quality, migration risk, control weakness, or analytics recommendation) and must structure an answer aloud or in brief notes: clarify objectives, state assumptions, outline options, pick a recommendation, and note risks. Interviewers score verbal communication and pragmatic thinking, not a single correct formula. Engineering hires into KGS/GTA should still expect SQL or data-interpretation follow-ups inside the same conversation.
Common prompts
Evaluates fundamental CS knowledge, data-structure proficiency, and algorithmic problem-solving alongside a resume/project discussion. Expect language-specific trivia and questions that test how you break down an ambiguous, open-ended problem.
Common questions
Assesses consulting fit directly: a clear 2-year plan, one genuine growth area, and comfort with client-facing work, plus standard motivation and culture-fit questions.
Common questions
Sample answer frameworks for each of these are on the KPMG HR interview questions page.
KPMG hires across genuinely different business lines - Audit & Assurance, Tax, Advisory/Consulting, and KGS (KPMG Global Services, the technology delivery arm running from eight India locations that does actual software, data, and analytics work). This page describes the KGS/technology track most CS/IT campus hires enter: an OA with a Pseudocode section, a data-structures-and-project technical interview, and HR. Audit and Tax hiring, aimed largely at commerce and accounting graduates, runs a lighter process built around aptitude, group discussion, and HR, with no coding component. Confirm which business line your offer letter or registration email names before you prep.
Count how many times the innermost statement executes as a function of n, from the inside out. If the outer loop runs n times and the inner loop runs n times for each, that is n squared. But if the inner variable doubles each iteration - i starting at 1 and becoming i * 2 until it reaches n - the inner loop runs only log base 2 of n times, giving O(n log n) overall. If the inner loop’s bound depends on the outer index, as in an inner loop from 0 to i, the total is 1 plus 2 plus up to n, which is n times n plus one over two, and therefore still O(n squared). The trap KPMG’s Pseudocode section likes is a loop whose counter is modified inside the body, so always trace two or three iterations by hand with a small value such as n equals 4 before answering.
Use a hash map when you need average O(1) lookup, insert, and delete by exact key and you do not care about ordering - a lookup table of customer IDs, or counting occurrences. Use a balanced tree such as a TreeMap or a database B-tree index when you need the keys kept in sorted order, because it supports range queries, nearest-key lookups, and ordered iteration in O(log n), none of which a hash map can do at all. Use a queue when the requirement is processing order rather than lookup - FIFO for task processing, or a priority queue when the next item should be the highest-priority one, at O(log n) per insert and extract. The honest framing for an interviewer is that hash maps trade ordering for speed, trees trade a log factor for ordering, and queues are about scheduling rather than search.
A primary key uniquely identifies each row, cannot be NULL, and there is exactly one per table; most engines create a clustered or primary index on it automatically. A unique key also enforces uniqueness but permits NULLs (typically one, depending on the engine) and a table can have several - an email column is the usual example, where you want no duplicates but the column is not the row’s identity. A foreign key is a column that references the primary key of another table, enforcing referential integrity so you cannot insert an order for a customer that does not exist, and controlling what happens on deletion via ON DELETE CASCADE, SET NULL, or RESTRICT. A composite key is simply a primary key made of more than one column, which is common in join tables.
WHERE filters individual rows before grouping and aggregation happen, so it cannot reference an aggregate function. HAVING filters the groups after GROUP BY has aggregated them, so it can. A query that needs both reads naturally: SELECT dept_id, COUNT(emp_id) FROM employees WHERE status = 'ACTIVE' GROUP BY dept_id HAVING COUNT(emp_id) > 5; - the WHERE removes inactive employees before counting, and the HAVING keeps only departments with more than five active employees. Doing the row filter in HAVING instead would be both wrong and slower, since every row would be aggregated first. The logical processing order worth memorising is FROM, WHERE, GROUP BY, HAVING, SELECT, ORDER BY, which also explains why a column alias defined in SELECT cannot be used in WHERE.
The stack holds function call frames - local variables, parameters, and return addresses - and is managed automatically: memory is allocated when a function is entered and freed when it returns, in strict LIFO order. It is very fast, since allocation is just moving a pointer, but it is small and fixed, which is why deep or infinite recursion produces a stack overflow. The heap is the region for dynamically allocated memory whose lifetime is not tied to a function call - new in Java and C++, malloc in C - so it is larger and flexible, but allocation is slower and it fragments over time. In C and C++ you must free heap memory yourself or you leak it; in Java and C# a garbage collector reclaims unreachable objects. The interview-ready summary: object references live on the stack, the objects themselves live on the heap.
Encapsulation bundles data with the methods that operate on it and restricts direct access to the fields, so an object controls its own invariants through getters and setters. Abstraction exposes only the essential interface and hides the implementation, so callers depend on what an object does rather than how. Inheritance lets a subclass reuse and specialise a parent’s behaviour, expressing an is-a relationship - though composition is usually preferred where the relationship is really has-a, since deep hierarchies become brittle. Polymorphism lets one interface serve many types, either at compile time through overloading or at run time through overriding, which is what allows new types to be added without changing the code that consumes them. Interviewers usually want a one-line example for each rather than the definitions alone.
Start by profiling the source: row counts, distinct values, null rates, and the actual data types, since legacy systems almost always contain values that violate the documented schema. Then agree the target model and write an explicit field-level mapping, including the transformation rules and what happens to records that cannot be mapped. Build the extract, transform, and load as a repeatable, restartable job rather than a one-off script, so a failed run can be re-run without producing duplicates - that means idempotent loads keyed on a natural or surrogate identifier. Reconcile at every stage with control totals: source row count versus target row count, and a checksum on key numeric columns, plus a targeted sample compared field by field. Finally, plan the cutover itself - a full dry run against a copy of production, a defined freeze window, a rollback plan, and a period of parallel running where both systems are compared before the legacy system is retired. This open-ended question is testing structure, so state those phases explicitly before diving into detail.
Group by the columns that are supposed to be unique together and keep only the groups with more than one row: SELECT email, COUNT(1) AS cnt FROM customers GROUP BY email HAVING COUNT(1) > 1; To see the full duplicate rows rather than just the offending values, join that result back to the table, or use a window function: SELECT * FROM (SELECT c.*, ROW_NUMBER() OVER (PARTITION BY email ORDER BY created_at) AS rn FROM customers c) t WHERE rn > 1; That second form is also the deletion pattern - keeping row number 1 as the survivor and deleting the rest - which is what a data-quality or migration cleanup task actually needs. Mention that NULLs do not group together as equal in some engines, which is a common source of missed duplicates.
No. Prep guides and campus reports consistently describe KPMG’s aptitude test without negative marking. Each section has its own timer and you cannot go back once it starts, so attempt every question before a section closes.
KPMG does not publish a score cutoff; shortlists are relative to the batch. Eligibility is fixed: 60% or 6.0 CGPA in 10th, 12th and graduation, with no backlogs at the time of the interview, and prep guides say all engineering branches can apply to KGS.
For KPMG Global Services (KGS, KPMG’s technology and delivery arm and the entry point for most CS/IT campus hires), the process typically runs 2-4 stages: 1. Online Aptitude Test (60 minutes) - five timed sections: Mathematics Ability, Logical Reasoning, Verbal Ability, Pseudocode, and Puzzles, with no navigating back once a section starts. 2. Group Discussion at some campuses (20-30 minutes) - current affairs or business topic. 3. Technical Interview (30-45 minutes) - projects, data structures, algorithmic problem-solving, and language-specific trivia. 4. HR Interview (20-30 minutes) - motivation, consulting fit, and a 2-year plan. Total duration: 2-3 weeks.
The OA’s Pseudocode section tests algorithmic reading rather than live coding, alongside math, logical reasoning, verbal, and puzzle sections. Technical interviews cover resume projects, data-structure fundamentals, language-specific trivia (memory management, paradigms), and how you break down an ambiguous problem. HR checks a clear 2-year plan, a genuine growth area, and comfort with client-facing work.
KPMG typically runs an Online Aptitude Test, an optional Group Discussion, a Technical Interview, and an HR Interview - 2-4 stages depending on the drive. Some reports describe a tighter “2-round” campus process (test, then a combined technical+HR round); others run all four separately.
Focus on SQL basics, data interpretation, and pseudocode-style algorithmic reading - three focused weeks is enough for most KGS drives. Revise data structures and language-specific trivia (memory management, paradigms), prepare one crisp project narrative, and practise structuring answers to ambiguous, open-ended problems - KPMG interviewers explicitly test that.
KGS (KPMG Global Services) is KPMG’s technology and delivery arm - it’s what this page’s process describes: an OA with a Pseudocode section, a data-structures-and-project technical interview, and HR. KPMG’s core Audit, Tax, and Assurance hiring runs a separate, largely non-coding process built around aptitude, group discussion, and HR, aimed mainly at commerce/accounting graduates.
It’s one of five timed sections in KPMG’s OA, alongside Mathematics Ability, Logical Reasoning, Verbal Ability, and Puzzles. It tests your ability to read and trace through algorithm-like pseudocode and predict output or identify errors - closer to reading comprehension for code than to writing a program from scratch.
For many KGS and advisory drives, KPMG’s careers pages describe a distinct case study stage assessing subject-matter framing, communication, and pragmatic thinking. You structure a client-style problem - clarify goals, state assumptions, compare options, recommend a path, and call out risks - rather than solving a single trick puzzle under time pressure.
Good fit: You already solve medium aptitude under a timer, you can narrate a project without rambling, and you read business news enough to hold a GD for two minutes without panic. Internships in consulting/IT/finance help; ownership on a campus project beats vague “assisted team” bullets.
Harder path: You only practiced untimed puzzles; you dominate GD without listening; your Why KPMG is “Big Four brand” with zero service-line curiosity. Technical rounds reward concrete project trade-offs more than namedropping frameworks.
Use this as a default four-week loop before a KPMG 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 KPMG often cite Confirm written offer (commonly ₹6-10 LPA band for analyst roles). Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
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 KPMG interview experience page. For OA papers and coding drills, use KPMG on placementpapers.app. OA quick answers and role-wise questions draw on HitBullseye’s KPMG test-pattern page, FACE Prep’s KPMG guides, and Glassdoor and Naukri Code360 candidate reports for KPMG and KGS.