{"id":973,"date":"2026-06-30T02:48:45","date_gmt":"2026-06-30T02:48:45","guid":{"rendered":"https:\/\/lastroundai.com\/blog\/?post_type=iq&#038;p=973"},"modified":"2026-07-19T10:54:09","modified_gmt":"2026-07-19T05:24:09","slug":"infosys","status":"publish","type":"iq","link":"https:\/\/lastroundai.com\/interview-questions\/infosys","title":{"rendered":"Infosys Interview Questions (2026): Online Test, Technical &#038; HR Rounds"},"content":{"rendered":"<p><em>Updated June 2026<\/em><\/p>\n<p>Infosys runs one of India&#8217;s largest campus hiring cycles, bringing in tens of thousands of freshers each year across its System Engineer, Specialist Programmer, and Power Programmer tracks. The gap between those three starting points is not small: a Power Programmer earns roughly 3 to 6 times what a System Engineer earns in the first year. The test score and the technical interview are where that split happens, so knowing exactly what each section tests is worth more than generic &#8220;brush up on OOP&#8221; advice.<\/p>\n<p>This page covers the full 2026 process: the online test&#8217;s seven sections, what the Technical round actually drills, what HR is confirming (not evaluating), and a bank of real questions with answers. Each answer includes a line on how the question tends to land specifically in Infosys rooms, not just the textbook version.<\/p>\n<div class=\"iq-stats not-prose\"><div class=\"iq-stat\"><span class=\"iq-stat__value\">3<\/span><span class=\"iq-stat__label\">Stages<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">~120 min, 7 sections<\/span><span class=\"iq-stat__label\">Online test<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">2 problems, 45 min<\/span><span class=\"iq-stat__label\">Coding section<\/span><\/div><div class=\"iq-stat\"><span class=\"iq-stat__value\">SE \/ SP \/ DSE \/ PP<\/span><span class=\"iq-stat__label\">Tracks<\/span><\/div><\/div>\n<h2>The Infosys selection process in 2026<\/h2>\n<p>Infosys runs three distinct hiring routes. The most common for campus candidates is the <strong>InfyTQ pathway<\/strong>: register on InfyTQ, complete Infosys&#8217;s own certification courses, and sit the placement exam. Candidates who score above the cutoff get shortlisted for the Technical and HR rounds. The second route is <strong>HackWithInfy<\/strong>, a public coding competition now in its eighth year, which gives top finishers direct PPO (pre-placement offer) consideration for the Specialist Programmer and Power Programmer roles. The third is standard campus placement at colleges where Infosys has a direct tie-up.<\/p>\n<p>Across all three routes, the final selection funnel is roughly 3 rounds:<\/p>\n<ul>\n<li><strong>System Engineer (SE)<\/strong>: Base track for most campus hires. Package Rs. 3.6-4.5 LPA. Application development and maintenance work at Infosys Development Centers.<\/li>\n<li><strong>Specialist Programmer (SP) \/ Digital Specialist Engineer (DSE)<\/strong>: Requires a strong coding section score. Package Rs. 6.25-9.5 LPA. Modern technology stacks, cloud, and product work.<\/li>\n<li><strong>Power Programmer (PP)<\/strong>: Top-tier competitive track, historically through HackWithInfy. Package up to Rs. 21 LPA for the strongest performers in the 2026 cycle.<\/li>\n<\/ul>\n<p>Eligibility for the standard route: minimum 60% or 6.0 CGPA across 10th, 12th, and degree. No active backlogs. Accepts B.E\/B.Tech, M.Tech, MCA, and M.Sc (CS\/IT). Maximum 2-year education gap permitted. Candidates must be willing to relocate, as Infosys assigns projects across its 13 development centers in India.<\/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\">~120 min, 7 sections<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>Seven sections covering Mathematical Ability, Analytical Reasoning, Verbal Ability, Pseudocode, Puzzle Solving, English Grammar, and English Writing. Total 60 questions with a 120-minute window. Sectional cutoffs apply; clearing each section matters, not just the aggregate. No negative marking. The Pseudocode section is the one most candidates underestimate: 5 questions in 10 minutes, and the logic can trip you up if you&#8217;ve never practiced tracing through pseudocode on paper.<\/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\">30-60 min<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>One panel member, occasionally two. Opens almost universally with your final year project or internship. Then pivots to core CS fundamentals: OOP, DBMS and SQL, data structures, and often one or two live coding problems on paper or a shared editor. SP\/DSE candidates get harder questions and may be asked to write functioning code rather than describe an approach.<\/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 interview<\/span><span class=\"iq-step__meta\">15-30 min<\/span><\/div><div class=\"iq-step__desc\"><\/p>\n<p>Everyone clears this round. One HR interviewer. The goal is confirmation: communication skills, willingness to relocate, shift flexibility, and genuine interest in joining. Infosys HR rounds have eliminated candidates who said no to relocation, so treat this as a logistics check that requires honest preparation, not just good answers on the fly.<\/p>\n<p><\/div><\/div><\/div><br \/>\n<\/div>\n<h2>Online test: aptitude and pseudocode<\/h2>\n<p>The online assessment that Infosys runs in 2026 has a structure that differs from what many older prep guides describe. The current pattern has 7 sections. Mathematical Ability (10 questions, 35 minutes) is the lightest on questions but the heaviest on time per question. Analytical Reasoning (15 questions, 25 minutes) is the reverse: more questions, less time. Verbal Ability (20 questions, 20 minutes) is the fastest-paced section in the whole test.<\/p>\n<h3>Mathematical Ability (10 questions, 35 min)<\/h3>\n<p>The extra time is deliberate. These problems require multi-step calculation, not just formula recall. Topics that appear consistently: time and work, time-speed-distance, percentages and profit\/loss, permutations and combinations, probability, and data interpretation from tables or charts. An on-screen calculator is available for some variants of the test, but the problems are designed so that a calculator helps less than mental estimation does.<\/p>\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\">23<\/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\">In a row of 8 people, A is 3rd from the left and B is 5th from the right. How many people sit between A and B?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Reasoning<\/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 is at position 3 from the left. B is 5th from the right in a row of 8, so B is at position 8 &#8211; 5 + 1 = 4 from the left. Positions: A at 3, B at 4. People between them: positions 3+1 to 4-1 = none. They are adjacent.<\/p>\n<p>Position-in-row problems are standard warm-up questions in the Analytical Reasoning section. The error most candidates make: forgetting to convert &#8220;from the right&#8221; into an absolute position before comparing.<\/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\">Check whether a given string is a palindrome, ignoring spaces and case.<\/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>Strip spaces, convert to lowercase, then compare the string with its reverse. A two-pointer approach works without extra memory.<\/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 is_palindrome(s):\n\n    cleaned = s.replace(\u201d \u201c, \u201c\u201d).lower()\n\n    left, right = 0, len(cleaned) \u2013 1\n    while left &lt; right:\n\n        if cleaned[left] != cleaned[right]:\n\n            return False\n\n        left += 1\n\n        right -= 1\n    return True\nprint(is_palindrome(\u201cA man a plan a canal Panama\u201d))  # True\n\nprint(is_palindrome(\u201crace a car\u201d))                   # False\n<\/code><\/pre><\/div><\/p>\n<p>Palindrome checking is one of the most commonly reported Infosys InfyTQ coding problems. The &#8220;ignore spaces and case&#8221; constraint is almost always present. Make sure your solution handles the empty string (returns True) and single-character input.<\/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 one 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 methods together, controlling what&#8217;s accessible from outside. Example: a BankAccount class hides the balance field and exposes only deposit() and withdraw(). Abstraction: hiding implementation details and exposing only what&#8217;s needed. Example: you call list.sort() without knowing what sorting algorithm it uses. Inheritance: a child class inherits properties and methods from a parent. Example: ElectricCar extends Car and adds a charge() method. Polymorphism: one interface, multiple behaviors. Example: the same draw() method on Circle and Rectangle produces different output at runtime.<\/p>\n<p>Infosys panels in 2025-2026 candidate reports consistently ask for examples, not just definitions. The panel member will often follow up by asking you to sketch out one of these examples in Java or Python. Prepare the BankAccount or Shape example in the language you&#8217;re most comfortable with.<\/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--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>Method overloading is having multiple methods with the same name but different parameter lists within the same class. Resolved at compile time. Example: add(int a, int b) and add(double a, double b) coexist in one class.<\/p>\n<p>Method overriding is a subclass providing its own implementation of a method already defined in the parent class, with the same name and same parameter list. Resolved at runtime through dynamic dispatch.<\/p>\n<p>The one-line version Infosys interviewers want: overloading is same-class, different parameters; overriding is different-class, same parameters. This question appeared in candidate reports from Infosys Technical rounds at VIT, SRM, and BITS campuses in 2025.<\/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 constructor? What is a copy constructor?<\/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 constructor is a special method that initializes an object when it&#8217;s created. It has the same name as the class and no return type, not even void.<\/p>\n<p>A copy constructor creates a new object as a copy of an existing object. In C++, if you don&#8217;t define one, the compiler generates a shallow copy by default. If your class manages dynamic memory (pointers), you need a deep copy constructor to avoid both objects pointing to the same heap memory.<\/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\n\/\/ C++ copy constructor\n\nclass Point {\n\n    int x, y;\n\npublic:\n\n    Point(int a, int b) : x(a), y(b) {}\n    \/\/ Copy constructor\n\n    Point(const Point&amp; p) : x(p.x), y(p.y) {\n\n        \/\/ Deep copy: each object gets its own x, y\n\n    }\n\n};\n<\/code><\/pre><\/div><\/p>\n<p>Copy constructors come up for candidates who mention C++ on their resume. For Java-only candidates, the equivalent question is usually about cloning or about why Java passes objects by reference.<\/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? Where is each used?<\/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: Last In, First Out. The last element pushed is the first popped. Real uses: function call stack during recursion, browser back button, undo operations in editors, balanced parentheses checking.<\/p>\n<p>Queue: First In, First Out. The first element added is the first removed. Real uses: CPU scheduling ready queue, BFS traversal of graphs, print job queue, message queues between microservices.<\/p>\n<p>The Infosys interviewer often follows this up with &#8220;implement a stack using only queues&#8221; or vice versa, especially for SP-track candidates. Know the approach: to implement a stack using two queues, push always goes to the smaller queue, and you move all elements from the larger queue to make each pop O(1) or make each push O(n).<\/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 chain of nodes, each containing data and a pointer to the next node. Unlike an array, nodes are not stored in contiguous memory.<\/p>\n<ul>\n<li>Arrays support O(1) random access by index. Linked lists need O(n) traversal to reach element at position i.<\/li>\n<li>Arrays have a fixed size at creation (in C\/C++). Linked lists grow dynamically by allocating new nodes.<\/li>\n<li>Insertion and deletion at the beginning of a linked list is O(1). At the beginning of an array, it requires shifting all elements: O(n).<\/li>\n<\/ul>\n<p>After defining this, expect &#8220;write a function to reverse a singly linked list&#8221; on paper or in a shared editor.<\/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 primary key and a foreign key?<\/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 primary key uniquely identifies each row in its own table. It cannot be NULL and cannot repeat. A foreign key is a column, or set of columns, in one table that references the primary key of another table, enforcing a link between the two.<\/p>\n<p>Example: an Orders table has a customer_id foreign key that points to the id primary key in the Customers table. This stops an order from being inserted with a customer_id that doesn&#8217;t exist in Customers, which is what &#8220;referential integrity&#8221; means in practice.<\/p>\n<p>Infosys interviewers pair this with a quick check on composite keys: a primary key made of more than one column, common in join tables representing many-to-many relationships. Know at least one real example of when you&#8217;d need 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 is the difference between a process and a thread?<\/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 process is an independent program in execution with its own memory space, file handles, and resources. Processes are isolated: one cannot directly read another&#8217;s memory. A thread is a unit of execution within a process, sharing the process&#8217;s memory and resources with other threads.<\/p>\n<p>Practical differences: creating a thread is cheaper than creating a process. Context switching between threads is faster than between processes. But threads sharing memory means they need synchronization (mutexes, semaphores) to avoid race conditions. Processes are safer for fault isolation: a crash in one process does not bring down another.<\/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>HR at Infosys wants a 60-to-90-second version, not a 5-minute autobiography. Hit four points: degree and college (10 seconds), one project or experience that demonstrates your strongest technical skill (30 seconds), one non-technical quality you bring to a team (10 seconds), and why you are here specifically (10 seconds).<\/p>\n<p>The most common failure mode here is candidates who spend 3 minutes reciting their resume in chronological order. The HR interviewer has your resume in front of them. What they want is your pitch, not your transcript.<\/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? Are you comfortable with 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>These are the two questions that have eliminated candidates who otherwise performed well in the Technical round. Infosys operates 13 development centers across India and serves global clients, which means US, UK, and Australian time-zone overlap for many projects.<\/p>\n<p>If you can genuinely commit to both, say so directly. If you have a real constraint, state it clearly and explain how you would manage it. Do not say &#8220;yes&#8221; during HR and then raise a constraint at onboarding. That creates problems for both sides and is visible in your employment record.<\/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 Infosys?<\/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>Avoid: &#8220;because Infosys is a reputed company.&#8221; That is the answer 80% of candidates give and it signals no research. Tie your answer to something specific: Infosys&#8217;s training program at the Mysuru campus (described as the world&#8217;s largest corporate university at 337 acres), a specific business unit that connects to your degree (healthcare IT, banking with Finacle, SAP practice), or the InfyTQ learning platform you have already been using.<\/p>\n<p>If you registered for InfyTQ and completed a certification, mention it. The HR interviewer responds to evidence of prior engagement with Infosys much better than brand statements.<\/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>Pick a direction and be specific. &#8220;I want to move into cloud architecture&#8221; is better than &#8220;I want to grow as a developer.&#8221; Mention one specific Infosys path: Infosys has internal tracks for transitioning into consulting, cloud, and data engineering roles. Showing that you know those paths exist signals real research.<\/p>\n<p>The answer that tends to fall flat: &#8220;I want to be a manager.&#8221; HR interviewers at Infosys in 2025-2026 note they prefer candidates who articulate a technical growth path first, before management ambitions. You are joining as an SE or SP; management is a long-term horizon, not a 5-year sprint from day 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 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 and give a specific example from your project or college work. &#8220;I&#8217;m a fast learner&#8221; without evidence reads as filler. &#8220;During my final year project I learned React in 2 weeks to build the frontend because our original team member dropped out&#8221; is evidence.<\/p>\n<p>For weaknesses: do not say &#8220;I work too hard&#8221; or &#8220;I&#8217;m a perfectionist.&#8221; Pick a genuine developmental gap that is not central to the SE role, and name the specific thing you are doing to address it. &#8220;I tend to avoid asking for help when I&#8217;m stuck; I&#8217;ve been actively practicing saying I need clarification within 30 minutes instead of hours&#8221; is the format that works.<\/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 other offers? What is your decision timeline?<\/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>Answer honestly. HR asks this to gauge your timeline and whether they need to accelerate. If you have competing offers, say so without naming the company; just note the timeline (&#8220;I have another offer with a 2-week deadline&#8221;). If you do not have other offers, that is fine too. This is logistics, not a power play.<\/p>\n<p>What the HR interviewer is also checking: how you handle a direct question under slight pressure. Vague non-answers here signal poor communication, which is what they are actually evaluating.<\/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 should we hire you?<\/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>This question isn&#8217;t a ranking exercise against candidates you&#8217;ve never met. It&#8217;s asking you to connect your specific skills to what the SE or SP role actually needs, in one tight answer.<\/p>\n<p>Pick 2 concrete things: a technical skill demonstrated by a real project, not a claimed skill, and one behavioral trait relevant to Infosys&#8217;s client-facing delivery model, such as being comfortable working within a structured process. &#8220;I&#8217;m hardworking and a quick learner&#8221; without evidence is the answer that gets forgotten 5 minutes later. A specific project detail is the one that gets remembered.<\/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>Never say no. Infosys HR interviewers in 2025-2026 candidate reports repeatedly flag a blank response here as a signal of low genuine interest, even when the rest of the interview went well.<\/p>\n<p>Ask something you can&#8217;t find on the careers page: which specific project or client account new SE hires typically get assigned to first at your development center, or how the transition from the Mysuru training period into an actual project usually works. One good question at the end does more for your candidacy than a second round of &#8220;tell me about yourself&#8221; ever could.<\/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 InfyTQ and do I need it to get into Infosys?<\/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>InfyTQ is Infosys&#8217;s own learning and assessment platform. It hosts certification courses in Python, Java, data structures, and other CS fundamentals, followed by a certification exam. Clearing the InfyTQ certification above the cutoff qualifies you for the Infosys hiring pipeline directly. You do not need InfyTQ if Infosys is visiting your campus for a direct placement drive, as the campus drive has its own online test. For off-campus candidates and those at colleges without a direct Infosys tie-up, InfyTQ is the primary pathway.<\/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 many rounds are there in the Infosys hiring process for freshers?<\/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>Three rounds: Online Assessment, Technical Interview, and HR Interview. Some candidates at select campuses report a combined Technical+HR panel for the SE track, effectively compressing it to two rounds. The DSE and SP tracks consistently have the three-round format. HackWithInfy adds a second coding round on-site for the top 100 finalists before the interview.<\/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 System Engineer, Specialist Programmer, and Power Programmer at Infosys?<\/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>System Engineer (SE) is the base fresher track at Rs. 3.6-4.5 LPA. Most campus hires land here. Work involves application development and maintenance on client projects. Specialist Programmer (SP) or Digital Specialist Engineer (DSE) ranges from Rs. 6.25-9.5 LPA and requires a strong coding section performance in the online test. Power Programmer (PP) goes up to Rs. 21 LPA and is primarily reached through HackWithInfy, which requires solving 3 medium-hard DSA problems in 3 hours. The salary difference between SE and PP in year one is substantial, around 5-6x, which makes the preparation investment worthwhile for strong coders.<\/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 Infosys have a service bond?<\/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>Infosys requires freshers to sign a service agreement, typically 1-2 years from the date of joining. Candidates who leave before the bond period ends may be required to pay back training costs. The training period at the Mysuru campus is around 3-5 months and is a significant investment from Infosys&#8217;s side, which is what the bond reflects. The specific penalty amount and bond duration are stated in your offer letter and can vary by batch and role track.<\/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 coding language should I use in the InfyTQ coding section?<\/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>Python 3 is the most practical choice for most candidates. The problem types (string manipulation, array operations, basic algorithm implementation) map naturally to clean Python code, and the syntax is faster to write under time pressure than Java or C++. Java is fine if it is your primary language. The InfyTQ platform supports Python, Java, and C++. Unlike TCS iON, the input format on InfyTQ follows standard competitive programming conventions, so your practice on HackerRank or LeetCode transfers directly.<\/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 Infosys hiring process take from online test to offer letter?<\/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>For campus placement drives, the turnaround is typically 1-3 weeks from online test to offer letter. Off-campus and InfyTQ pathway candidates report a longer timeline of 4-8 weeks, depending on batch size and interview scheduling. Some candidates in the 2025-2026 cycle reported waiting up to 10 weeks between the Technical interview and the final offer, particularly for the SP and DSE tracks where the selection rate is lower.<\/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\">22<\/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 pipe can fill a tank in 12 hours. Another pipe can empty it in 18 hours. If both are open together, in how many hours will the tank be filled?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Aptitude<\/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>Work rate of filling pipe = 1\/12 per hour. Work rate of emptying pipe = 1\/18 per hour. Net rate = 1\/12 &#8211; 1\/18 = 3\/36 &#8211; 2\/36 = 1\/36 per hour. Time to fill = 36 hours.<\/p>\n<p>This type of combined-work problem appears in almost every Infosys Mathematical Ability section. The trap is forgetting to subtract the emptying pipe&#8217;s rate. Practice setting up the net rate as fractions before plugging in numbers. Speed here matters: you have 35 minutes for 10 questions, which sounds relaxed, but these problems are longer than NQT problems at TCS.<\/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\">In how many ways can 6 people be seated in a row if two specific people must always sit together?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Aptitude<\/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>Treat the two people who must sit together as a single unit. Now you have 5 units to arrange in a row: 5! = 120 ways. The two people within the unit can swap positions: 2! = 2 ways. Total arrangements = 120 x 2 = 240.<\/p>\n<p>Permutations and combinations questions appear in the Infosys Mathematical Ability section in 2025-2026 candidate reports. The &#8220;treat as a unit&#8221; approach for adjacency constraints comes up regularly in this form.<\/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\">A train 150 meters long crosses a platform 250 meters long in 20 seconds. What is the speed of the train in km\/hr?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Aptitude<\/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>Total distance covered while crossing the platform equals the train&#8217;s length plus the platform&#8217;s length: 150 + 250 = 400 meters. Speed = distance \/ time = 400 \/ 20 = 20 meters per second. Converting to km\/hr: 20 x 18\/5 = 72 km\/hr.<\/p>\n<p>Time-speed-distance problems in the Infosys Mathematical Ability section almost always hide the real distance inside a word problem rather than stating it directly. The train-crossing-a-platform setup is one of the most repeated formats across 2025-2026 candidate reports on PrepInsta. The mistake that costs most candidates the question: using only the train&#8217;s length, or only the platform&#8217;s length, instead of the sum of both.<\/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\">A is B&#039;s sister. C is B&#039;s mother. D is C&#039;s father. E is D&#039;s mother. How is A related to D?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Reasoning<\/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>Work from the bottom up. C is B&#8217;s mother, so C is also A&#8217;s mother, since A and B are siblings. D is C&#8217;s father, which makes D the maternal grandfather of both A and B. A is therefore D&#8217;s granddaughter.<\/p>\n<p>Multi-generation blood relation chains like this one show up regularly in the Infosys Analytical Reasoning section. The fix is to draw a small family tree on scratch paper the moment more than 3 people get mentioned. Holding 5 relationships in your head under a 100-second-per-question clock is where most candidates lose time, not the logic itself.<\/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\">Find the length of the longest substring without repeating characters.<\/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>Use a sliding window with a set to track characters in the current window. Move the right pointer forward, adding characters. If a duplicate appears, shrink from the left until the duplicate is gone.<\/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 length_of_longest_substring(s):\n\n    char_set = set()\n\n    left = 0\n\n    max_len = 0\n    for right in range(len(s)):\n\n        while s[right] in char_set:\n\n            char_set.remove(s[left])\n\n            left += 1\n\n        char_set.add(s[right])\n\n        max_len = max(max_len, right \u2013 left + 1)\n    return max_len\nprint(length_of_longest_substring(\u201cabcabcbb\u201d))  # Output: 3 (\u201cabc\u201d)\n\nprint(length_of_longest_substring(\u201cpwwkew\u201d))    # Output: 3 (\u201cwke\u201d)\n<\/code><\/pre><\/div><\/p>\n<p>Sliding window problems appear in both InfyTQ coding rounds and HackWithInfy Round 1. Time complexity is O(n). If you start with the O(n^2) brute force, you&#8217;ll pass some test cases but likely not all. The InfyTQ platform accepts Python 3 and the syntax is standard, unlike TCS iON which has a custom input format.<\/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\">Find the missing number in an array containing n distinct numbers from 0 to n.<\/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>Use the sum formula for the first n natural numbers. The expected sum of 0 to n is n*(n+1)\/2. Subtract the actual sum of the array from the expected sum, and the difference is the missing number.<\/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 missing_number(arr):\n\n    n = len(arr)\n\n    expected_sum = n * (n + 1) \/\/ 2\n\n    actual_sum = sum(arr)\n\n    return expected_sum \u2013 actual_sum\nprint(missing_number([3, 0, 1]))               # Output: 2\n\nprint(missing_number([9,6,4,2,3,5,7,0,1]))     # Output: 8\n<\/code><\/pre><\/div><\/p>\n<p>This question is reported often in InfyTQ practice sets and HackWithInfy Round 1 write-ups, usually as a warm-up before a harder array or string problem. The sum-formula approach runs in O(n) time and O(1) space, which is what interviewers look for over a nested-loop brute force checking every number from 0 to n against the array.<\/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 virtual function? Why use 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>In C++, a virtual function is a member function declared with the virtual keyword in a base class, which allows derived classes to override it. The key effect: when you call the function through a base class pointer or reference, the derived class&#8217;s version runs, not the base class version. This is runtime polymorphism.<\/p>\n<p>Without virtual, C++ resolves the function based on the pointer type at compile time, not the actual object type at runtime. With virtual, it follows the vtable lookup at runtime.<\/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\n\/\/ C++ example\n\nclass Animal {\n\npublic:\n\n    virtual void sound() {\n\n        cout &lt;&lt; \u201cSome sound\u201d &lt;&lt; endl;\n\n    }\n\n};\nclass Dog : public Animal {\n\npublic:\n\n    void sound() override {\n\n        cout &lt;&lt; \u201cWoof\u201d &lt;&lt; endl;\n\n    }\n\n};\n\/\/ Using base class pointer\n\nAnimal* a = new Dog();\n\na-&gt;sound();  \/\/ Outputs: Woof (not \u201cSome sound\u201d)\n<\/code><\/pre><\/div><\/p>\n<p>Virtual functions come up particularly for candidates who list C++ as their primary language. Java candidates get asked about interfaces and abstract classes instead, but the underlying concept is the same.<\/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 an abstract class and an interface?<\/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>In Java: an abstract class can have both concrete and abstract methods, can have constructors and instance variables, and a class can extend only one abstract class. An interface (pre-Java 8) could only hold abstract method signatures; any class can implement multiple interfaces. From Java 8 onward, interfaces support default and static methods.<\/p>\n<p>The practical decision rule: use an abstract class when related classes share actual code you want to inherit. Use an interface to define a contract that unrelated classes can fulfill (like Comparable or Runnable). Infosys interviewers often ask &#8220;which would you use to define a shape hierarchy?&#8221; The answer is abstract class, because Circle and Rectangle share a getArea() concept but need their own implementations.<\/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? What is the difference between checked and unchecked exceptions 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>Exception handling separates error-handling code from normal program logic using try, catch, and finally blocks. Code that might fail goes in try; the recovery logic goes in catch; cleanup code that must run regardless of success or failure goes in finally.<\/p>\n<p>Checked exceptions, like IOException, are checked at compile time; the compiler forces you to either catch them or declare them with throws. Unchecked exceptions, like NullPointerException or ArrayIndexOutOfBoundsException, extend RuntimeException and are not checked at compile time; they usually signal a programming bug rather than a recoverable condition.<\/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\ntry {\n\n    int[] arr = new int[5];\n\n    System.out.println(arr[10]); \/\/ throws ArrayIndexOutOfBoundsException\n\n} catch (ArrayIndexOutOfBoundsException e) {\n\n    System.out.println(\u201cIndex out of bounds: \u201d + e.getMessage());\n\n} finally {\n\n    System.out.println(\u201cCleanup runs here regardless.\u201d);\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>Infosys Technical rounds ask this most often for Java-track candidates right after the OOP pillars question. The follow-up that trips people up: does finally run if there&#8217;s a return statement inside try? Yes, it runs before the method actually returns, with one exception: System.exit() inside try skips it.<\/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 function to reverse a singly linked list.<\/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>Iterate through the list, reversing each node&#8217;s next pointer as you go. You need three pointers: prev, curr, and next.<\/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\nclass Node {\n\n    int data;\n\n    Node next;\n\n    Node(int d) { data = d; }\n\n}\npublic class LinkedList {\n\n    static Node reverse(Node head) {\n\n        Node prev = null;\n\n        Node curr = head;\n        while (curr != null) {\n\n            Node nextTemp = curr.next; \/\/ save next\n\n            curr.next = prev;          \/\/ reverse pointer\n\n            prev = curr;               \/\/ move prev forward\n\n            curr = nextTemp;           \/\/ move curr forward\n\n        }\n\n        return prev; \/\/ prev is now the new head\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>This is one of the most frequently reported Infosys Technical round coding questions across candidate write-ups from 2024-2025 cycles. Write it cleanly on paper. The interviewer watches whether you get the order of pointer reassignment right (save next before reversing, not after).<\/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 BFS and DFS?<\/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>Breadth-First Search explores a graph level by level, using a queue. It finds the shortest path in an unweighted graph because it expands all nodes at distance k before any node at distance k+1.<\/p>\n<p>Depth-First Search goes as deep as possible along one branch before backtracking, using a stack (or the call stack during recursion). It&#8217;s used for cycle detection, topological sort, and maze solving where you need to fully explore paths.<\/p>\n<p>For freshers, the follow-up is usually: &#8220;Given a tree, which would you use to find whether two nodes are connected?&#8221; (BFS or DFS both work.) &#8220;Which would you use to find the shortest path?&#8221; (BFS for unweighted graphs.)<\/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\">Implement binary search on a sorted array. What is its time complexity?<\/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>Binary search repeatedly halves the search space by comparing the target to the middle element. If the target is smaller than the middle element, search the left half; if larger, search the right half. Time complexity is O(log n), because each comparison eliminates half of the remaining elements.<\/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 binary_search(arr, target):\n\n    low, high = 0, len(arr) \u2013 1\n    while low &lt;= high:\n\n        mid = (low + high) \/\/ 2\n\n        if arr[mid] == target:\n\n            return mid\n\n        elif arr[mid] &lt; target:\n\n            low = mid + 1\n\n        else:\n\n            high = mid \u2013 1\n    return -1\nprint(binary_search([1, 3, 5, 7, 9, 11], 7))  # Output: 3\n<\/code><\/pre><\/div><\/p>\n<p>This is a standard Infosys Technical round question for candidates who list data structures as a strength on their resume. The interviewer usually asks you to state the precondition out loud first: binary search only works on a sorted array. Candidates who jump straight to code without saying that sometimes get &#8220;what if the array isn&#8217;t sorted?&#8221; as a pointed follow-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 recursion? Convert this recursive factorial function to an iterative one.<\/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>Recursion is a function calling itself with a smaller version of the same problem, until it reaches a base case that stops the calls. Each call adds a new frame to the call stack, which is why deep recursion without a proper base case causes a stack overflow.<\/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# Recursive version\n\ndef factorial_recursive(n):\n\n    if n == 0:\n\n        return 1\n\n    return n * factorial_recursive(n \u2013 1)\n# Iterative version\n\ndef factorial_iterative(n):\n\n    result = 1\n\n    for i in range(2, n + 1):\n\n        result *= i\n\n    return result\nprint(factorial_recursive(5))  # 120\n\nprint(factorial_iterative(5))  # 120\n<\/code><\/pre><\/div><\/p>\n<p>Infosys interviewers ask for the iterative version specifically to check whether you understand the tradeoff: recursion often reads cleaner, but the iterative version uses O(1) extra space instead of O(n) call-stack frames. SP and DSE candidates should expect a follow-up about tail call optimization, which Python does not perform, unlike some functional languages.<\/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? Explain with an example.<\/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: all operations in a transaction succeed together or all fail together. A bank transfer either debits the sender AND credits the receiver, or neither operation occurs. No partial commit.<\/p>\n<p>Consistency: data must be in a valid state before and after the transaction. If the account balance cannot go negative, a withdrawal that would create a negative balance is rolled back.<\/p>\n<p>Isolation: concurrent transactions do not see each other&#8217;s intermediate states. Two simultaneous withdrawals from the same account cannot both succeed if together they exceed the balance.<\/p>\n<p>Durability: once committed, a transaction&#8217;s changes survive system crashes. The data is written to non-volatile storage before the commit is acknowledged.<\/p>\n<p>ACID properties come up in almost every Infosys Technical interview. Know the bank transfer example cold. The interviewer will often ask you to explain which property prevents a specific failure scenario.<\/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? What problem does it solve?<\/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 organizes tables to reduce data redundancy and dependency. Without it, updating a single fact (say, a customer&#8217;s city) requires updating it in every row where that customer appears. Miss one row and the database is inconsistent.<\/p>\n<ul>\n<li>1NF: each column holds atomic values, no repeating groups or arrays in a single cell.<\/li>\n<li>2NF: 1NF plus no partial dependency. Every non-key column must depend on the entire primary key, not just part of it. Applies when the primary key is composite.<\/li>\n<li>3NF: 2NF plus no transitive dependency. Non-key columns depend only on the primary key, not on other non-key columns.<\/li>\n<\/ul>\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 in 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>Several approaches work. The subquery approach is the most widely expected at Infosys:<\/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 Approach 1: subquery (most commonly expected)\n\nSELECT MAX(salary) AS second_highest\n\nFROM employees\n\nWHERE salary &lt; (SELECT MAX(salary) FROM employees);\n\u2014 Approach 2: using LIMIT and OFFSET (MySQL, PostgreSQL)\n\nSELECT DISTINCT salary\n\nFROM employees\n\nORDER BY salary DESC\n\nLIMIT 1 OFFSET 1;\n\u2014 Approach 3: using a window function (impresses SP-track interviewers)\n\nSELECT salary\n\nFROM (\n\n    SELECT salary, DENSE_RANK() OVER (ORDER BY salary DESC) AS rnk\n\n    FROM employees\n\n) ranked\n\nWHERE rnk = 2;\n<\/code><\/pre><\/div><\/p>\n<p>This is one of the most consistently reported Infosys SQL questions across candidate experiences on GeeksforGeeks and Internshala. Know at least two approaches. The subquery version is expected at minimum. If you mention window functions, the interviewer may ask you to explain RANK vs DENSE_RANK vs ROW_NUMBER, so be ready for that follow-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 the difference between JOIN types in SQL?<\/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>INNER JOIN returns only rows where there is a match in both tables. LEFT JOIN (or LEFT OUTER JOIN) returns all rows from the left table, with NULLs for columns from the right table where there is no match. RIGHT JOIN is the mirror image. FULL OUTER JOIN returns all rows from both tables, with NULLs where there is no match on the other side.<\/p>\n<p>The Infosys interviewer usually asks you to explain with an example: a Customers table and an Orders table. An INNER JOIN gives you only customers who have placed at least one order. A LEFT JOIN gives you all customers, including those with no orders (NULL order columns for 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\">What is an index in a database? When would you not use one?<\/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 index is a data structure (typically a B-tree) that speeds up row retrieval by creating a fast lookup path by indexed column values. A full table scan on a 10-million-row table becomes a millisecond B-tree traversal with the right index.<\/p>\n<p>You would not use an index on small tables (the overhead exceeds the benefit), columns with very low cardinality (like a boolean flag), or tables that are written to heavily (indexes slow down INSERT and UPDATE because each write must also update the index). Over-indexing a write-heavy table is a real production mistake that Infosys panels sometimes ask freshers about, because it signals awareness beyond textbook knowledge.<\/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 departments with more than 5 employees.<\/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>GROUP BY collects rows by department, and HAVING filters groups after aggregation. WHERE cannot be used here because the condition depends on a COUNT, which only exists once the rows are grouped.<\/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\nSELECT department_id, COUNT(*) AS employee_count\n\nFROM employees\n\nGROUP BY department_id\n\nHAVING COUNT(*) &gt; 5;\n<\/code><\/pre><\/div><\/p>\n<p>This question tests whether a candidate confuses WHERE and HAVING, one of the most common SQL mistakes Infosys interviewers report seeing from freshers. The rule that separates them: WHERE filters individual rows before grouping; HAVING filters groups after aggregation functions like COUNT, SUM, or AVG have already run.<\/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 deadlock? What are the four conditions that must hold for it to occur?<\/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>Deadlock is a state where two or more processes are permanently blocked, each waiting for a resource held by another.<\/p>\n<p>The four necessary conditions (Coffman conditions): Mutual exclusion (at least one resource is held in a non-shareable mode). Hold and wait (a process holding at least one resource is waiting to acquire additional resources held by others). No preemption (resources cannot be forcibly taken from a process). Circular wait (a cycle exists: P1 waits for a resource held by P2, P2 waits for P3, P3 waits for P1).<\/p>\n<p>Breaking any one condition prevents deadlock. The most common OS exam question that also appears in Infosys Technical rounds: &#8220;How would you prevent deadlock?&#8221; Answer: impose a total ordering on resources (prevents circular wait), or use a timeout with resource release (breaks hold and wait).<\/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\">Explain 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 Infosys interviewer listens for two minutes and then picks a specific technology you mentioned. If you say you built a REST API in Spring Boot, expect &#8220;what is the difference between @RestController and @Controller?&#8221; If you say you used a MySQL database, expect a SQL query question next.<\/p>\n<p>Prepare your project in three parts: one sentence on what problem it solves, one sentence on the tech stack you personally built (not the team), one specific challenge you ran into and how you resolved it. Then prepare two levels deep on every technology you name. If you cannot go two levels deep on something, remove it from your description.<\/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 specific contribution did you make to your team 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>Infosys interviewers in the 2025-2026 cycle, based on candidate reports from GeeksforGeeks and Medium, consistently stop candidates who describe a team project using &#8220;we&#8221; throughout and ask &#8220;what did you specifically build?&#8221; If you cannot answer that clearly, the project discussion typically ends badly.<\/p>\n<p>Prepare a one-paragraph answer about your specific contribution: module, function, or feature name, the lines of code or API endpoints you wrote, and one decision you made that had a visible result. Generic answers like &#8220;I helped the team&#8221; do not pass this question.<\/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\">7<\/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 does this pseudocode output for arr = [3, 7, 1, 9, 2]?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/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 pseudocode shown in Infosys test variants:<\/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\nFunction Mystery(arr):\n\n    result = arr[0]\n\n    FOR i = 1 TO length(arr) \u2013 1:\n\n        IF arr[i] &gt; result THEN\n\n            result = arr[i]\n\n    RETURN result\n<\/code><\/pre><\/div><\/p>\n<p>Answer: 9. The function tracks the running maximum as it scans the array from left to right. When arr[i] = 9 at index 3, 9 > current result (7), so result becomes 9. No later element beats it.<\/p>\n<p>Infosys pseudocode questions often dress up simple algorithms (max-finding, factorial, palindrome check) in generic pseudocode notation. The speed trap: candidates read too carefully looking for a trick. Most questions are testing whether you can trace a simple loop, not whether you can find a subtle bug.<\/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\">Trace this pseudocode and give the final value of count for n = 5.<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/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\"><br \/>\n<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\nFunction CountPairs(n):\n\n    count = 0\n\n    FOR i = 1 TO n:\n\n        FOR j = i + 1 TO n:\n\n            count = count + 1\n\n    RETURN count\n<\/code><\/pre><\/div><\/p>\n<p>Answer: 10. This counts the number of pairs from 1 to n, which equals n*(n-1)\/2 = 5*4\/2 = 10. Tracing the outer loop: i=1, inner j runs from 2 to 5 (4 increments); i=2, j=3 to 5 (3); i=3, j=4 to 5 (2); i=4, j=5 (1). Total: 4+3+2+1 = 10.<\/p>\n<p>Nested loop tracing is one of the most common pseudocode question types Infosys uses. Write out a small trace table on your scratch paper rather than doing it in your head.<\/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\">This pseudocode checks primality. What does IsPrime(21) return, and after how many loop iterations?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">Pseudocode<\/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\"><br \/>\n<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\nFunction IsPrime(n):\n\n    IF n &lt;= 1 THEN RETURN False\n\n    FOR i = 2 TO n \u2013 1:\n\n        IF n MOD i == 0 THEN\n\n            RETURN False\n\n    RETURN True\n<\/code><\/pre><\/div><\/p>\n<p>Answer: False, after 2 iterations. The loop starts at i = 2: 21 MOD 2 = 1, no match, continue. At i = 3: 21 MOD 3 = 0, so the function returns False immediately without checking i = 4 through 20.<\/p>\n<p>Infosys pseudocode questions on primality checking test whether you notice the early return. Several candidates in 2025 GeeksforGeeks write-ups reported picking &#8220;True&#8221; because they assumed the loop always runs to completion before producing a value. It does not, once a divisor turns 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\">A Java service intermittently throws OutOfMemoryError in production, but the heap dump taken right after the crash doesn&#039;t show any unusually large objects or collections. Where would you look next?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">OOM debugging<\/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 first thing I&#8217;d check is whether this is actually a heap problem at all. &#8220;OutOfMemoryError&#8221; gets thrown for several distinct reasons and only one of them is the regular Java heap filling up with live objects. If the heap dump looks clean, I&#8217;d suspect Metaspace exhaustion, native memory pressure, or a thread leak instead.<\/p>\n<p>Metaspace fills up when classes get loaded and never unloaded, which happens a lot with frameworks that generate proxy classes at runtime (Spring AOP, Hibernate, CGLIB) combined with hot redeploys or classloader leaks in application servers. I&#8217;d check with -XX:MaxMetaspaceSize and jcmd VM.native_memory to see if class metadata is growing unbounded across restarts. If it is, the fix is usually finding what&#8217;s holding a reference to an old classloader, often a static field or a thread that outlives the deploy.<\/p>\n<p>If Metaspace looks fine, the next suspect is native memory: direct ByteBuffers used by NIO or by a library doing off-heap caching. These don&#8217;t show up in a heap dump because they live outside the managed heap, but they still count against process memory and can trigger OOM at the OS level or &#8220;Direct buffer memory&#8221; errors. Enabling -XX:NativeMemoryTracking=summary and comparing against `free -m` on the box usually surfaces this quickly. Last, I&#8217;d check for a thread leak, since each thread reserves its own stack (often 512KB-1MB by default), and a connection pool or executor that keeps spawning threads without bounding them can exhaust memory well before the heap itself looks full.<\/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\">A join query across two 50-million-row tables used to run in under a second and now takes 40 seconds, with no schema changes. How would you find and fix the cause?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">query performance<\/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>My first move is always EXPLAIN ANALYZE (or the equivalent execution plan in SQL Server) to compare what the optimizer is actually doing now versus what it used to do. Nine times out of ten, a query that degrades gradually without a schema change is a statistics problem, not a query problem. A large bulk load, a batch delete, or steady daily inserts can shift the row count and value distribution enough that the optimizer&#8217;s cardinality estimates go stale, and it flips from an index seek to a full table scan or picks a bad join order.<\/p>\n<p>So the concrete steps are: check when statistics were last updated, force a stats refresh (ANALYZE in Postgres, UPDATE STATISTICS in SQL Server), and re-run the plan. If that fixes it, the real fix is scheduling more frequent auto-stats or lowering the auto-analyze threshold for that table, not manually running it once and moving on.<\/p>\n<p>If stats aren&#8217;t the issue, I&#8217;d look at index and table bloat next, especially in Postgres where dead tuples from updates\/deletes accumulate until autovacuum catches up, silently degrading index efficiency. I&#8217;d also check for parameter sniffing if this is SQL Server: a cached plan built for a skewed first execution can get reused for very different parameter values and perform badly for everyone else. Recompiling the query or using OPTION (RECOMPILE) on that specific query, rather than globally, is the targeted fix.<\/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 thread-safe, lazily-initialized singleton in Java, and what&#039;s wrong with just marking the getInstance method synchronized?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">singleton 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>Marking the whole getInstance method synchronized works correctly, but it pays the locking cost on every single call forever, even after the instance is created and there&#8217;s nothing left to protect. Under high concurrency that&#8217;s a real bottleneck since every thread serializes on that lock just to read a reference that&#8217;s already been set.<\/p>\n<p>Double-checked locking fixes this by only acquiring the lock the first time, then skipping it on every subsequent call:<\/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 Config {\n\n    private static volatile Config instance;\n    public static Config getInstance() {\n\n        if (instance == null) {\n\n            synchronized (Config.class) {\n\n                if (instance == null) {\n\n                    instance = new Config();\n\n                }\n\n            }\n\n        }\n\n        return instance;\n\n    }\n\n}\n<\/code><\/pre><\/div><\/p>\n<p>The volatile keyword is not optional here. Without it, a thread can see a non-null reference to instance before the constructor&#8217;s writes to its fields have actually been published, because object construction and reference assignment can be reordered under the Java Memory Model. That&#8217;s the classic bug with this pattern when people copy it without understanding why volatile matters.<\/p>\n<p>In practice I&#8217;d usually skip double-checked locking entirely and use the initialization-on-demand holder idiom instead, a static inner class that the JVM guarantees is only loaded (and thus the singleton only created) the first time it&#8217;s referenced, using the class-loading lock instead of a hand-rolled one. It&#8217;s simpler, has no volatile requirement, and is one of the few singleton patterns immune to reflection and serialization attacks if you also make the constructor throw on a second invocation.<\/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 design a rate limiter for an API gateway that needs to enforce per-client limits across multiple service instances handling 50,000 requests per second?<\/span><span class=\"iq-qa__meta\"><span class=\"iq-qa__tag\">rate limiter design<\/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 core problem is that the limit has to be enforced across instances, so you can&#8217;t just keep a counter in memory on each node, that would let a client get N times the limit by hitting N different instances. You need a shared, low-latency store that all instances can hit for every request, which almost always means Redis.<\/p>\n<p>For the algorithm, I&#8217;d lean toward a sliding window counter rather than a fixed window or a strict sliding log. Fixed windows have a boundary problem where a client can burst up to 2x the limit right at the window edge. A sliding log (storing every request timestamp) is accurate but memory-heavy at this volume. A sliding window counter approximates the true sliding window using two fixed windows and a weighted average, which is cheap to compute and close enough in practice. I&#8217;d implement the increment-and-check as a single Lua script executed atomically in Redis, so there&#8217;s no race between the read and the write under concurrent requests.<\/p>\n<p>The harder design question is what happens when Redis itself is slow or unreachable. Fail closed (reject all requests) protects your backend but takes down the whole API on a Redis blip. Fail open (allow all requests) keeps things available but removes protection exactly when you&#8217;re most likely to be under load. In practice I&#8217;d fail open for a short grace period with a circuit breaker, log it loudly, and alert, because a few seconds of unlimited traffic is usually less damaging than a full outage, but that tradeoff should be an explicit decision with the team, not a default.<\/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 Infosys prep sessions run through LastRoundAI, the single biggest gap is candidates who prepare well for the Technical round and then treat the Pseudocode section of the online test as an afterthought. The Pseudocode section gives only 10 minutes for 5 questions, and the difficulty is marked high by PrepInsta and Unstop. Candidates who have never practiced tracing pseudocode on paper typically run out of time on the last 2 questions even if they know the underlying algorithms. Twenty minutes of deliberate pseudocode tracing practice beats two hours of generic aptitude grinding for this specific section.<\/p>\n<p>The second pattern: candidates applying to the SE track who do not realize the coding section score is what determines SP\/DSE eligibility during the same test. You do not reapply to a higher track later. If you do well in aptitude but submit a blank coding section, you get SE. The code quality and test case coverage in those 45 minutes is the primary variable you can control on test day.<\/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\/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><a class=\"iq-rel__card\" href=\"https:\/\/lastroundai.com\/interview-questions\/capgemini\"><span class=\"iq-rel__t\">Capgemini Interview Questions (2026): Online Test, Technical &#038; HR<\/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:\/\/prepinsta.com\/infosys\/recruitment-process\/\" target=\"_blank\" rel=\"nofollow noopener\">PrepInsta Infosys Recruitment Process<\/a><\/li><li><a href=\"https:\/\/unstop.com\/blog\/infosys-recruitment-process\" target=\"_blank\" rel=\"nofollow noopener\">Unstop Infosys Recruitment 2026<\/a><\/li><li><a href=\"https:\/\/unstop.com\/blog\/infosys-pseudocode-question\" target=\"_blank\" rel=\"nofollow noopener\">Unstop Infosys Pseudocode Questions<\/a><\/li><li><a href=\"https:\/\/entri.app\/blog\/infosys-interview-guide\/\" target=\"_blank\" rel=\"nofollow noopener\">Entri Infosys Interview Guide 2026<\/a><\/li><li><a href=\"https:\/\/internshala.com\/blog\/infosys-interview-questions\/\" target=\"_blank\" rel=\"nofollow noopener\">Internshala Infosys Interview Questions 2025<\/a><\/li><li><a href=\"https:\/\/jobrise.io\/en\/blog\/infosys-interview-questions-freshers\/\" target=\"_blank\" rel=\"nofollow noopener\">JobRise Infosys Fresher Interview Questions 2026<\/a><\/li><li><a href=\"https:\/\/medium.com\/@amansahu040805\/my-interview-experience-with-hackwithinfy25-infosys-hiring-result-cleared-2021942f99d9\" target=\"_blank\" rel=\"nofollow noopener\">Medium HackWithInfy 25 Interview Experience<\/a><\/li><li><a href=\"https:\/\/campusmonk.in\/infosys-pseudocode-questions-2025-with-answers-explanation\/\" target=\"_blank\" rel=\"nofollow noopener\">CampusMonk Infosys Pseudocode Questions 2025<\/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 InfyTQ and do I need it to get into Infosys?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"InfyTQ is Infosys's own learning and assessment platform. Clearing the InfyTQ certification above the cutoff qualifies you for the Infosys hiring pipeline directly. You do not need InfyTQ if Infosys is visiting your campus for a direct placement drive. For off-campus candidates and those at colleges without a direct Infosys tie-up, InfyTQ is the primary pathway.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"How many rounds are there in the Infosys hiring process for freshers?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Three rounds: Online Assessment, Technical Interview, and HR Interview. Some candidates at select campuses report a combined Technical+HR panel for the SE track. HackWithInfy adds a second on-site coding round for top 100 finalists before the interview.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"What is the difference between System Engineer, Specialist Programmer, and Power Programmer at Infosys?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"System Engineer (SE) is the base fresher track at Rs. 3.6-4.5 LPA. Specialist Programmer (SP) or Digital Specialist Engineer (DSE) ranges from Rs. 6.25-9.5 LPA and requires strong coding section performance. Power Programmer (PP) goes up to Rs. 21 LPA and is primarily reached through HackWithInfy.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"Does Infosys have a service bond?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Infosys requires freshers to sign a service agreement, typically 1-2 years from the date of joining. Candidates who leave before the bond period ends may be required to pay back training costs. The specific penalty amount and bond duration are stated in your offer letter and can vary by batch and role track.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"What coding language should I use in the InfyTQ coding section?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"Python 3 is the most practical choice for most candidates. The InfyTQ platform supports Python, Java, and C++. Unlike TCS iON, the input format on InfyTQ follows standard competitive programming conventions, so your practice on HackerRank or LeetCode transfers directly.\"\n      }\n    },\n    {\n      \"@type\": \"Question\",\n      \"name\": \"How long does the Infosys hiring process take from online test to offer letter?\",\n      \"acceptedAnswer\": {\n        \"@type\": \"Answer\",\n        \"text\": \"For campus placement drives, the turnaround is typically 1-3 weeks from online test to offer letter. Off-campus and InfyTQ pathway candidates report a longer timeline of 4-8 weeks. Some candidates in the 2025-2026 cycle reported waiting up to 10 weeks between the Technical interview and the final offer for SP and DSE tracks.\"\n      }\n    }\n  ]\n}\n<\/script><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Updated June 2026 Infosys runs one of India&#8217;s largest campus hiring cycles, bringing in tens of thousands of freshers each year across its System Engineer, Specialist Programmer, and Power Programmer tracks. The gap between those three starting points is not small: a Power Programmer earns roughly 3 to 6 times what a System Engineer earns&#8230;<\/p>\n","protected":false},"author":3,"featured_media":1720,"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-973","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>Infosys Interview Questions 2026 | LastRoundAI<\/title>\n<meta name=\"description\" content=\"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP 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\/infosys\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Infosys Interview Questions 2026 | LastRoundAI\" \/>\n<meta property=\"og:description\" content=\"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP tracks.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/lastroundai.com\/interview-questions\/infosys\" \/>\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-infosys-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<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys\",\"name\":\"Infosys Interview Questions 2026 | LastRoundAI\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-infosys-og.png\",\"datePublished\":\"2026-06-30T02:48:45+00:00\",\"dateModified\":\"2026-07-19T05:24:09+00:00\",\"description\":\"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP tracks.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys#primaryimage\",\"url\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-infosys-og.png\",\"contentUrl\":\"https:\\\/\\\/lastroundai.com\\\/blog\\\/wp-content\\\/uploads\\\/2026\\\/07\\\/iq-infosys-og.png\",\"width\":1200,\"height\":630,\"caption\":\"Infosys interview questions \u2014 LastRoundAI\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/lastroundai.com\\\/interview-questions\\\/infosys#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\":\"Infosys Interview Questions (2026): Online Test, Technical &#038; HR Rounds\"}]},{\"@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":"Infosys Interview Questions 2026 | LastRoundAI","description":"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP 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\/infosys","og_locale":"en_US","og_type":"article","og_title":"Infosys Interview Questions 2026 | LastRoundAI","og_description":"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP tracks.","og_url":"https:\/\/lastroundai.com\/interview-questions\/infosys","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-infosys-og.png","type":"image\/png"}],"twitter_card":"summary_large_image","schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/lastroundai.com\/interview-questions\/infosys","url":"https:\/\/lastroundai.com\/interview-questions\/infosys","name":"Infosys Interview Questions 2026 | LastRoundAI","isPartOf":{"@id":"https:\/\/lastroundai.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/lastroundai.com\/interview-questions\/infosys#primaryimage"},"image":{"@id":"https:\/\/lastroundai.com\/interview-questions\/infosys#primaryimage"},"thumbnailUrl":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-infosys-og.png","datePublished":"2026-06-30T02:48:45+00:00","dateModified":"2026-07-19T05:24:09+00:00","description":"Real Infosys interview questions for 2026: pseudocode, aptitude, Technical (OOP, DBMS, SQL, DSA), and HR rounds. Covers SE, SP, DSE, and PP tracks.","breadcrumb":{"@id":"https:\/\/lastroundai.com\/interview-questions\/infosys#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/lastroundai.com\/interview-questions\/infosys"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/lastroundai.com\/interview-questions\/infosys#primaryimage","url":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-infosys-og.png","contentUrl":"https:\/\/lastroundai.com\/blog\/wp-content\/uploads\/2026\/07\/iq-infosys-og.png","width":1200,"height":630,"caption":"Infosys interview questions \u2014 LastRoundAI"},{"@type":"BreadcrumbList","@id":"https:\/\/lastroundai.com\/interview-questions\/infosys#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":"Infosys Interview Questions (2026): Online Test, Technical &#038; HR Rounds"}]},{"@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\/973","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\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/comments?post=973"}],"version-history":[{"count":4,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq\/973\/revisions"}],"predecessor-version":[{"id":1843,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/iq\/973\/revisions\/1843"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/media\/1720"}],"wp:attachment":[{"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/media?parent=973"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lastroundai.com\/blog\/wp-json\/wp\/v2\/tags?post=973"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}