Skip to content

EY Interview Questions and Answers (2026)

Ernst & Young (EY) is one of the Big Four accounting firms, providing assurance, tax, consulting, and advisory services to organizations globally. In India, EY hires technology and consulting talent to support audit automation, analytics, and digital advisory projects for major clients.
HQ: London, UK
Employees: 300,000+
Revenue: $49+ Billion USD
Website: ey.com ↗

Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide

Overview

EY GDS (EY’s technology delivery arm, and the entry point for most CS/IT campus hires) runs a 3-4 stage process anchored by a timed aptitude-plus-coding OA, a project-heavy technical interview, and a closing HR round.

EY interview process at a glance

Round Duration What they test
Online Aptitude Test ~30 min per section Quantitative, logical reasoning, verbal ability
Coding round ~45 min One easy coding problem - arrays, hashing
Technical Interview 30-45 min Resume/project depth, DBMS (normalization, constraints)
HR Interview 20-30 min Teamwork, conflict-handling, fit

EY GDS online test: quick answers

These answers are compiled from public candidate reports and prep guides, not from an official EY notice, and drives differ. The instruction screen of your own test is the final word.

Question Answer
How many questions and how long? About 65 questions in 65 minutes for GDS tech roles in one 2026 prep guide: 20 quant, 15 logical, 15 verbal and 15 technical MCQs. Assurance and advisory roles swap the technical section for a Situational Strength Test of about 20 questions.
Does it have negative marking? No, on most recent drives. Each section has its own timer and unused minutes do not carry over.
Is there a sectional cutoff? Not published. One prep guide reports none, but because sections are timed separately, do not leave any section weak.
How much is the cutoff? No official score cutoff; shortlists are relative to the batch. Eligibility is about 60% or 6.0 CGPA with no active backlogs preferred.
Which platform is it on? Many GDS campus drives run it on AMCAT (SHL) with strict webcam and screen-share proctoring; others use a different vendor. Your invite mail names it.
Is there coding? Sometimes. Some GDS tech drives add a separate coding window with 1-2 easy problems (arrays, hashing, strings); several 2025 Glassdoor reports describe no coding at all, only a resume-based technical interview.
Is there a communication round? On many mass-hiring GDS drives, yes - a separate verbal or communication screen after the aptitude test. Assurance campus drives may run a GD instead.

EY interview questions by track

Questions below are ones candidates report on Glassdoor and GfG for each EY hiring route. They show the level and style, not a fixed list.

Track Reported questions and topics
GDS Associate Software Engineer A short (about 25 minute) resume-based technical round: OOP concepts, why Java is platform independent, SQL joins. Hash table collisions, 1NF to 3NF, primary vs foreign key, recursion and linked lists.
GDS Assurance (commerce graduates) Aptitude test with an MS Excel component on some drives, then a GD and two interviews. The three financial statements, Ind AS or IFRS basics, and for GDS roles the US GAAP vs IFRS angle.
Tax A technical round on tax knowledge, then partner and HR rounds. What do you know about tax? What are the main heads of income under the Income Tax Act?

Asked across every track: tell me about yourself, why EY and why this service line, a time your team disagreed, and whether you are comfortable with the location and shift offered.

Online Aptitude Test

Sections are timed separately - quantitative aptitude, logical reasoning, and verbal ability each get roughly 30 minutes, with no moving between sections once a timer starts. Many GDS drives run the OA on AMCAT (SHL) or a similar vendor after you submit academic details (Class 10, 12, and B.Tech aggregates). Candidate reports warn that proctoring is strict - keep your phone out of frame and finish early when the platform ranks by completion time, not only correctness.

Common questions

  • Quantitative: percentages, ratios, time-and-work problems
  • Logical reasoning: puzzles, seating arrangements, syllogisms
  • Verbal ability: reading comprehension, sentence correction
  • Technical MCQs on some campuses: OOP, DSA, OS mixed with aptitude in a single online filter

Coding round

A single easy coding problem, typically array or hashing-based, to be solved within about 45 minutes - though some pool-campus accounts describe two easy coding questions in the same OA. It’s a filter more than a deep DSA test - correctness and clean logic matter more than optimisation tricks. After the OA, several 2024 drives add a separate verbal / communication screen (listening, read-aloud, grammar correction) before in-person or virtual technical interviews.

Common questions

  • Array manipulation - find duplicates, subarray sums, or frequency counts
  • Hashing-based problems - two-sum style, grouping by key
  • Basic string processing (palindromes, anagrams)

Round-by-round breakdowns are on the EY interview experience page.

Technical Interview

Mostly a conversation about your resume projects - stack choices, hardest bug, what you’d rebuild - plus DBMS questions on normalization and constraints. EY GDS interviewers tend to probe for conceptual understanding rather than syntax recall. Some panels stay project-demo heavy (live demo, training-period questions); others run OOP, recursion, linked lists, binary search, and SQL join queries on paper. Cybersecurity follow-ups (SQL injection, recent breaches) appear in GDS 2023 reports even for generalist roles. After the OA, candidates are sometimes bucketed into competencies (Cyber, Oracle/EA, BPM, GRC Technology, etc.) - review your allotment email before the interview.

Common questions

  • Walk through your most complex project - architecture, your specific contribution, hardest bug
  • Explain how a hash table handles collisions (conceptually, not necessarily coded)
  • DBMS normalization forms (1NF/2NF/3NF) and why they matter
  • Explain a primary key vs foreign key constraint with an example
  • SQL joins and aggregation on a sample schema
  • Recursion / Fibonacci edge cases; singly vs doubly linked lists; optional ML regression if you claim it on the resume

HR Interview

A closing conversation on motivation, teamwork, and fit. EY HR frequently asks about a time you worked in a team that disagreed on approach, since GDS roles are collaborative and client-facing.

Common questions

  • Tell me about yourself and why EY
  • Describe a time your team disagreed on approach - how was it resolved?
  • Why audit/assurance or your chosen service line, if applicable?
  • How would you handle an ethical dilemma or a conflict of interest at work?
  • Are you comfortable with the location and shift EY GDS has offered you?

Sample answer frameworks for each of these are on the EY HR interview questions page.

Audit/Tax vs GDS/Technology: why the track matters

EY hires across genuinely different business lines - Audit & Assurance, Tax, Consulting, and GDS (Global Delivery Services, the technology and business-services arm doing actual software, data, and analytics work for EY’s global member firms). This page describes the GDS/technology track most CS/IT campus hires enter: an OA with a coding section, a project-and-DBMS-heavy 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 registration or offer letter names before you prep.

Common technical interview questions and answers

Q: How does a hash table handle collisions?

A collision happens when two different keys hash to the same bucket, which is unavoidable because the key space is larger than the bucket array. Separate chaining stores a linked list in each bucket - or, in Java 8 and later, a balanced tree once a bucket exceeds eight entries - so lookup degrades from O(1) average to O(n) or O(log n) in the worst case. Open addressing instead probes for another empty slot using linear probing, quadratic probing or double hashing, which keeps everything in one contiguous array and is cache-friendly but suffers clustering and needs tombstones on deletion. Either way performance depends on the load factor, and most implementations resize and rehash once occupancy passes about 0.75. EY interviewers usually want this explanation rather than an implementation.

Q: How do you solve the two-sum problem efficiently?

The brute-force approach checks every pair in O(n^2). The efficient answer uses a hash map: iterate once, and for each element compute the complement (target minus the current value), checking whether that complement is already in the map. If it is, you have your pair; otherwise store the current value with its index and continue. That is O(n) time and O(n) space, and it handles duplicates and negative numbers correctly because you look up the complement before inserting the current element. If the array is already sorted and you must use O(1) space, the two-pointer approach from both ends is O(n) instead.

Q: How do you check whether two strings are anagrams?

The simplest correct approach sorts both strings and compares them, which is O(n log n). The better answer uses a frequency count: build a hash map or a 26-slot array of character counts from the first string, decrement for every character of the second, and confirm every count ends at zero - O(n) time and O(1) space when the alphabet is fixed. Check the lengths first and return false immediately if they differ, since that is the cheapest possible rejection. Clarify with the interviewer whether case, spaces and Unicode matter, because a fixed 26-slot array quietly breaks the moment non-ASCII input is allowed.

Q: What are 1NF, 2NF and 3NF in database normalization?

First normal form requires every column to hold a single atomic value with no repeating groups, so a comma-separated list of phone numbers in one cell violates it. Second normal form requires 1NF plus the elimination of partial dependencies - no non-key attribute may depend on only part of a composite primary key, which typically shows up in a table keyed on order_id plus product_id where product_name depends on product_id alone. Third normal form requires 2NF plus no transitive dependency, so if employee_id determines dept_id and dept_id determines dept_name, then dept_name must move into a departments table. The purpose is removing redundancy and the insert, update and delete anomalies it causes, though reporting systems often denormalize deliberately for read speed.

Q: What is the difference between a primary key and a foreign key?

A primary key uniquely identifies each row in a table; it cannot be NULL, there is only one per table, and it usually backs a clustered index. A foreign key is a column in one table that references the primary key of another, enforcing referential integrity so no order can point at a customer id that does not exist. A foreign key may be NULL - which is how an optional relationship is modelled - and duplicate values are fine, since many orders belong to one customer. Deleting a referenced parent row is governed by the declared action: RESTRICT or NO ACTION blocks it, CASCADE deletes the children, SET NULL blanks the reference. A unique key differs from a primary key in that it permits NULL and a table may have several.

Q: Write a SQL query to find each department’s average salary, keeping only departments above 50000.

SELECT d.dept_name, AVG(e.salary) AS avg_salary FROM employees e JOIN departments d ON e.dept_id = d.dept_id GROUP BY d.dept_name HAVING AVG(e.salary) > 50000 ORDER BY avg_salary DESC; The filter belongs in HAVING rather than WHERE because it tests an aggregate, which does not exist until after grouping. If you also wanted to exclude interns before the average is computed, that row-level condition would go in WHERE, and both clauses can appear in the same query. Note that AVG ignores NULL salaries rather than treating them as zero, which can quietly skew the result when the column is nullable.

Q: How do you find duplicates in an array?

The general answer is a hash set: iterate once and report any element already present before inserting it - O(n) time and O(n) space. If the array contains n values in the range 1 to n, you can do it in O(1) extra space with index marking: for each value v, negate the element at index v minus 1, and if it is already negative then v is a duplicate. Sorting first and scanning adjacent pairs is a third option at O(n log n) time and O(1) space, worth mentioning when the interviewer forbids extra memory. State which constraint you are optimising for - EY’s coding round rewards a clean, correct solution with the trade-offs explained more than a clever one-liner.

Q: Explain INNER JOIN vs LEFT JOIN with a practical example.

INNER JOIN returns only rows where the join key matches in both tables - employees without a valid department ID drop out. LEFT JOIN keeps every row from the left table and fills unmatched right-side columns with NULL, which is how you find orphans (for example, employees with no department using WHERE d.dept_id IS NULL after a LEFT JOIN). RIGHT JOIN mirrors that from the other side; FULL OUTER JOIN combines unmatched rows from both. EY technical panels often ask you to write two or three join queries on a whiteboard, not only define terms.

Q: What is SQL injection and how do you prevent it?

SQL injection happens when user input is concatenated into a query string, letting an attacker alter the statement (for example, ’ OR ‘1’=’1 in a login field). Prevention means parameterized queries / prepared statements, input validation, least-privilege DB accounts, and avoiding dynamic SQL built from raw strings. A 2023 GDS selected candidate cited a consulting-firm breach while explaining injection - you do not need that level of detail, but showing you think about security in projects (especially auth modules) aligns with what some EY interviewers probe.

Q: Write recursive Fibonacci and state the base case.

Recursive Fibonacci defines fib(n) = fib(n-1) + fib(n-2) with base cases fib(0)=0 and fib(1)=1; the recursion stops when n hits those bases. Pure recursion is exponential without memoization - mention that trade-off if asked. Campus EY panels use this to check whether you state termination conditions before coding, not whether you memorize dynamic programming.

Frequently asked questions about EY interviews

Does the EY online test have negative marking?

No, on most recent drives. Prep guides and campus reports describe EY’s aptitude test without negative marking, but the instruction screen before each section is the authority. Sections are timed separately and unused minutes do not carry over.

What is the cutoff for the EY GDS online test?

EY does not publish a score cutoff; shortlists are relative to the batch, and one prep guide reports no sectional cutoff. What is fixed is eligibility: about 60% or 6.0 CGPA, with no active backlogs preferred. Check your campus mail, since requirements differ by college partnership.

What is the EY interview process for freshers?

For EY GDS (EY’s technology delivery arm and the entry point for most CS/IT campus hires), the process usually runs 3-4 stages: 1. Online Aptitude Test - quantitative, logical reasoning, verbal ability, sections often timed separately (about 30 minutes each). 2. Coding round - typically one easy coding problem (45 minutes), focused on arrays/hashing. 3. Technical Interview (30-45 minutes) - mostly project-based, plus DBMS questions on normalization and constraints. 4. HR Interview (20-30 minutes) - motivation, teamwork, and fit. Total duration: 2-3 weeks from application to offer.

What questions are asked in EY interviews?

The OA covers aptitude (quant, logical, verbal) plus one easy coding problem on arrays/hashing. EY GDS technical interviewers lean toward understanding over syntax recall - expect “explain how a hash table handles collisions” more than “implement one from scratch” - alongside a deep dive into your resume project and DBMS questions on normalization and constraints. HR checks teamwork and conflict-handling with real examples.

How many rounds are there in the EY interview?

EY typically runs an Online Aptitude Test, a separate coding round, a Technical Interview, and an HR Interview - so 3-4 stages, sometimes with a Group Discussion added at some campuses. Some drives merge HR with a managerial round; check that cycle’s college placement email.

How should I prepare for EY interviews?

Practise timed aptitude sections (quant, logical, verbal) plus easy array/hashing coding problems, and be ready to explain your approach conceptually, not just recite syntax. Revise DBMS fundamentals (normalization, constraints), prepare a project you can discuss in depth - a GitHub repo involving data work or API integration reads well - and use STAR for HR answers.

What is EY GDS, and is the interview different from Audit or Tax roles?

EY GDS (Global Delivery Services) is EY’s technology and business-services delivery arm, and it’s what this page’s process describes - aptitude plus a coding round, a project-heavy technical interview, and HR. EY’s core Audit, Tax, and Assurance hiring runs a separate, largely non-coding process centered on aptitude, group discussion, and HR, aimed mainly at commerce/accounting graduates.

Does EY ask coding questions for freshers?

Yes, for GDS/technology roles. Expect one easy coding problem in the OA (usually arrays or hashing) and conceptual coding-adjacent questions in the technical interview - EY GDS interviewers often care more about whether you can explain a concept like hash collision handling than whether you can code it cold on a whiteboard.

What interviewers score

Stage Strong signal Weak signal
Aptitude Timed quant/verbal with calm pacing Untimed practice only
GD / group exercise Structured contribution + listening Dominating without listening
Technical Service-line fit (GDS tech vs Assurance/Tax) + project trade-offs Framework name-drops with no ownership
HR Why EY vs other Big Four + relocation honesty “Brand only” with zero service-line curiosity

Confirm whether your requisition is EY GDS or EY India before you practise. The technical depth and client model differ.

Red flags that kill EY offers

  • “Why EY?” that still works if you swap in Deloitte/KPMG unchanged
  • Confusing GDS delivery work with India member-firm audit careers
  • Refusing every listed hub (Bengaluru, Hyderabad, Kochi, Gurugram, etc.)
  • Dominating GD without inviting quieter voices
  • Integrity gaps (fabricated internship metrics)

How to prepare for EY interviews

  1. Loop map: Online Aptitude Test; Coding round; Technical Interview; HR Interview. Confirm timings from the drive mail.
  2. Technical depth: Drill the Q&A section until answers are spoken, not read. Know every resume project cold.
  3. Experiences: Study round-wise notes on the interview experience page - real prompts beat generic lists.
  4. HR: Three STAR stories + a specific “Why EY?” on the HR page.

Who usually fits and who struggles

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, but a clear campus project with ownership beats a vague “assisted team” bullet.

Harder path: You only practiced untimed puzzles; you dominate GD without listening; your “Why EY?” is “Big Four brand” with zero service-line curiosity. Technical rounds reward concrete project trade-offs more than namedropping frameworks.

A practical EY prep plan

Use this as a default four-week loop before a EY drive. Adjust to your invite timeline.

  1. Week 1: Oa pattern first: sit one untimed paper, then redo it under the real clock. Open the Ernst & Young (EY) previous-year sets on this site and mark which sections ate your time. Write the timing on a sticky note. That number is more useful than a 200-problem LeetCode streak you never timed.
  2. Week 2: Most Ernst & Young (EY) drives fail people on the first timed paper or OA. Do three timed sits this week. After each one, log every miss in a two-column note: topic and why (slow, wrong formula, bad edge case, panic). The next sit should only add problems from that log.
  3. Week 3: Technical interviews at Ernst & Young (EY) usually want a clean project story, one or two CS fundamentals, and (if the process has it) a behavioral or values round. Write STAR stories on paper, not in your head. Practise “Why Ernst & Young (EY)?” with one concrete product, lab, or business line - not a slogan.
  4. Week 4: Star stories + one project walkthrough recorded on your phone. If you still have energy, redo only the questions you failed in week 2.

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.

Compensation notes

Candidate-reported fresher/early-career packages for EY often cite ₹6-10 LPA. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.

Sources

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 EY interview experience page. For OA papers and coding drills, use EY on placementpapers.app. OA quick answers and track-wise questions draw on FACE Prep’s EY aptitude pattern page, GfG’s EY recruitment process page and Glassdoor reviews for EY GDS, assurance and tax roles.