{"id":969,"date":"2026-07-03T03:50:20","date_gmt":"2026-07-03T03:50:20","guid":{"rendered":"https:\/\/lastroundai.com\/blog\/?post_type=iq&#038;p=969"},"modified":"2026-07-19T10:54:09","modified_gmt":"2026-07-19T05:24:09","slug":"capgemini","status":"publish","type":"iq","link":"https:\/\/lastroundai.com\/interview-questions\/capgemini","title":{"rendered":"Capgemini Interview Questions (2026): Online Test, Technical &#038; HR"},"content":{"rendered":"<p><em>Updated June 2026<\/em><\/p>\n<p>Capgemini&#8217;s Exceller program is one of the larger fresher hiring pipelines in India IT right now, with the company targeting around 45,000 hires in 2025 with an explicit focus on what it calls an AI-ready workforce. The process has a genuinely unusual structure: a game-based cognitive test that has no analog in other India IT company recruitment, plus a pseudocode section that tests programming logic without requiring you to write a single line of code. Know exactly what each round tests and you stop studying the wrong things.<\/p>\n<p>This page covers the full 2026 process: the online assessment (pseudocode, game-based aptitude, English, behavioral), the coding round for Senior Analyst track, the technical interview, and HR. Each section has real questions, real answers, and a note on what the panel is actually checking. The salary gap between Analyst and Senior Analyst is Rs. 3+ LPA, so the early rounds matter more than most candidates realize.<\/p>\n<div class=\"iq-stats not-prose\"><div class=\"iq-stat\"><span class=\"iq-stat__value\">4<\/span><span class=\"iq-stat__label\">Stages<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">~90-120 min<\/span><span class=\"iq-stat__label\">Online test<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">25 questions\/25 min<\/span><span class=\"iq-stat__label\">Pseudocode<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">Analyst\/Senior Analyst<\/span><span class=\"iq-stat__label\">Tracks<\/span><\/div><\/div>\n<h2>The Capgemini selection process in 2026<\/h2>\n<p>Capgemini runs all fresher campus hiring through its <strong>Exceller program<\/strong>. The online assessment is the elimination gate. The platform used is Cocubes (partnered with AMCAT for some drives). Candidates apply once and are evaluated for both tracks simultaneously: Analyst (Rs. 4.25 LPA) and Senior Analyst (Rs. 7.5 LPA). The track you land is determined almost entirely by your online test and coding round scores, not by what you write on the application.<\/p>\n<p>There is no separate application for the senior track. The structure of what gets assessed in each round differs meaningfully between the two offers:<\/p>\n<ul>\n<li><strong>Analyst<\/strong>: Online assessment clearance, technical interview, HR. Package approximately Rs. 4.0 LPA base plus a Rs. 25,000 one-time joining incentive. Application development and maintenance projects, typically on-site with clients.<\/li>\n<li><strong>Senior Analyst<\/strong>: Same online assessment, plus a dedicated coding round (2 problems, 45 minutes), then technical interview, then HR. Package Rs. 7.5 LPA. Applied technology and digital transformation projects. Performance on the coding round is the primary separator.<\/li>\n<\/ul>\n<p>Eligibility for both: minimum 60% aggregate in your qualifying degree, no backlogs during the recruitment process, full-time BE\/BTech\/MCA\/MSc programs. Capgemini does not specify a maximum graduation year gap on the Exceller page, but most drives in 2025-2026 cap at 2024 and 2025 batch, with some including 2026 batch candidates.<\/p>\n<div class=\"iq-timeline not-prose\"><br \/>\n<div class=\"iq-step\"><span class=\"iq-step__dot\"><\/span><div class=\"iq-step__body\"><div class=\"iq-step__head\"><span class=\"iq-step__title\">Online assessment<\/span><span class=\"iq-step__meta\">~90-120 min total<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>Four sections: pseudocode MCQ (25 questions, 25 min), English communication (30 questions, 30 min), game-based aptitude (4 games, 27 min), and a behavioral\/PowerSkills test (untimed, roughly 20-25 min). No negative marking on any section. All sections are elimination gates: fail any one and you exit the process, regardless of your scores in the others.<\/p>\n<p><\/div><\/div><\/div><br \/>\n<div class=\"iq-step\"><span class=\"iq-step__dot\"><\/span><div class=\"iq-step__body\"><div class=\"iq-step__head\"><span class=\"iq-step__title\">Coding round (Senior Analyst track)<\/span><span class=\"iq-step__meta\">45 min<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>Two coding problems, medium difficulty. Topics that appear regularly: arrays, strings, hashing, recursion, and greedy approaches. Candidates who clear this round with strong scores are evaluated for the Rs. 7.5 LPA Senior Analyst offer. Candidates who skip or score below the threshold proceed on the Analyst track only.<\/p>\n<p><\/div><\/div><\/div><br \/>\n<div class=\"iq-step\"><span class=\"iq-step__dot\"><\/span><div class=\"iq-step__body\"><div class=\"iq-step__head\"><span class=\"iq-step__title\">Technical interview<\/span><span class=\"iq-step__meta\">20-35 min<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>One interviewer, sometimes two. Opens with your academic project, then moves to OOP, DBMS, data structures, and basic coding. Senior Analyst candidates face applied questions on debugging and design trade-offs. The Superset platform (used for scheduling and video interviews in many 2025-2026 campus drives) may be used for the actual session.<\/p>\n<p><\/div><\/div><\/div><br \/>\n<div class=\"iq-step\"><span class=\"iq-step__dot\"><\/span><div class=\"iq-step__body\"><div class=\"iq-step__head\"><span class=\"iq-step__title\">HR round<\/span><span class=\"iq-step__meta\">10-20 min<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>The final round for most candidates. Covers educational background, career goals, relocation and shift flexibility, the 2-year service bond, and general cultural fit. The interviewer is checking employability signals, not reassessing your technical depth. This round rarely eliminates candidates who cleared the technical round cleanly.<\/p>\n<p><\/div><\/div><\/div><br \/>\n<\/div>\n<h2>Online test: pseudocode section<\/h2>\n<p>The pseudocode section is the round most freshers under-prepare for, because it looks like a coding test but isn&#8217;t. You read a block of pseudocode or C-style code and answer an MCQ about it: what does this output, where is the error, what happens if this input changes, what line should be inserted to make it work. You write nothing. You trace logic.<\/p>\n<p>Twenty-five questions in 25 minutes is tight. One minute per question. The topics Capgemini covers consistently across 2024-2026 drives, reported on GeeksforGeeks and PrepInsta candidate experience threads:<\/p>\n<ul>\n<li>Output tracing (loops, nested conditions, switch-case)<\/li>\n<li>Recursion and function call behavior<\/li>\n<li>Pointer arithmetic and basic memory operations<\/li>\n<li>Data structures (stack, queue, linked list operations described in pseudocode)<\/li>\n<li>OOP concepts (inheritance, constructor calls, method overriding behavior)<\/li>\n<li>Basic sorting and searching logic<\/li>\n<\/ul>\n<div class=\"iq-dsec iq-dsec--easy\"><div class=\"iq-dsec__row\"><h2 class=\"iq-dsec__h\" id=\"easy\"><span class=\"iq-dsec__dot\" aria-hidden=\"true\"><\/span>Easy questions<\/h2><span class=\"iq-dsec__n\">34<\/span><\/div><div class=\"iq-dsec__bar\" aria-hidden=\"true\"><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the output of this pseudocode? SET x = 5 \/ WHILE x &gt; 0 \/ PRINT x \/ SET x = x - 2 \/ END WHILE<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Tracing step by step: x starts at 5, prints 5, then x becomes 3, prints 3, then x becomes 1, prints 1, then x becomes -1 which fails the condition, loop exits. Output: 5, 3, 1 on separate lines.<\/p>\n<p>This style of while-loop trace is the most common pseudocode question type. The trap is miscounting the iterations, especially when the decrement is not by 1. Always trace until you&#8217;ve confirmed the exit condition is actually reached, not assumed.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What does this function return? FUNCTION mystery(n) \/ IF n == 0 RETURN 1 \/ RETURN n * mystery(n-1) \/ END FUNCTION \/ CALL mystery(4)<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>This is factorial. mystery(4) calls mystery(3), which calls mystery(2), which calls mystery(1), which calls mystery(0) returning 1. Unwinding: 1*1=1, 2*1=2, 3*2=6, 4*6=24. Return value: 24.<\/p>\n<p>Recursion traces are the second most common type. The pattern is always: identify the base case, then manually unwind two or three levels. Capgemini pseudocode uses clean recursion without memoization in the online test. Know the call stack mechanics.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">python<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-python\">\n\n# The same logic in Python for clarity:\n\ndef mystery(n):\n\n    if n == 0:\n\n        return 1\n\n    return n * mystery(n \u2013 1)\nprint(mystery(4))  # Output: 24\n<\/code><\/pre><\/div><br \/>\n<\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">In the pseudocode below, what data structure does this describe? INSERT(x): add x to rear \/ DELETE: remove from front \/ PEEK: view front without removing<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Queue. The INSERT operation adds to the rear (enqueue), DELETE removes from the front (dequeue), and PEEK views the front element without removing it. This is FIFO behavior: First In, First Out.<\/p>\n<p>If instead the operations were INSERT\/DELETE\/PEEK all operating on the same end (top), that would be a stack (LIFO). Capgemini often presents one of these as an MCQ with four data structure options: stack, queue, linked list, tree. The answer always comes down to which end each operation uses.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">GeoStudio Challenge: What cognitive skill does this game test, and what is the task?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Game-Based<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Visual reasoning and pattern recognition. You&#8217;re shown a grid (4&#215;4 or 5&#215;5) with geometric shapes, and one cell is empty. Each shape appears exactly once per row and column, like a geometric Sudoku. Your task is to identify which shape belongs in the missing cell.<\/p>\n<p>The skill being scored is deductive logical thinking: eliminating possibilities systematically by process of exclusion across both the row and the column. Candidates who try to guess visually rather than eliminate systematically run out of time on harder grids. Work rows and columns together, not one at a time.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Digit Challenge: What is the task?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Game-Based<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>You are given a set of available digits and asked to arrange them to form valid mathematical equations. The constraint is that you can only use each digit from the given set, within the specific positions shown. The skill tested is numerical reasoning and constraint satisfaction under time limits.<\/p>\n<p>This game is less about arithmetic and more about combinatorial thinking: which digit combinations can satisfy the equation structure given the constraints? Eliminate clearly impossible combinations first to narrow the search space.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Fill in the blank: &#039;The project was completed _____ the deadline, thanks to the team&#039;s efforts.&#039; (on time \/ in time \/ by time \/ at time)<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">English<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The correct answer is &#8220;on time.&#8221; &#8220;On time&#8221; means according to schedule, exactly at the expected moment. &#8220;In time&#8221; means before a deadline but with some margin, not specifically at the scheduled moment. &#8220;By time&#8221; is not standard usage. &#8220;At time&#8221; is incorrect grammatically.<\/p>\n<p>The distinction between &#8220;on time&#8221; and &#8220;in time&#8221; is a consistently tested distinction in Capgemini&#8217;s English section. Other commonly tested preposition pairs: &#8220;at the end&#8221; vs &#8220;in the end,&#8221; &#8220;agree to&#8221; vs &#8220;agree with,&#8221; &#8220;different from&#8221; vs &#8220;different than.&#8221;<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Choose the closest synonym: &#039;The manager&#039;s decision was met with considerable apprehension from the team.&#039; (Excitement \/ Anxiety \/ Indifference \/ Approval)<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">English<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Anxiety. Apprehension means uneasiness or worry about something that hasn&#8217;t happened yet. The team wasn&#8217;t excited, indifferent, or approving of the decision, they were uneasy about it.<\/p>\n<p>Capgemini&#8217;s synonym and antonym questions tend to draw from workplace and news-register vocabulary rather than obscure literary words, terms like apprehension, mandate, discrepancy, and conducive show up more often than GRE-tier vocabulary. A word list built from business English is a better use of prep time than a general vocabulary list.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Given an array of integers, print each distinct value with its frequency, in the order the value first appeared.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Coding<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>A plain HashMap gives you frequency counts but not the original order, since HashMap iteration order isn&#8217;t guaranteed. Use a LinkedHashMap instead: it preserves insertion order, so the first time you see a value, it gets inserted, and every later occurrence just increments the count in place.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\nimport java.util.LinkedHashMap;\n\nimport java.util.Map;\npublic class FrequencyOrder {\n\n    public static void printFrequency(int[] arr) {\n\n        Map&lt;Integer, Integer&gt; counts = new LinkedHashMap&lt;&gt;();\n        for (int num : arr) {\n\n            counts.put(num, counts.getOrDefault(num, 0) + 1);\n\n        }\n        for (Map.Entry&lt;Integer, Integer&gt; entry : counts.entrySet()) {\n\n            System.out.println(entry.getKey() + \u201d -&gt; \u201d + entry.getValue());\n\n        }\n\n    }\n    public static void main(String[] args) {\n\n        printFrequency(new int[]{4, 2, 4, 5, 2, 2});\n\n        \/\/ Output:\n\n        \/\/ 4 -&gt; 2\n\n        \/\/ 2 -&gt; 3\n\n        \/\/ 5 -&gt; 1\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>This is a hashing problem more than an array problem once you see it. The trap for candidates who reach for a plain HashMap: the output prints in whatever bucket order the map happens to use, which fails the &#8220;first appearance&#8221; requirement even though the counts themselves are correct.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between C and C++?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>C is a procedural language. C++ adds object-oriented programming on top of C, including classes, inheritance, polymorphism, and the Standard Template Library. C does not support function overloading or operator overloading; C++ does. Memory management in C is purely manual (malloc and free); C++ adds constructors, destructors, and the option for RAII-style resource management.<\/p>\n<p>This is the most common opening technical question Capgemini interviewers use for freshers who list C or C++ on their resume. It&#8217;s calibration: a blank or vague answer signals the interview needs to slow down significantly. A clean two-sentence answer with concrete differences signals you know your fundamentals and the interviewer can move faster.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Write a program to print the Fibonacci series up to n terms.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The Fibonacci series starts 0, 1, 1, 2, 3, 5, 8&#8230; Each term is the sum of the two before it. For n terms, you store the last two values and compute forward.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">python<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-python\">\n\ndef fibonacci(n):\n\n    a, b = 0, 1\n\n    for _ in range(n):\n\n        print(a, end=\u201d \u201c)\n\n        a, b = b, a + b\nfibonacci(8)\n\n# Output: 0 1 1 2 3 5 8 13\n<\/code><\/pre><\/div><\/p>\n<p>Capgemini interviewers sometimes follow this with &#8220;can you do it recursively?&#8221; The recursive version is less efficient (exponential time), so be ready to note that the iterative approach above runs in O(n) time and O(1) space. The interviewer may specifically ask which is faster and why.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Swap two variables without using a third variable.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Three approaches: arithmetic swap using addition and subtraction, bitwise XOR swap, or Python&#8217;s tuple swap. The arithmetic method is the most commonly expected answer in Capgemini interviews.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\npublic class SwapWithoutTemp {\n\n    public static void main(String[] args) {\n\n        int a = 10, b = 20;\n        \/\/ Arithmetic swap\n\n        a = a + b;  \/\/ a = 30\n\n        b = a \u2013 b;  \/\/ b = 10 (original a)\n\n        a = a \u2013 b;  \/\/ a = 20 (original b)\n        System.out.println(\u201ca = \u201d + a + \u201c, b = \u201d + b);\n\n        \/\/ Output: a = 20, b = 10\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>Know the limitation: arithmetic swap can cause integer overflow for very large numbers. The XOR method avoids this. Mentioning the overflow edge case without being prompted signals engineering thinking over memorized answers.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is a linked list? How does it differ from an array?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>A linked list is a linear data structure where each element (node) stores data and a reference (pointer) to the next node. Unlike arrays, nodes are not stored contiguously in memory.<\/p>\n<ul>\n<li>Arrays have fixed size set at declaration; linked lists grow and shrink dynamically at runtime.<\/li>\n<li>Array element access by index is O(1); linked list access requires traversal from the head, so worst case is O(n).<\/li>\n<li>Inserting or deleting at the beginning of a linked list is O(1); the same operation in an array requires shifting all subsequent elements, O(n).<\/li>\n<li>Arrays have no per-element memory overhead beyond the data; each linked list node carries an extra pointer field.<\/li>\n<\/ul>\n<p>Capgemini&#8217;s technical interviewers specifically like asking &#8220;when would you prefer a linked list over an array?&#8221; The honest answer: when you have frequent insertions and deletions at arbitrary positions and don&#8217;t need random access by index.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is exception handling? Write a basic try-catch example.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Exception handling is the mechanism a language uses to deal with runtime errors, like dividing by zero or accessing a null reference, without crashing the entire program. Code that might fail goes inside a try block. If it throws an exception, control jumps to the matching catch block instead of terminating the program. A finally block, if present, runs regardless of whether an exception occurred, commonly used to close files or database connections.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\npublic class DivisionExample {\n\n    public static void main(String[] args) {\n\n        int a = 10, b = 0;\n        try {\n\n            int result = a \/ b;\n\n            System.out.println(\u201cResult: \u201d + result);\n\n        } catch (ArithmeticException e) {\n\n            System.out.println(\u201cCannot divide by zero: \u201d + e.getMessage());\n\n        } finally {\n\n            System.out.println(\u201cDivision attempt finished.\u201d);\n\n        }\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>Capgemini interviewers sometimes fold this into the Fibonacci or swap warm-up by asking &#8220;what happens if n is negative?&#8221; or &#8220;what if the input isn&#8217;t a number?&#8221; The candidates who answer well aren&#8217;t the ones who memorized try-catch syntax, they&#8217;re the ones who instinctively think about what breaks the happy path.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What are the four pillars of OOP? Give a real example for each.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Encapsulation: bundling data and the methods that operate on it into one unit (class), and restricting access to internal state. Example: a BankAccount class that exposes deposit() and withdraw() methods but keeps the balance variable private.<\/p>\n<p>Abstraction: hiding implementation details and exposing only what the user needs. Example: you call car.start() without knowing how the combustion engine initiates the fuel-air cycle.<\/p>\n<p>Inheritance: a child class inherits properties and behavior from a parent class. Example: a Dog class inherits from Animal and adds its own bark() method.<\/p>\n<p>Polymorphism: the same method name behaves differently based on context. Example: a shape.area() method returns the right formula whether the shape is a Circle, Rectangle, or Triangle.<\/p>\n<p>This question comes up in almost every Capgemini technical interview for freshers. Know all four, with one concrete example each, not just the definitions. The interviewer will probe whichever example you give.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Is Java 100% object-oriented? Why or why not?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>No. Java supports eight primitive data types (int, byte, short, long, float, double, char, boolean) that are not objects. They don&#8217;t inherit from Object, they can&#8217;t call methods on them, and they&#8217;re stored directly on the stack rather than as heap-allocated objects with a reference.<\/p>\n<p>This is a Capgemini favorite. The full honest answer: Java is largely object-oriented, but the primitive types are a deliberate design compromise for performance. Wrapper classes (Integer, Double, Boolean, etc.) exist precisely to treat primitives as objects when needed, for example when storing them in a List or using generics.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What are database constraints? Name them.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Constraints are rules enforced by the database to maintain data integrity.<\/p>\n<ul>\n<li>NOT NULL: a column cannot hold null values.<\/li>\n<li>UNIQUE: all values in a column must be distinct.<\/li>\n<li>PRIMARY KEY: uniquely identifies each row; implicitly NOT NULL and UNIQUE.<\/li>\n<li>FOREIGN KEY: links a column in one table to the primary key of another, enforcing referential integrity.<\/li>\n<li>CHECK: values must satisfy a specified condition, for example age >= 18.<\/li>\n<li>DEFAULT: assigns a default value when no value is provided at insert time.<\/li>\n<\/ul>\n<p>Capgemini interviewers typically ask this right after asking you to define DBMS. It&#8217;s a clean follow-up, so prepare them as a pair. The PRIMARY KEY vs UNIQUE distinction is worth knowing precisely: a table can have multiple UNIQUE constraints but only one PRIMARY KEY.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between DELETE, TRUNCATE, and DROP?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>DELETE removes specific rows and respects a WHERE clause. It is a DML operation, logged row by row, and can be rolled back within a transaction. TRUNCATE removes all rows from a table faster than DELETE (it deallocates data pages), cannot use WHERE, resets auto-increment counters, and is a DDL operation that cannot be rolled back in most databases. DROP removes the entire table structure along with all its data and indexes, permanently.<\/p>\n<p>The one detail Capgemini interviewers specifically probe: TRUNCATE resets the identity\/auto-increment column. If you insert after a TRUNCATE, the first row gets id = 1 again. DELETE does not do this. That distinction separates a prepared answer from a vague one.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What are the different types of JOIN in SQL?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>INNER JOIN returns only rows with matching values in both tables. LEFT JOIN (or LEFT OUTER JOIN) returns every row from the left table, with NULLs filled in where there&#8217;s no match on the right. RIGHT JOIN does the same from the right table&#8217;s side. FULL OUTER JOIN returns all rows from both tables, matched where possible and NULL-filled where not. A CROSS JOIN returns the Cartesian product of both tables, every row from one paired with every row from the other, with no matching condition at all.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">sql<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-sql\">\n\n\u2014 Employees who currently have no manager assigned\n\nSELECT e.name, m.name AS manager_name\n\nFROM employees e\n\nLEFT JOIN employees m ON e.manager_id = m.id\n\nWHERE m.id IS NULL;\n<\/code><\/pre><\/div><\/p>\n<p>Capgemini interviewers like the &#8220;employees with no manager&#8221; style example above because it forces you to explain why LEFT JOIN, and not INNER JOIN, is the right choice: INNER JOIN would silently drop exactly the rows you&#8217;re trying to find.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between a stack and a queue? Give a real-world example of each.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Stack is LIFO: Last In, First Out. The most recently added item is the first removed. Operations are push (add) and pop (remove), both at the same end (top). Real-world example: a browser&#8217;s back button. Each page you visit gets pushed onto a stack; hitting back pops the most recent one.<\/p>\n<p>Queue is FIFO: First In, First Out. The first item added is the first removed. Operations are enqueue (add to rear) and dequeue (remove from front). Real-world example: a print job queue. The document you sent first gets printed first.<\/p>\n<p>A compound question Capgemini sometimes asks: &#8220;how would you implement a queue using two stacks?&#8221; It&#8217;s worth knowing the approach: push all elements onto stack 1; when you need to dequeue, transfer all elements to stack 2 (reversing order), then pop from stack 2.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the time complexity of binary search? When can you use it?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>O(log n). Binary search requires the input array to be sorted. It works by repeatedly dividing the search interval in half: compare the target with the middle element, then search only the left half or right half based on the comparison. Each step eliminates half the remaining candidates.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">c<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-c\">\n\nint binarySearch(int arr[], int n, int target) {\n\n    int left = 0, right = n \u2013 1;\n    while (left &lt;= right) {\n\n        int mid = left + (right \u2013 left) \/ 2;  \/\/ avoids overflow vs (left+right)\/2\n        if (arr[mid] == target) return mid;\n\n        else if (arr[mid] &lt; target) left = mid + 1;\n\n        else right = mid \u2013 1;\n\n    }\n    return -1;  \/\/ not found\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>Note the mid calculation: left + (right &#8211; left) \/ 2 instead of (left + right) \/ 2. The naive version can overflow for large arrays in C\/Java. Capgemini interviewers occasionally ask why you wrote it that way if you use the safer form. Having the reason ready signals you&#8217;ve actually thought about edge cases.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What technology did you use in your project? Why that choice?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Don&#8217;t say &#8220;my professor suggested it&#8221; or &#8220;it was the one I knew.&#8221; Even if either is true, reframe it as a reasoned choice. Every technology has genuine advantages. If you used Python: easier to prototype data processing pipelines, extensive library support for the problem domain. If you used MySQL: ACID compliance and mature tooling for relational data. If you used React: component reusability and strong ecosystem.<\/p>\n<p>The real answer the interviewer wants: you can justify a technical decision with trade-offs, not just &#8220;it&#8217;s popular.&#8221; A one-sentence why for each major technology you mention is enough. You don&#8217;t need a 5-year roadmap, just evidence that you didn&#8217;t use tools randomly.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Tell me about yourself.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Three things in 60-90 seconds: your academic background (one sentence), one project or technical achievement that ties to the role, and why you want to start your career at Capgemini specifically. The GeeksforGeeks on-campus experience report noted that Capgemini HR interviewers asked about &#8220;skills, hobbies, educational history, and ambitions&#8221; in a single introductory question. Keep the personal part brief and the professional part substantive.<\/p>\n<p>The version that doesn&#8217;t work: a linear recitation of your resume from 10th board results onward. HR has the resume. Tell them something the resume doesn&#8217;t say as well, like the challenge you solved in the project or what you&#8217;re excited to learn.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Why Capgemini?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Capgemini operates in 50+ countries and had revenue of approximately 22.1 billion euros in 2024 (per Capgemini&#8217;s official annual report). It&#8217;s one of the few India IT companies running large-scale AI and cloud transformation engagements alongside traditional application maintenance. For freshers, that range of project types is a genuine advantage early in a career.<\/p>\n<p>Avoid: &#8220;because Capgemini is a great company.&#8221; That answers nothing. Pick one real thing: the Exceller program&#8217;s dual-track structure (Analyst to Senior Analyst is a concrete progression), Capgemini&#8217;s work in specific industries your degree aligns with, or a project the company has done publicly that genuinely interests you. One specific, connected reason lands better than three generic ones.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What are your strengths and weaknesses?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>For strengths: name one, give a specific instance where it showed up. &#8220;I&#8217;m a quick learner&#8221; is generic; &#8220;I picked up SQL in two weeks to complete the database module of my final year project&#8221; is specific and verifiable.<\/p>\n<p>For weaknesses: pick something developmental, not a disqualifying trait, and name the step you&#8217;re already taking to address it. &#8220;I sometimes spend too long on code quality when shipping speed matters more. I&#8217;ve been timeboxing my review passes to 20 minutes before declaring something done, which has helped.&#8221; The specificity makes it credible. The &#8220;I work too hard&#8221; cliche reads as evasion and most interviewers will push you for a real answer anyway.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Are you willing to relocate and work in rotational shifts?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Be honest. Capgemini serves global clients and offshore teams regularly work evenings or nights to overlap with European and US business hours. The Exceller program places candidates across India, and your posting location is assigned, not chosen.<\/p>\n<p>If you can genuinely commit, say so clearly. If you have a constraint (a medical situation, a family dependency), state it calmly and explain the flexibility you do have. A calm &#8220;I can manage rotational shifts with reasonable advance notice&#8221; is more trusted than a blanket yes that you don&#8217;t mean. HR wants accurate information, not a yes at any cost.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Are you ready to sign a 2-year service bond with Capgemini?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Capgemini requires freshers hired through the Exceller program to sign a 2-year service bond. Leaving before the bond period ends results in a financial penalty specified in the agreement. The HR round is where they confirm your acceptance of this term.<\/p>\n<p>If you&#8217;ve accepted the offer, confirm clearly. PrepInsta&#8217;s Exceller HR guide from 2025 notes the expected answer is a direct &#8220;Yes, I am ready to sign the 2-year bond.&#8221; The HR round is not the place to negotiate bond length or push back on the terms. Questions about the bond terms are better raised with the recruiter before offer acceptance.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Where do you see yourself in 5 years?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Name a direction, not just a title. &#8220;I want to be a manager&#8221; with no pathway doesn&#8217;t land. &#8220;I want to build depth in cloud infrastructure over the next two years on client projects, then move toward leading a small technical workstream&#8221; is the kind of answer that reads as thoughtful.<\/p>\n<p>Connect the path to what Capgemini actually offers. The Analyst-to-Senior-Analyst track is a real, defined progression within the Exceller program. Referencing it shows you&#8217;ve done basic homework on what the role actually looks like, which is more than most candidates at this stage do.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Do you have any questions for us?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">HR<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Always have one question. &#8220;No questions&#8221; reads as disengagement. Good options at the fresher HR stage: what does the onboarding process look like for Exceller candidates in the first 90 days, which technology domains are most active in the projects I might join, what does the learning and certification support look like at Capgemini India.<\/p>\n<p>Avoid questions that could be answered by reading the Capgemini website for five minutes (company revenue, number of employees, what does Capgemini do). The question signals how much you&#8217;ve prepared and how curious you are, which is itself an assessment data point even in the final round.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between the Capgemini Analyst and Senior Analyst track in 2026?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Both tracks recruit through the same Exceller program. Analyst (approximately Rs. 4.0 LPA base plus Rs. 25,000 one-time incentive) is assigned to candidates who clear the online assessment and technical interview without the dedicated coding round. Senior Analyst (Rs. 7.5 LPA) goes to candidates who additionally pass the 45-minute coding round with two medium-difficulty problems. The coding round performance is the primary separator. You cannot choose your track at application; the process routes you based on scores.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Is there negative marking in the Capgemini online test?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>No. No negative marking on any section of the Capgemini online assessment: pseudocode, English, game-based aptitude, and behavioral are all mark-only. Attempt every question. A blank is guaranteed to score zero; a guess on a 4-option MCQ has a 25% expected value. Given the 1-question-per-minute pace on the pseudocode section specifically, skipping an uncertain question and returning to it later (if the platform allows) is better than leaving it blank.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Can I skip the game-based aptitude test and still clear the online assessment?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>No. The game-based aptitude section is an elimination gate in Capgemini&#8217;s 2025-2026 assessment. Failing to clear any one of the four sections (pseudocode, English, game-based, behavioral) exits you from the process regardless of your scores in the others. The games are not optional and there is no minimum score override from strong performance in other sections.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the eligibility criteria for Capgemini Exceller in 2026?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Minimum 60% aggregate in your qualifying degree (BE\/BTech\/MCA\/MSc or equivalent). No active backlogs during the recruitment process. Full-time programs only; correspondence and part-time programs are not eligible. Most 2025-2026 drives target 2024 and 2025 graduation batches, with some including 2026 batch students. The exact batch cutoff varies by drive; check the specific job description on Superset or Capgemini&#8217;s official career page for the drive you&#8217;re applying to.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">How long does the Capgemini Exceller selection process take from test to offer?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Typically 2-3 weeks from the online assessment date to offer letter, based on candidate reports from the 2025 cycle. The process can compress to 1 week for large campus drives where interviews happen in batches. Communication is maintained through Superset or email. The gap between technical interview and HR round clearance to final offer is where most of the waiting happens, not between the interview rounds themselves.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Does Capgemini ask coding questions in the technical interview for Analyst track?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">FAQ<\/span><span class=\"iq-badge iq-badge--easy\">Easy<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Sometimes, but it&#8217;s not guaranteed for the Analyst track. The technical interview for Analyst candidates focuses primarily on OOP concepts, DBMS, data structure basics, and project discussion. A small coding question (Fibonacci, string reversal, swap without temp) may appear on paper or screen, but it is not a competitive coding problem of the kind in the Senior Analyst coding round. Senior Analyst candidates face more applied coding and debugging scenarios in the technical interview because they&#8217;ve already passed the dedicated coding round.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-dsec iq-dsec--medium\"><div class=\"iq-dsec__row\"><h2 class=\"iq-dsec__h\" id=\"medium\"><span class=\"iq-dsec__dot\" aria-hidden=\"true\"><\/span>Medium questions<\/h2><span class=\"iq-dsec__n\">13<\/span><\/div><div class=\"iq-dsec__bar\" aria-hidden=\"true\"><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is wrong with this pseudocode? FUNCTION swap(a, b) \/ SET temp = a \/ SET a = b \/ SET b = temp \/ END FUNCTION<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The function body is logically correct for swapping two values. The problem: it operates on local copies of a and b, not the originals. In a call-by-value language (like C), calling swap(x, y) will not change x or y in the calling scope. To actually swap variables through a function in C, you pass pointers: swap(&#038;x, &#038;y) and dereference inside the function.<\/p>\n<p>Capgemini tests this category of &#8220;what&#8217;s wrong&#8221; question to see if you understand scope and pass-by-value vs pass-by-reference. A correct-looking but semantically broken function is a common distractor.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the output of this pseudocode? SET arr = [5, 2, 8, 1] \/ SET i = 0 \/ WHILE i &lt; LENGTH(arr) - 1 \/ IF arr[i] &gt; arr[i+1] \/ SWAP arr[i], arr[i+1] \/ SET i = i + 1 \/ END WHILE<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Trace it index by index. i=0: arr[0]=5 and arr[1]=2, 5 is greater so swap, arr becomes [2, 5, 8, 1], i becomes 1. i=1: arr[1]=5 and arr[2]=8, 5 is not greater than 8, no swap, i becomes 2. i=2: arr[2]=8 and arr[3]=1, 8 is greater so swap, arr becomes [2, 5, 1, 8], i becomes 3. The loop condition i < 3 is now false, so it exits. Final array: [2, 5, 1, 8].<\/p>\n<p>This is a single left-to-right comparison pass, the exact building block of bubble sort, but it only runs once. A common trap: candidates assume one pass fully sorts the array and answer [1, 2, 5, 8]. It doesn&#8217;t. Read the loop bounds carefully before assuming full sort behavior.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Motion Challenge: What is the task and what makes it difficult?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Game-Based<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>You see a grid with a red ball, a hole (destination), movable plastic blocks, and immovable rocks. Your task is to move the red ball into the hole in the minimum number of steps. You can push plastic blocks but cannot move rocks.<\/p>\n<p>What trips candidates up: they push a movable block into a position that blocks the only viable path to the hole, which requires backtracking. The game rewards spatial planning before moving. Spend the first 20-30 seconds of each level mapping the constraints before touching the controls. Speed alone doesn&#8217;t win here; efficiency of path does.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Grid Challenge: What does the dual-task structure look like?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Game-Based<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Two things happen simultaneously: you verify whether two grids are mirror images of each other (symmetry check), and you memorize the coordinates of highlighted cells for a recall question that follows. The grid resets between questions, and the coordinate recall appears at the end of the grid sequence.<\/p>\n<p>The specific challenge is attention splitting. Most candidates focus on the symmetry check and blank on the coordinate recall, or vice versa. The tested skill is multitasking under time pressure. Practice holding two streams of information in working memory simultaneously, not just one.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Switch Challenge: What is the task and what skill does it test?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Game-Based<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>A set of geometric shapes passes through one or more &#8220;switches,&#8221; each of which applies a hidden transformation, a rotation, a color change, or a repositioning rule. You&#8217;re shown a small number of before-and-after examples for each switch, and your job is to infer the rule each switch applies, then predict what a new shape looks like after running through the same sequence of switches.<\/p>\n<p>The skill being scored is rule inference from limited examples, then forward application of that rule under time pressure. Candidates who try to hold the transformation rule in their head while also evaluating the next switch tend to lose accuracy. Write down what each switch does the moment you work it out, rather than re-deriving it every time a new shape passes through.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Compress a string by counting consecutive repeated characters. Example: &#039;aabbbcc&#039; becomes &#039;a2b3c2&#039;.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Coding<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Walk through the string once, tracking the current character and a running count. When the next character differs from the current one, append the character and its count to the result, then reset the counter for the new character. Append the final group after the loop ends.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\npublic class CompressString {\n\n    public static String compress(String s) {\n\n        StringBuilder result = new StringBuilder();\n\n        int count = 1;\n        for (int i = 1; i &lt;= s.length(); i++) {\n\n            if (i &lt; s.length() &amp;&amp; s.charAt(i) == s.charAt(i \u2013 1)) {\n\n                count++;\n\n            } else {\n\n                result.append(s.charAt(i \u2013 1)).append(count);\n\n                count = 1;\n\n            }\n\n        }\n\n        return result.toString();\n\n    }\n    public static void main(String[] args) {\n\n        System.out.println(compress(\u201caabbbcc\u201d));  \/\/ Output: a2b3c2\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>Candidates from the September 2025 batch drives reported a version of this exact problem, per PrepInsta&#8217;s coding question bank. The edge case interviewers ask about afterward: what if a character appears only once? The code above handles it correctly since count starts at 1 and gets appended even for single occurrences.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between method overloading and method overriding?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Overloading: same method name, different parameter types or counts, within the same class. Resolved at compile time. Example: print(int x) and print(String s) in the same class.<\/p>\n<p>Overriding: a child class provides its own implementation of a method defined in the parent class. Same name, same parameter signature. Resolved at runtime through dynamic dispatch. Example: Animal has speak(), Dog overrides speak() to return &#8220;Bark&#8221;.<\/p>\n<p>The way Capgemini interviewers test this: they ask you to define both, then write a quick Java example of overriding on paper. Know the @Override annotation and why it matters (it tells the compiler you intend to override, so if the signatures don&#8217;t match, you get a compile error rather than accidentally creating a new method).<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is the difference between abstract class and interface in Java?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>An abstract class can have both concrete (implemented) methods and abstract (unimplemented) methods. It can have instance variables, constructors, and access modifiers on methods. A class can extend only one abstract class.<\/p>\n<p>An interface (pre-Java 8) could only have abstract methods and public static final constants. From Java 8, interfaces can have default and static methods with bodies. A class can implement multiple interfaces.<\/p>\n<p>The answer Capgemini interviewers actually want: use abstract class when you have shared state or behavior to inherit. Use interface to define a contract that unrelated classes can implement. Example: Comparable is an interface because both String and Integer need to be sortable, but they share no common ancestor that has comparison logic.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Can a class in Java inherit from multiple classes directly? How do you get similar behavior?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>No. Java allows a class to extend only one parent class. The reason is the diamond problem: if class C inherited from both A and B, and both A and B defined a method with the same signature, the compiler would have no unambiguous way to decide which version C should use.<\/p>\n<p>Java gets around this with interfaces. A class can implement any number of interfaces, and since Java 8, interfaces can include default methods with actual bodies, not just method signatures. If two interfaces a class implements both provide a default for the same method, Java forces the class to override it explicitly rather than guessing, which is exactly the ambiguity that made multiple class inheritance risky in the first place.<\/p>\n<p>Capgemini interviewers who&#8217;ve already asked about abstract classes versus interfaces often follow this up specifically, because it checks whether you understand the design reasoning, not just the &#8220;Java doesn&#8217;t support multiple inheritance&#8221; rule you memorized.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Write a SQL query to find the second highest salary from an employee table.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The cleanest approach for most SQL databases: use a subquery that finds the maximum salary among salaries that are less than the overall maximum.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">sql<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-sql\">\n\n\u2014 Method 1: nested MAX subquery\n\nSELECT MAX(salary) AS second_highest\n\nFROM employees\n\nWHERE salary &lt; (SELECT MAX(salary) FROM employees);\n\u2014 Method 2: LIMIT with DISTINCT (MySQL\/PostgreSQL)\n\nSELECT DISTINCT salary\n\nFROM employees\n\nORDER BY salary DESC\n\nLIMIT 1 OFFSET 1;\n<\/code><\/pre><\/div><\/p>\n<p>Know both. Method 1 works across most SQL databases. Method 2 uses LIMIT\/OFFSET which is more readable but dialect-specific. Capgemini interviewers sometimes ask you to generalize: &#8220;what if I want the Nth highest salary?&#8221; The window function approach with DENSE_RANK() handles that cleanly, but the interviewer typically won&#8217;t expect it at fresher level unless you bring it up.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What is normalization? Why do we do it?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Normalization is organizing database tables to reduce data redundancy and avoid anomalies (insert, update, delete). You split data into smaller, related tables and define clear dependencies.<\/p>\n<ul>\n<li>1NF: each column holds atomic values, no repeating groups.<\/li>\n<li>2NF: 1NF plus every non-key column depends on the entire primary key, not just part of it (eliminates partial dependencies).<\/li>\n<li>3NF: 2NF plus no non-key column depends on another non-key column (eliminates transitive dependencies).<\/li>\n<\/ul>\n<p>Why we do it: a table storing student name, course name, and course instructor in a single row has a problem when the instructor changes. You&#8217;d have to update every row for that course, and if you delete all students from a course, you lose the instructor information entirely. Normalization prevents these anomalies by separating concerns into purpose-built tables.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">What are the ACID properties of a database transaction?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Atomicity: a transaction either completes fully or not at all, there&#8217;s no partial state left behind. Consistency: a transaction takes the database from one valid state to another, without violating constraints. Isolation: concurrent transactions don&#8217;t interfere with each other&#8217;s intermediate state. Durability: once a transaction commits, the change survives even a crash immediately afterward.<\/p>\n<p>The standard example: transferring money between two bank accounts. Debiting one account and crediting the other has to happen as a single atomic unit. If the debit succeeds but a power failure hits before the credit runs, atomicity is what guarantees the whole transaction rolls back instead of leaving money debited from nowhere.<\/p>\n<p>Capgemini interviewers ask this right after normalization fairly often, since both questions are really testing the same underlying concern: data integrity, just at different layers of the database.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Walk me through your final year project.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Technical<\/span><span class=\"iq-badge iq-badge--medium\">Medium<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The Capgemini technical interviewer wants: what problem did you solve, what specific technologies you chose and why, what you personally built (not what the team built), and one challenge you ran into. The on-campus experience report from GeeksforGeeks noted interviewers valued &#8220;confidence and making a clear impact that you are genuinely interested in the job&#8221; over technical depth.<\/p>\n<p>The risky pattern: candidates who say &#8220;we built a web application using React and Node&#8221; and then can&#8217;t answer &#8220;what specifically did you contribute?&#8221; The interviewer will ask. Prepare a 90-second version that uses &#8220;I&#8221; instead of &#8220;we&#8221; for the parts you owned. If you owned the database design, say so. If you wrote the authentication flow, say so. Shared ownership without specifics reads as no ownership.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-dsec iq-dsec--hard\"><div class=\"iq-dsec__row\"><h2 class=\"iq-dsec__h\" id=\"hard\"><span class=\"iq-dsec__dot\" aria-hidden=\"true\"><\/span>Hard questions<\/h2><span class=\"iq-dsec__n\">5<\/span><\/div><div class=\"iq-dsec__bar\" aria-hidden=\"true\"><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">A string contains only the substrings &#039;AB&#039; and &#039;CD&#039; mixed with other characters. Repeatedly remove every occurrence of &#039;AB&#039; and &#039;CD&#039; until none remain. What is the length of the final string?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Coding<\/span><span class=\"iq-badge iq-badge--hard\">Hard<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The naive approach, scanning left to right and deleting matches repeatedly, is slow and messy to get right because removing one match can create a new match right next to it (for example, &#8220;AABCD&#8221; removes the inner &#8220;AB&#8221; first, and the leftover characters may form another pair). A stack handles this cleanly: push characters onto the stack one at a time; before pushing, check whether the top of the stack plus the incoming character forms &#8220;AB&#8221; or &#8220;CD&#8221;. If it does, pop instead of pushing, which removes both characters in one step. If it doesn&#8217;t, push normally.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\nimport java.util.Stack;\npublic class RemovePairs {\n\n    public static int finalLength(String s) {\n\n        Stack&lt;Character&gt; stack = new Stack&lt;&gt;();\n        for (char c : s.toCharArray()) {\n\n            if (!stack.isEmpty() &amp;&amp;\n\n                ((stack.peek() == \u2018A\u2019 &amp;&amp; c == \u2018B\u2019) ||\n\n                 (stack.peek() == \u2018C\u2019 &amp;&amp; c == \u2018D\u2019))) {\n\n                stack.pop();\n\n            } else {\n\n                stack.push(c);\n\n            }\n\n        }\n\n        return stack.size();\n\n    }\n    public static void main(String[] args) {\n\n        System.out.println(finalLength(\u201cAABCD\u201d));  \/\/ Output: 1\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>This is a greedy, stack-based removal, one of the &#8220;greedy approaches&#8221; topics named in Capgemini&#8217;s own coding round description. The reasoning worth saying out loud in the interview: greedy works here because removing the earliest possible match never blocks a later removal, so there&#8217;s no need to consider alternative orderings.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">How do you detect and prevent a deadlock in a multi-threaded Java application?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Concurrency<\/span><span class=\"iq-badge iq-badge--hard\">Hard<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>A deadlock happens when thread A holds lock 1 and waits for lock 2, while thread B holds lock 2 and waits for lock 1. Neither ever releases what it&#8217;s holding, so both threads sit blocked forever. In production you usually see this as a sudden pile-up of requests with high CPU idle time, not high CPU usage, which throws people off because they expect a hang to look like a busy loop.<\/p>\n<p>To confirm it, take a thread dump with jstack (or kill -3 on the process) and look for the &#8220;Found one Java-level deadlock&#8221; block, which lists exactly which threads are waiting on which monitors. Programmatically, ThreadMXBean.findDeadlockedThreads() does the same check at runtime so you can log or alert on it instead of waiting for someone to notice the app is stuck.<\/p>\n<p>Prevention comes down to a few habits: always acquire locks in the same global order across the codebase so you can never have the reverse-order scenario above, prefer ReentrantLock.tryLock(timeout) over synchronized so a thread can back off and retry instead of waiting indefinitely, and reach for higher-level concurrency classes (ConcurrentHashMap, BlockingQueue, ExecutorService) that don&#8217;t ask you to hold multiple raw locks at once. Deadlocks aren&#8217;t only a JVM problem either, two database transactions can deadlock on row locks taken in different orders, and the database will usually detect it and kill one transaction with a deadlock exception rather than hang forever.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Why can adding an index to a table make a query run slower instead of faster?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">SQL Indexing<\/span><span class=\"iq-badge iq-badge--hard\">Hard<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>An index only helps when the optimizer expects to touch a small slice of the table. Most relational databases build indexes as B-trees, so a lookup is O(log n) to find matching row pointers, but each match still needs a separate read back to the actual table row unless the index is covering. If a query matches a large percentage of rows, say more than roughly 15-20% depending on the engine, the optimizer will often ignore the index and do a full table scan anyway, because sequential I\/O beats thousands of random-access row lookups. This is why indexing a low-cardinality column like a boolean &#8220;is_active&#8221; flag rarely helps and sometimes gets ignored entirely.<\/p>\n<p>Indexes also aren&#8217;t free on the write side. Every insert, update, or delete has to update every index on that table, so a table with six indexes pays that cost six times per write. On high-throughput write tables this can matter more than the read speedup, and it&#8217;s a common mistake to index every column that shows up in a WHERE clause without checking the write pattern first.<\/p>\n<p>Other traps: a composite index on (a, b, c) generally can&#8217;t be used efficiently for a query that filters only on b or c without a, so column order has to match the actual query patterns. And wrapping an indexed column in a function, like WHERE YEAR(created_at) = 2026, usually stops the optimizer from using the index at all, because it can no longer do a simple range seek on the raw column values. The fix there is to rewrite the predicate as a range, WHERE created_at >= &#8216;2026-01-01&#8217; AND created_at < '2027-01-01', so the index stays usable.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">How would you implement a bounded producer-consumer setup in Java with multiple producer and consumer threads, without race conditions?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Java Threading<\/span><span class=\"iq-badge iq-badge--hard\">Hard<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>The cleanest way is to skip manual wait\/notify entirely and use java.util.concurrent.BlockingQueue, since it already handles the synchronization, capacity blocking, and wakeup logic correctly. ArrayBlockingQueue is a good default when you want a fixed-size buffer: put() blocks when the queue is full, take() blocks when it&#8217;s empty, and both are safe to call from any number of threads at once.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">java<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-java\">\n\nBlockingQueue&lt;Task&gt; queue = new ArrayBlockingQueue&lt;&gt;(100);\n\/\/ producer threads\n\nRunnable producer = () -&gt; {\n\n    while (true) {\n\n        Task t = createTask();\n\n        queue.put(t); \/\/ blocks if queue is full\n\n    }\n\n};\n\/\/ consumer threads\n\nRunnable consumer = () -&gt; {\n\n    while (true) {\n\n        Task t = queue.take(); \/\/ blocks if queue is empty\n\n        process(t);\n\n    }\n\n};\nExecutorService pool = Executors.newFixedThreadPool(8);\n\nfor (int i = 0; i &lt; 4; i++) pool.submit(producer);\n\nfor (int i = 0; i &lt; 4; i++) pool.submit(consumer);\n<\/code><\/pre><\/div><\/p>\n<p>The interview follow-up is usually &#8220;what if you had to write it yourself with wait\/notify.&#8221; There the gotcha is that notify() only wakes one waiting thread, so with multiple producers and consumers you almost always need notifyAll(), and the wait has to sit in a while loop re-checking the condition rather than an if, because a woken thread can find the condition false again if another thread grabbed the resource first (this is the classic spurious wakeup and lost wakeup problem). Getting that wrong is exactly why BlockingQueue exists, it already got these edge cases right so nobody has to re-derive them.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-qa\"><button class=\"iq-qa__q\" type=\"button\" aria-expanded=\"false\"><span class=\"iq-qa__qtext\">Given a directed graph, how do you detect whether it contains a cycle, and where does this show up in real systems?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Graph Algorithms<\/span><span class=\"iq-badge iq-badge--hard\">Hard<\/span><span class=\"iq-qa__chev\" aria-hidden=\"true\"><\/span><\/span><\/button><div class=\"iq-qa__a\"><div class=\"iq-qa__a-inner\"><\/p>\n<p>Run a depth-first search and track two sets of nodes: ones fully finished (all their descendants explored) and ones currently on the active recursion path. If DFS reaches a node that&#8217;s already on the current path, that&#8217;s a back edge, and it means there&#8217;s a cycle. A node you&#8217;ve already fully finished and popped off the path isn&#8217;t a problem, revisiting it just means the graph has multiple paths to it, which is fine for a DAG.<\/p>\n<p><div class=\"iq-code not-prose\"><div class=\"iq-code__bar\"><span class=\"iq-code__lang\">python<\/span><button class=\"iq-code__copy\" type=\"button\">Copy<\/button><\/div><pre><code class=\"language-python\">\n\ndef has_cycle(graph):\n\n    WHITE, GRAY, BLACK = 0, 1, 2\n\n    color = {node: WHITE for node in graph}\n    def dfs(node):\n\n        color[node] = GRAY\n\n        for neighbor in graph[node]:\n\n            if color[neighbor] == GRAY:\n\n                return True  # back edge, cycle found\n\n            if color[neighbor] == WHITE and dfs(neighbor):\n\n                return True\n\n        color[node] = BLACK\n\n        return False\n    return any(dfs(n) for n in graph if color[n] == WHITE)\n<\/code><\/pre><\/div><\/p>\n<p>The alternative is Kahn&#8217;s algorithm: repeatedly remove nodes with in-degree zero, decrementing their neighbors&#8217; in-degrees as you go. If you can remove every node this way, the graph is acyclic; if some nodes are left over with in-degree greater than zero, they&#8217;re stuck in a cycle. This version is often preferred in practice because it also gives you a topological order for free and avoids deep recursion on very large graphs, which matters since a naive recursive DFS can blow the stack on a graph with a long chain of dependencies.<\/p>\n<p>This isn&#8217;t just an academic exercise. Build tools and package managers use exactly this to catch circular dependencies before they cause an infinite build loop, spreadsheet engines use it to catch a cell that indirectly references itself, and workflow engines use it to validate a DAG of tasks before scheduling any of them.<\/p>\n<p><\/div><\/div><\/div>\n<div class=\"iq-callout iq-callout--insight not-prose\"><div class=\"iq-callout__title\">What we&#039;ve seen<\/div><div class=\"iq-callout__body\"><\/p>\n<p>Across Capgemini prep sessions run through LastRoundAI, the game-based section produces the most anxiety among freshers, largely because there&#8217;s no obvious way to &#8220;study&#8221; for it. The useful reframe: Capgemini is not testing whether you&#8217;ve memorized game solutions. It&#8217;s scoring your raw cognitive profile (attention, working memory, spatial reasoning) against a benchmark.<\/p>\n<p>What actually helps: timed cognitive training in the days before the test, not game walkthroughs. Practicing under a 6-minute timer for each task type builds the mental pacing that matters. Candidates who go in cold and spend two minutes on level 1 of the GeoStudio grid because they&#8217;re reading instructions during the game consistently run out of time. Read all game instructions during the tutorial phase before the clock starts on each game.<\/p>\n<p><\/div><\/div>\n<div class=\"iq-related not-prose\"><div class=\"iq-related__title\">Related interview guides<\/div><div class=\"iq-related__grid\"><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/tcs\"><span class=\"iq-rel__t\">TCS Interview Questions (2026): NQT, Technical, MR &#038; HR Rounds<\/span><span class=\"iq-rel__arrow\" aria-hidden=\"true\">&rarr;<\/span><\/a><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/infosys\"><span class=\"iq-rel__t\">Infosys Interview Questions (2026): Online Test, Technical &#038; HR Rounds<\/span><span class=\"iq-rel__arrow\" aria-hidden=\"true\">&rarr;<\/span><\/a><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/wipro\"><span class=\"iq-rel__t\">Wipro Interview Questions (2026): NLTH, Technical &#038; HR Rounds<\/span><span class=\"iq-rel__arrow\" aria-hidden=\"true\">&rarr;<\/span><\/a><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/accenture\"><span class=\"iq-rel__t\">Accenture Interview Questions (2026): Assessment, Coding, Technical &#038; HR<\/span><span class=\"iq-rel__arrow\" aria-hidden=\"true\">&rarr;<\/span><\/a><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/cognizant\"><span class=\"iq-rel__t\">Cognizant Interview Questions (2026): GenC, GenC Elevate &#038; GenC Next<\/span><span class=\"iq-rel__arrow\" aria-hidden=\"true\">&rarr;<\/span><\/a><\/div><\/div>\n<div class=\"iq-sources not-prose\"><div class=\"iq-sources__title\">Sources &amp; further reading<\/div><ul class=\"iq-sources__list\"><li><a href=\"https:\/\/unstop.com\/blog\/capgemini-recruitment-process\" target=\"_blank\" rel=\"nofollow noopener\">Unstop Capgemini Recruitment Process 2026<\/a><\/li><li><a href=\"https:\/\/prepinsta.com\/capgemini-recruitment-process\/\" target=\"_blank\" rel=\"nofollow noopener\">PrepInsta Capgemini Exceller Recruitment Process<\/a><\/li><li><a href=\"https:\/\/prepinsta.com\/capgemini\/capgemini-game-based-aptitude-test-questions\/\" target=\"_blank\" rel=\"nofollow noopener\">PrepInsta Capgemini Game-Based Aptitude Test Questions<\/a><\/li><li><a href=\"https:\/\/faceprep.in\/article\/new-capgemini-recruitment-process\/\" target=\"_blank\" rel=\"nofollow noopener\">FACE Prep Capgemini Recruitment Process 2026<\/a><\/li><li><a href=\"https:\/\/www.geeksforgeeks.org\/capgemini-interview-experience-on-campus-2\/\" target=\"_blank\" rel=\"nofollow noopener\">GeeksforGeeks Capgemini Interview Experience On-Campus<\/a><\/li><li><a href=\"https:\/\/prepinsta.com\/capgemini\/exceller-hr-interview-questions\/\" target=\"_blank\" rel=\"nofollow noopener\">PrepInsta Capgemini Exceller HR Interview Questions 2025<\/a><\/li><li><a href=\"https:\/\/unstop.com\/blog\/capgemini-pseudo-code-questions\" target=\"_blank\" rel=\"nofollow noopener\">Unstop Capgemini Pseudocode Questions<\/a><\/li><li><a href=\"https:\/\/prepinsta.com\/capgemini\/coding-questions\/\" target=\"_blank\" rel=\"nofollow noopener\">PrepInsta Capgemini Exceller Coding Questions 2026<\/a><\/li><\/ul><\/div>\n<p><script type=\"application\/ld+json\">\n{\n  \"@context\": \"https:\/\/schema.org\",\n  \"@type\": \"FAQPage\",\n  \"mainEntity\": [\n    {\n      \"@type\": \"Question\",\n      \"name\": \"What is the difference between the Capgemini Analyst and Senior Analyst track in 2026?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Both tracks recruit through the same Exceller program. Analyst (approximately Rs. 4.0 LPA base plus Rs. 25,000 one-time incentive) is assigned to candidates who clear the online assessment and technical interview without the dedicated coding round. Senior Analyst (Rs. 7.5 LPA) goes to candidates who additionally pass the 45-minute coding round. The coding round performance is the primary separator.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"Is there negative marking in the Capgemini online test?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"No. No negative marking on any section of the Capgemini online assessment: pseudocode, English, game-based aptitude, and behavioral are all mark-only. Attempt every question. A blank is guaranteed to score zero; a guess on a 4-option MCQ has a 25% expected value.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"Can I skip the game-based aptitude test and still clear the online assessment?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"No. The game-based aptitude section is an elimination gate in Capgemini's 2025-2026 assessment. Failing to clear any one of the four sections (pseudocode, English, game-based, behavioral) exits you from the process regardless of your scores in the others.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"What is the eligibility criteria for Capgemini Exceller in 2026?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Minimum 60% aggregate in your qualifying degree (BE\/BTech\/MCA\/MSc or equivalent). No active backlogs during the recruitment process. Full-time programs only. Most 2025-2026 drives target 2024 and 2025 graduation batches, with some including 2026 batch students.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"How long does the Capgemini Exceller selection process take from test to offer?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Typically 2-3 weeks from the online assessment date to offer letter, based on candidate reports from the 2025 cycle. The process can compress to 1 week for large campus drives where interviews happen in batches.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"Does Capgemini ask coding questions in the technical interview for Analyst track?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Sometimes, but it is not guaranteed for the Analyst track. The technical interview for Analyst candidates focuses primarily on OOP concepts, DBMS, data structure basics, and project discussion. A small coding question may appear on paper or screen, but it is not a competitive coding problem of the kind in the Senior Analyst coding round.\"\n      }\n    }\n  ]\n}\n<\/script><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Updated June 2026 Capgemini&#8217;s Exceller program is one of the larger fresher hiring pipelines in India IT right now, with the company targeting around 45,000 hires in 2025 with an explicit focus on what it calls an AI-ready workforce. The process has a genuinely unusual structure: a game-based cognitive test that has no analog in&#8230;<\/p>\n","protected":false},"author":7,"featured_media":1715,"comment_status":"open","ping_status":"closed","template":"","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_kad_post_classname":"","footnotes":""},"tags":[],"class_list":["post-969","iq","type-iq","status-publish","has-post-thumbnail","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.8 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Capgemini Interview Questions 2026 | LastRoundAI<\/title>\n<meta name=\"description\" content=\"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/lastroundai.com\/interview-questions\/capgemini\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Capgemini Interview Questions 2026 | LastRoundAI\" \/>\n<meta property=\"og:description\" content=\"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lastroundai.com\/interview-questions\/capgemini\" \/>\n<meta property=\"og:site_name\" content=\"LastRound AI\" \/>\n<meta property=\"article:modified_time\" content=\"2026-07-19T05:24:09+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-capgemini-og.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"630\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"26 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini\",\"name\":\"Capgemini Interview Questions 2026 | LastRoundAI\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-capgemini-og.png\",\"datePublished\":\"2026-07-03T03:50:20+00:00\",\"dateModified\":\"2026-07-19T05:24:09+00:00\",\"description\":\"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini#primaryimage\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-capgemini-og.png\",\"contentUrl\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-capgemini-og.png\",\"width\":1200,\"height\":630,\"caption\":\"Capgemini interview questions \u2014 LastRoundAI\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/capgemini#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/lastroundai.com\\\/blog\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Interview Questions\",\"item\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Capgemini Interview Questions (2026): Online Test, Technical &#038; HR\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/\",\"name\":\"LastRound AI\",\"description\":\"Interview Assistant prep, tech careers and AI tools\",\"publisher\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#organization\",\"name\":\"LastRound AI\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/06\\\/lastroundai-transprant-logo-optimized-BxEo2Wtq.png\",\"contentUrl\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/06\\\/lastroundai-transprant-logo-optimized-BxEo2Wtq.png\",\"width\":400,\"height\":400,\"caption\":\"LastRound AI\"},\"image\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Capgemini Interview Questions 2026 | LastRoundAI","description":"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/lastroundai.com\/interview-questions\/capgemini","og_locale":"en_US","og_type":"article","og_title":"Capgemini Interview Questions 2026 | LastRoundAI","og_description":"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.","og_url":"https:\/\/lastroundai.com\/interview-questions\/capgemini","og_site_name":"LastRound AI","article_modified_time":"2026-07-19T05:24:09+00:00","og_image":[{"width":1200,"height":630,"url":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-capgemini-og.png","type":"image\/png"}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"26 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini","url":"https:\/\/lastroundai.com\/interview-questions\/capgemini","name":"Capgemini Interview Questions 2026 | LastRoundAI","isPartOf":{"@id":"https:\/\/lastroundai.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini#primaryimage"},"image":{"@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini#primaryimage"},"thumbnailUrl":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-capgemini-og.png","datePublished":"2026-07-03T03:50:20+00:00","dateModified":"2026-07-19T05:24:09+00:00","description":"Real Capgemini interview questions for 2026: pseudocode, game-based aptitude, technical (OOP, DBMS, DSA), and HR. Covers Analyst and Senior Analyst tracks.","breadcrumb":{"@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lastroundai.com\/interview-questions\/capgemini"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini#primaryimage","url":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-capgemini-og.png","contentUrl":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-capgemini-og.png","width":1200,"height":630,"caption":"Capgemini interview questions \u2014 LastRoundAI"},{"@type":"BreadcrumbList","@id":"https:\/\/lastroundai.com\/interview-questions\/capgemini#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/lastroundai.com\/blog"},{"@type":"ListItem","position":2,"name":"Interview Questions","item":"https:\/\/lastroundai.com\/interview-questions"},{"@type":"ListItem","position":3,"name":"Capgemini Interview Questions (2026): Online Test, Technical &#038; HR"}]},{"@type":"WebSite","@id":"https:\/\/lastroundai.com\/blog\/#website","url":"https:\/\/lastroundai.com\/blog\/","name":"LastRound AI","description":"Interview Assistant prep, tech careers and AI tools","publisher":{"@id":"https:\/\/lastroundai.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/lastroundai.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/lastroundai.com\/blog\/#organization","name":"LastRound AI","url":"https:\/\/lastroundai.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lastroundai.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/06\/lastroundai-transprant-logo-optimized-BxEo2Wtq.png","contentUrl":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/06\/lastroundai-transprant-logo-optimized-BxEo2Wtq.png","width":400,"height":400,"caption":"LastRound AI"},"image":{"@id":"https:\/\/lastroundai.com\/blog\/#\/schema\/logo\/image\/"}}]}},"_links":{"self":[{"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq\/969","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq"}],"about":[{"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/types\/iq"}],"author":[{"embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/comments?post=969"}],"version-history":[{"count":4,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq\/969\/revisions"}],"predecessor-version":[{"id":1840,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq\/969\/revisions\/1840"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/media\/1715"}],"wp:attachment":[{"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/media?parent=969"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/tags?post=969"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}