<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Brevis Dewald</title>
    <description>The latest articles on DEV Community by Brevis Dewald (@brevis_dewald_c67c3dedbf7).</description>
    <link>https://dev.to/brevis_dewald_c67c3dedbf7</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4236606%2Fb8d7ab72-655f-4fc4-8b65-38c1d925abf4.png</url>
      <title>DEV Community: Brevis Dewald</title>
      <link>https://dev.to/brevis_dewald_c67c3dedbf7</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/brevis_dewald_c67c3dedbf7"/>
    <language>en</language>
    <item>
      <title>Infosys Interview Questions for Freshers (2026): Test Pattern, SE vs DSE vs SP, Technical, Coding and HR</title>
      <dc:creator>Brevis Dewald</dc:creator>
      <pubDate>Tue, 10 Nov 2026 09:50:04 +0000</pubDate>
      <link>https://dev.to/brevis_dewald_c67c3dedbf7/infosys-interview-questions-for-freshers-2026-test-pattern-se-vs-dse-vs-sp-technical-coding-1lmn</link>
      <guid>https://dev.to/brevis_dewald_c67c3dedbf7/infosys-interview-questions-for-freshers-2026-test-pattern-se-vs-dse-vs-sp-technical-coding-1lmn</guid>
      <description>&lt;p&gt;Infosys hires thousands of freshers every year through campus drives, off-campus drives and HackWithInfy. The process is short, usually an online test followed by one or two interviews, but the online test filters out a lot of people. This post covers the test pattern, the three roles, and the questions freshers report most often, with short answers you can adapt.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Infosys hiring process
&lt;/h2&gt;

&lt;p&gt;For most freshers the process is:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;&lt;strong&gt;Online assessment&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Technical interview&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;HR interview&lt;/strong&gt; (sometimes combined with the technical round)&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Online test pattern (2026)
&lt;/h3&gt;

&lt;p&gt;PrepInsta reports this pattern for 2026, and notes that the test is adaptive, so the exact mix can change:&lt;/p&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;Section&lt;/th&gt;
&lt;th&gt;Questions&lt;/th&gt;
&lt;th&gt;Time&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;Mathematical Ability&lt;/td&gt;
&lt;td&gt;10&lt;/td&gt;
&lt;td&gt;35 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Analytical Reasoning&lt;/td&gt;
&lt;td&gt;15&lt;/td&gt;
&lt;td&gt;25 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Verbal Ability&lt;/td&gt;
&lt;td&gt;20&lt;/td&gt;
&lt;td&gt;20 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Pseudo Code&lt;/td&gt;
&lt;td&gt;5&lt;/td&gt;
&lt;td&gt;10 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Puzzle Solving&lt;/td&gt;
&lt;td&gt;4&lt;/td&gt;
&lt;td&gt;10 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;English Grammar&lt;/td&gt;
&lt;td&gt;5&lt;/td&gt;
&lt;td&gt;10 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;English Writing&lt;/td&gt;
&lt;td&gt;1&lt;/td&gt;
&lt;td&gt;10 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;strong&gt;Total&lt;/strong&gt;&lt;/td&gt;
&lt;td&gt;&lt;strong&gt;60&lt;/strong&gt;&lt;/td&gt;
&lt;td&gt;&lt;strong&gt;120 min&lt;/strong&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;p&gt;Candidates for the higher roles usually get an extra coding section with about three problems of rising difficulty.&lt;/p&gt;

&lt;h3&gt;
  
  
  The three fresher roles
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Systems Engineer (SE)&lt;/strong&gt;: the main fresher role. Reported package around ₹3.6 to 4.2 LPA.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Digital Specialist Engineer (DSE)&lt;/strong&gt;: needs a stronger coding performance. Reported around ₹6.25 LPA.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Specialist Programmer (SP)&lt;/strong&gt;: the top coding track. Reported around ₹9.5 LPA and above.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Packages change every year, so check the official Infosys careers page or your drive email for current figures.&lt;/p&gt;

&lt;h2&gt;
  
  
  Technical round questions
&lt;/h2&gt;

&lt;p&gt;The technical round usually starts with "tell me about your project" and then moves to one language, OOP, data structures and SQL.&lt;/p&gt;

&lt;h3&gt;
  
  
  1. What is the difference between a class and an object?
&lt;/h3&gt;

&lt;p&gt;A &lt;strong&gt;class&lt;/strong&gt; is a blueprint that defines data and behaviour. An &lt;strong&gt;object&lt;/strong&gt; is an instance of that class with real values in memory. &lt;code&gt;Car&lt;/code&gt; is a class; &lt;code&gt;myCar = Car("red")&lt;/code&gt; is an object.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. Abstract class vs interface (Java)
&lt;/h3&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;&lt;/th&gt;
&lt;th&gt;Abstract class&lt;/th&gt;
&lt;th&gt;Interface&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;Methods&lt;/td&gt;
&lt;td&gt;Can have abstract and concrete methods&lt;/td&gt;
&lt;td&gt;Abstract by default; &lt;code&gt;default&lt;/code&gt; and &lt;code&gt;static&lt;/code&gt; methods allowed since Java 8&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Variables&lt;/td&gt;
&lt;td&gt;Any type&lt;/td&gt;
&lt;td&gt;Only &lt;code&gt;public static final&lt;/code&gt; constants&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Inheritance&lt;/td&gt;
&lt;td&gt;A class extends only one&lt;/td&gt;
&lt;td&gt;A class can implement many&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Constructor&lt;/td&gt;
&lt;td&gt;Allowed&lt;/td&gt;
&lt;td&gt;Not allowed&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;p&gt;Use an abstract class when classes share code. Use an interface when unrelated classes must follow the same contract.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. What does &lt;code&gt;static&lt;/code&gt; mean in Java?
&lt;/h3&gt;

&lt;p&gt;A &lt;code&gt;static&lt;/code&gt; member belongs to the class, not to any object. All objects share one copy. Static methods can be called without creating an object, which is why &lt;code&gt;main&lt;/code&gt; is static. A static method cannot use &lt;code&gt;this&lt;/code&gt; or non-static fields directly.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. What is garbage collection in Java?
&lt;/h3&gt;

&lt;p&gt;The JVM automatically frees memory used by objects that no longer have any reference. You do not call &lt;code&gt;free()&lt;/code&gt; like in C. You can request it with &lt;code&gt;System.gc()&lt;/code&gt;, but the JVM decides when it actually runs.&lt;/p&gt;

&lt;h3&gt;
  
  
  5. What is a lambda function in Python?
&lt;/h3&gt;

&lt;p&gt;A small anonymous function written in one line.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;square&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;lambda&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;
&lt;span class="n"&gt;nums&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="k"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nb"&gt;sorted&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;nums&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;key&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="k"&gt;lambda&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;  &lt;span class="c1"&gt;# [3, 2, 1]&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  6. Stack vs queue
&lt;/h3&gt;

&lt;p&gt;A &lt;strong&gt;stack&lt;/strong&gt; is LIFO (last in, first out), like a pile of plates. A &lt;strong&gt;queue&lt;/strong&gt; is FIFO (first in, first out), like a ticket line. Browser back history uses a stack; a printer job list uses a queue.&lt;/p&gt;

&lt;h3&gt;
  
  
  7. What is a binary search tree?
&lt;/h3&gt;

&lt;p&gt;A binary tree where every node's left subtree has smaller values and the right subtree has larger values. Search, insert and delete take O(log n) on a balanced tree, but can drop to O(n) if the tree becomes skewed.&lt;/p&gt;

&lt;h3&gt;
  
  
  8. What is hashing?
&lt;/h3&gt;

&lt;p&gt;Hashing maps a key to an index using a hash function, so lookups take O(1) on average. Python dictionaries and Java &lt;code&gt;HashMap&lt;/code&gt; use it. When two keys map to the same index, it is a &lt;strong&gt;collision&lt;/strong&gt;, handled by chaining or open addressing.&lt;/p&gt;

&lt;h3&gt;
  
  
  9. What is the time complexity of binary search?
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;O(log n)&lt;/strong&gt;, because each step halves the search space. It only works on sorted data.&lt;/p&gt;

&lt;h3&gt;
  
  
  10. WHERE vs HAVING in SQL
&lt;/h3&gt;

&lt;p&gt;&lt;code&gt;WHERE&lt;/code&gt; filters rows &lt;strong&gt;before&lt;/strong&gt; grouping. &lt;code&gt;HAVING&lt;/code&gt; filters groups &lt;strong&gt;after&lt;/strong&gt; &lt;code&gt;GROUP BY&lt;/code&gt;, so it can use aggregates like &lt;code&gt;COUNT()&lt;/code&gt;.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight sql"&gt;&lt;code&gt;&lt;span class="k"&gt;SELECT&lt;/span&gt; &lt;span class="n"&gt;department&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nb"&gt;COUNT&lt;/span&gt;&lt;span class="cm"&gt;(*) AS employees
FROM staff
WHERE status = 'active'
GROUP BY department
HAVING COUNT(*)&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  11. What is a view and what is an index?
&lt;/h3&gt;

&lt;p&gt;A &lt;strong&gt;view&lt;/strong&gt; is a saved query that behaves like a virtual table; it stores no data itself. An &lt;strong&gt;index&lt;/strong&gt; is a separate structure that speeds up searches on a column, at the cost of extra storage and slower inserts.&lt;/p&gt;

&lt;h2&gt;
  
  
  Coding questions
&lt;/h2&gt;

&lt;p&gt;Write clean code, explain the time complexity, and test with one edge case out loud.&lt;/p&gt;

&lt;h3&gt;
  
  
  Check an Armstrong number
&lt;/h3&gt;

&lt;p&gt;A number equal to the sum of its digits each raised to the number of digits (153 = 1³ + 5³ + 3³).&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;is_armstrong&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;digits&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="kt"&gt;str&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="n"&gt;power&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;len&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;digits&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;d&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;**&lt;/span&gt; &lt;span class="n"&gt;power&lt;/span&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;d&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="n"&gt;digits&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  Sum of digits
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;digit_sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;abs&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="n"&gt;total&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
    &lt;span class="k"&gt;while&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;total&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt;
        &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;//=&lt;/span&gt; &lt;span class="mi"&gt;10&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;total&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  Check if two strings are anagrams
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;from&lt;/span&gt; &lt;span class="n"&gt;collections&lt;/span&gt; &lt;span class="k"&gt;import&lt;/span&gt; &lt;span class="nc"&gt;Counter&lt;/span&gt;

&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;is_anagram&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;replace&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;" "&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="s2"&gt;""&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;lower&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;replace&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;" "&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="s2"&gt;""&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;lower&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nc"&gt;Counter&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="nc"&gt;Counter&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  Rotate an array by k positions (right)
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;rotate_right&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;k&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="ow"&gt;not&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;
    &lt;span class="n"&gt;k&lt;/span&gt; &lt;span class="o"&gt;%=&lt;/span&gt; &lt;span class="nb"&gt;len&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;k&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="n"&gt;k&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Mention the &lt;code&gt;k %= len(arr)&lt;/code&gt; step. It handles k larger than the array, which is the edge case interviewers look for.&lt;/p&gt;

&lt;h3&gt;
  
  
  Longest substring without repeating characters (SP level)
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;longest_unique_substring&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;last_seen&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="n"&gt;start&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;best&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;enumerate&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="n"&gt;last_seen&lt;/span&gt; &lt;span class="ow"&gt;and&lt;/span&gt; &lt;span class="n"&gt;last_seen&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="n"&gt;start&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;start&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;last_seen&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
        &lt;span class="n"&gt;last_seen&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;
        &lt;span class="n"&gt;best&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;max&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;best&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;start&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;best&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This is the sliding-window approach, O(n) time.&lt;/p&gt;

&lt;h3&gt;
  
  
  Ways to climb n stairs with 1 or 2 steps (SP level)
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;climb_stairs&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;_&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;The answer follows the Fibonacci pattern: ways(n) = ways(n-1) + ways(n-2).&lt;/p&gt;

&lt;h2&gt;
  
  
  HR round questions
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Tell me about yourself.&lt;/strong&gt; Education, your best project in two lines, one strength with an example, and why Infosys. Keep it near 90 seconds.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Why Infosys?&lt;/strong&gt; Mention its training for freshers at the Mysuru campus, the range of client projects, and what you want to build there, in your own words.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;What do you know about Infosys?&lt;/strong&gt; Founded in 1981, headquartered in Bengaluru, one of India's largest IT services companies. Read the latest annual highlights before the interview.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Are you willing to relocate and work in shifts?&lt;/strong&gt; Answer honestly; it affects your posting.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;What are your strengths and weaknesses?&lt;/strong&gt; Pick a real weakness and say what you are doing about it.&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Final tips
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Practice pseudocode output questions. Many candidates lose marks there, not in maths.&lt;/li&gt;
&lt;li&gt;For the English writing section, write short, clear sentences and check grammar before submitting.&lt;/li&gt;
&lt;li&gt;Rehearse your project explanation out loud until you can do it in two minutes without notes.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;If you want to practise answering these out loud with timed feedback, &lt;a href="https://www.way2ask.ai" rel="noopener noreferrer"&gt;AI mock interview practice&lt;/a&gt; can help you spot weak answers before the real round.&lt;/p&gt;

&lt;p&gt;All the best for your Infosys interview!&lt;/p&gt;




&lt;p&gt;&lt;em&gt;Sources: online test pattern as reported by &lt;a href="https://prepinsta.com/infosys/recruitment-process/" rel="noopener noreferrer"&gt;PrepInsta&lt;/a&gt;; roles, packages and common questions compiled from &lt;a href="https://www.weekday.works/post/infosys-interview-questions" rel="noopener noreferrer"&gt;Weekday&lt;/a&gt; and candidate reports. Check official Infosys communication for the latest pattern.&lt;/em&gt;&lt;/p&gt;

</description>
      <category>career</category>
      <category>interview</category>
      <category>programming</category>
      <category>beginners</category>
    </item>
    <item>
      <title>TCS Interview Questions for Freshers (2026): NQT Pattern, Technical, Coding and HR Rounds</title>
      <dc:creator>Brevis Dewald</dc:creator>
      <pubDate>Tue, 10 Nov 2026 08:20:41 +0000</pubDate>
      <link>https://dev.to/brevis_dewald_c67c3dedbf7/tcs-interview-questions-for-freshers-2026-nqt-pattern-technical-coding-and-hr-rounds-5aj7</link>
      <guid>https://dev.to/brevis_dewald_c67c3dedbf7/tcs-interview-questions-for-freshers-2026-nqt-pattern-technical-coding-and-hr-rounds-5aj7</guid>
      <description>&lt;p&gt;TCS hires more freshers than almost any company in India, and the process is predictable once you know how it works. This post covers the NQT exam pattern, the three tracks, and the questions that come up again and again in the technical, managerial and HR rounds, with short answers you can adapt.&lt;/p&gt;

&lt;h2&gt;
  
  
  How the TCS hiring process works
&lt;/h2&gt;

&lt;p&gt;The process has two stages: the &lt;strong&gt;National Qualifier Test (NQT)&lt;/strong&gt; and the &lt;strong&gt;interview&lt;/strong&gt;.&lt;/p&gt;

&lt;h3&gt;
  
  
  TCS NQT pattern (2026)
&lt;/h3&gt;

&lt;p&gt;The NQT is one integrated test of about 190 minutes with two parts, as reported by FACE Prep citing TCS's FAQ:&lt;/p&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;Part&lt;/th&gt;
&lt;th&gt;Section&lt;/th&gt;
&lt;th&gt;Questions&lt;/th&gt;
&lt;th&gt;Time&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;Foundation&lt;/td&gt;
&lt;td&gt;Numerical Ability&lt;/td&gt;
&lt;td&gt;20&lt;/td&gt;
&lt;td&gt;25 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Foundation&lt;/td&gt;
&lt;td&gt;Verbal Ability&lt;/td&gt;
&lt;td&gt;25&lt;/td&gt;
&lt;td&gt;25 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Foundation&lt;/td&gt;
&lt;td&gt;Reasoning Ability&lt;/td&gt;
&lt;td&gt;20&lt;/td&gt;
&lt;td&gt;25 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Advanced&lt;/td&gt;
&lt;td&gt;Advanced Quant + Reasoning&lt;/td&gt;
&lt;td&gt;15&lt;/td&gt;
&lt;td&gt;25 min&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Advanced&lt;/td&gt;
&lt;td&gt;Advanced Coding&lt;/td&gt;
&lt;td&gt;3 problems&lt;/td&gt;
&lt;td&gt;90 min&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;ul&gt;
&lt;li&gt;There is &lt;strong&gt;no negative marking&lt;/strong&gt;, so attempt every question.&lt;/li&gt;
&lt;li&gt;Coding can be done in C, C++, Java, Python or C#.&lt;/li&gt;
&lt;li&gt;Foundation is the elimination stage. If you miss its cut-off, the Advanced score does not count.&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  The three tracks
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Ninja&lt;/strong&gt;: decided by the Foundation section. Reported starting CTC around ₹3.5 to 3.9 LPA.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Digital&lt;/strong&gt;: needs a strong score in both parts. Reported CTC around ₹7 to 7.5 LPA.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Prime&lt;/strong&gt;: for the top NQT scorers. Reported CTC around ₹9 to 11 LPA.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Package figures change from year to year, so confirm them on the official TCS NextStep portal before you plan around them.&lt;/p&gt;

&lt;h3&gt;
  
  
  The interview rounds
&lt;/h3&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Technical Round (TR)&lt;/strong&gt;: your projects, one programming language, DBMS, OS, networking and simple coding.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Managerial Round (MR)&lt;/strong&gt;: mostly for Digital and Prime. Situational questions about teamwork, deadlines and problem solving.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;HR Round&lt;/strong&gt;: relocation, shifts, the service agreement and documents.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;Some candidates get TR, MR and HR in a single sitting with two or three panelists.&lt;/p&gt;

&lt;h2&gt;
  
  
  Technical round questions
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. What are the four pillars of OOP?
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Encapsulation&lt;/strong&gt;: keeping data and the methods that use it together, and hiding internal state behind methods.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Abstraction&lt;/strong&gt;: showing only what an object does, not how it does it.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Inheritance&lt;/strong&gt;: a class reusing the properties and methods of another class.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Polymorphism&lt;/strong&gt;: the same method name behaving differently depending on the object.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Tip: give one example from your own project for each. Interviewers remember examples, not definitions.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. What is the difference between method overloading and overriding?
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Overloading&lt;/strong&gt; is the same method name with different parameters in the same class. It is resolved at compile time.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Overriding&lt;/strong&gt; is a subclass giving its own version of a parent method with the same signature. It is resolved at runtime.
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="k"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;Shape&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kt"&gt;double&lt;/span&gt; &lt;span class="nf"&gt;area&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="k"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;Circle&lt;/span&gt; &lt;span class="k"&gt;extends&lt;/span&gt; &lt;span class="nc"&gt;Shape&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kt"&gt;double&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="nc"&gt;Circle&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;double&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;this&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;r&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="nd"&gt;@Override&lt;/span&gt;
    &lt;span class="kt"&gt;double&lt;/span&gt; &lt;span class="nf"&gt;area&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nc"&gt;Math&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="no"&gt;PI&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;   &lt;span class="c1"&gt;// overriding&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="k"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;Calc&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;add&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;            &lt;span class="c1"&gt;// overloading&lt;/span&gt;
    &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;add&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;c&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;c&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  3. Why is Java platform independent?
&lt;/h3&gt;

&lt;p&gt;Java code compiles to &lt;strong&gt;bytecode&lt;/strong&gt;, not machine code. The &lt;strong&gt;JVM&lt;/strong&gt; on each operating system runs that bytecode, so the same &lt;code&gt;.class&lt;/code&gt; file runs on Windows, Linux or macOS. Java itself is platform independent, but each JVM is platform specific.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. What is the difference between &lt;code&gt;==&lt;/code&gt; and &lt;code&gt;.equals()&lt;/code&gt; in Java?
&lt;/h3&gt;

&lt;p&gt;&lt;code&gt;==&lt;/code&gt; compares references (whether two variables point to the same object). &lt;code&gt;.equals()&lt;/code&gt; compares content, if the class overrides it, as &lt;code&gt;String&lt;/code&gt; does.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;String&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="kt"&gt;String&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"tcs"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="kt"&gt;String&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="kt"&gt;String&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"tcs"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="nc"&gt;System&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;out&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nb"&gt;println&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;       &lt;span class="c1"&gt;// false&lt;/span&gt;
&lt;span class="nc"&gt;System&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;out&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nb"&gt;println&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;equals&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;  &lt;span class="c1"&gt;// true&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  5. Array vs linked list
&lt;/h3&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;&lt;/th&gt;
&lt;th&gt;Array&lt;/th&gt;
&lt;th&gt;Linked list&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;Memory&lt;/td&gt;
&lt;td&gt;Contiguous&lt;/td&gt;
&lt;td&gt;Nodes anywhere, linked by pointers&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Access by index&lt;/td&gt;
&lt;td&gt;O(1)&lt;/td&gt;
&lt;td&gt;O(n)&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Insert or delete in middle&lt;/td&gt;
&lt;td&gt;O(n)&lt;/td&gt;
&lt;td&gt;O(1) once you have the node&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Size&lt;/td&gt;
&lt;td&gt;Fixed (static arrays)&lt;/td&gt;
&lt;td&gt;Grows as needed&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;h3&gt;
  
  
  6. List vs tuple in Python
&lt;/h3&gt;

&lt;p&gt;A &lt;strong&gt;list&lt;/strong&gt; is mutable and uses square brackets. A &lt;strong&gt;tuple&lt;/strong&gt; is immutable and uses round brackets. Tuples are slightly faster and can be used as dictionary keys; lists cannot.&lt;/p&gt;

&lt;h3&gt;
  
  
  7. What is normalization?
&lt;/h3&gt;

&lt;p&gt;Normalization organizes tables to reduce duplicate data and avoid update problems.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;1NF&lt;/strong&gt;: each column holds a single value, no repeating groups.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;2NF&lt;/strong&gt;: 1NF, and every non-key column depends on the whole primary key.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;3NF&lt;/strong&gt;: 2NF, and no non-key column depends on another non-key column.&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  8. DELETE vs TRUNCATE vs DROP
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;DELETE&lt;/strong&gt; removes selected rows, can use &lt;code&gt;WHERE&lt;/code&gt;, and can be rolled back in a transaction.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;TRUNCATE&lt;/strong&gt; removes all rows quickly and keeps the table structure.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;DROP&lt;/strong&gt; removes the whole table, including its structure.&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  9. Write a query for the second-highest salary
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight sql"&gt;&lt;code&gt;&lt;span class="k"&gt;SELECT&lt;/span&gt; &lt;span class="nb"&gt;MAX&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;salary&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;AS&lt;/span&gt; &lt;span class="n"&gt;second_highest&lt;/span&gt;
&lt;span class="k"&gt;FROM&lt;/span&gt; &lt;span class="n"&gt;employees&lt;/span&gt;
&lt;span class="k"&gt;WHERE&lt;/span&gt; &lt;span class="n"&gt;salary&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;SELECT&lt;/span&gt; &lt;span class="nb"&gt;MAX&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;salary&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;FROM&lt;/span&gt; &lt;span class="n"&gt;employees&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Be ready to explain an alternative with &lt;code&gt;DENSE_RANK()&lt;/code&gt; too, since some panels ask for the Nth highest.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight sql"&gt;&lt;code&gt;&lt;span class="k"&gt;SELECT&lt;/span&gt; &lt;span class="n"&gt;salary&lt;/span&gt;
&lt;span class="k"&gt;FROM&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;
  &lt;span class="k"&gt;SELECT&lt;/span&gt; &lt;span class="n"&gt;salary&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nb"&gt;DENSE_RANK&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;OVER&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;ORDER&lt;/span&gt; &lt;span class="k"&gt;BY&lt;/span&gt; &lt;span class="n"&gt;salary&lt;/span&gt; &lt;span class="k"&gt;DESC&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;AS&lt;/span&gt; &lt;span class="n"&gt;rnk&lt;/span&gt;
  &lt;span class="k"&gt;FROM&lt;/span&gt; &lt;span class="n"&gt;employees&lt;/span&gt;
&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="n"&gt;t&lt;/span&gt;
&lt;span class="k"&gt;WHERE&lt;/span&gt; &lt;span class="n"&gt;rnk&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  10. What are ACID properties?
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Atomicity&lt;/strong&gt;: a transaction happens completely or not at all.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Consistency&lt;/strong&gt;: the database moves from one valid state to another.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Isolation&lt;/strong&gt;: transactions running together do not interfere.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Durability&lt;/strong&gt;: once committed, data survives a crash.&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  11. Process vs thread
&lt;/h3&gt;

&lt;p&gt;A &lt;strong&gt;process&lt;/strong&gt; is a running program with its own memory space. A &lt;strong&gt;thread&lt;/strong&gt; is a smaller unit inside a process and shares that process's memory. Switching between threads is cheaper than switching between processes.&lt;/p&gt;

&lt;h3&gt;
  
  
  12. What is a deadlock?
&lt;/h3&gt;

&lt;p&gt;A deadlock is when two or more processes wait for each other's resources forever. It needs four conditions at once: &lt;strong&gt;mutual exclusion, hold and wait, no preemption, and circular wait&lt;/strong&gt;. Breaking any one of them prevents it.&lt;/p&gt;

&lt;h3&gt;
  
  
  13. TCP vs UDP
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;TCP&lt;/strong&gt; is connection oriented and guarantees ordered delivery (used for web pages, email). &lt;strong&gt;UDP&lt;/strong&gt; is connectionless and faster but does not guarantee delivery (used for video calls, gaming, DNS).&lt;/p&gt;

&lt;h2&gt;
  
  
  Coding questions asked in TCS interviews
&lt;/h2&gt;

&lt;p&gt;These are simple on purpose. The panel watches how you think, name variables and handle edge cases. Talk through your approach before you write.&lt;/p&gt;

&lt;h3&gt;
  
  
  Check if a number is prime
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;is_prime&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;False&lt;/span&gt;
    &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;
    &lt;span class="k"&gt;while&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;False&lt;/span&gt;
        &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;True&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Mention why you stop at the square root: if &lt;code&gt;n&lt;/code&gt; has a factor larger than √n, it must also have one smaller than √n.&lt;/p&gt;

&lt;h3&gt;
  
  
  Check if a string is a palindrome
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;is_palindrome&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s2"&gt;""&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;join&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;lower&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;isalnum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="o"&gt;::-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  Find the second-largest element in an array
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;second_largest&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;first&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;second&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="kt"&gt;float&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"-inf"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="n"&gt;arr&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="n"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;first&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;second&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;first&lt;/span&gt;
        &lt;span class="k"&gt;elif&lt;/span&gt; &lt;span class="n"&gt;first&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="n"&gt;second&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;second&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;second&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;second&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="kt"&gt;float&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"-inf"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="kc"&gt;None&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This is one pass, O(n), and handles duplicates of the largest value.&lt;/p&gt;

&lt;h3&gt;
  
  
  Swap two numbers without a third variable
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;9&lt;/span&gt;
&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
&lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;In Python you can also write &lt;code&gt;a, b = b, a&lt;/code&gt;, but show the arithmetic version if they ask for the logic.&lt;/p&gt;

&lt;h3&gt;
  
  
  Fibonacci series up to n terms
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;fibonacci&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="n"&gt;result&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;_&lt;/span&gt; &lt;span class="k"&gt;in&lt;/span&gt; &lt;span class="nb"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;result&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;append&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
        &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;b&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;result&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  Managerial round questions
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Tell me about a time you missed a deadline. What did you do?&lt;/li&gt;
&lt;li&gt;Your teammate is not doing their share. How do you handle it?&lt;/li&gt;
&lt;li&gt;A client asks for a change one day before delivery. What do you do?&lt;/li&gt;
&lt;li&gt;Which project are you most proud of, and what was your exact role?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Use the &lt;strong&gt;STAR&lt;/strong&gt; structure: Situation, Task, Action, Result. Keep each answer under two minutes and end with what you would do differently.&lt;/p&gt;

&lt;h2&gt;
  
  
  HR round questions
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Tell me about yourself.&lt;/strong&gt; Education, one or two projects, one strength, and why TCS. About 90 seconds.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Why TCS?&lt;/strong&gt; Mention scale of projects, training programs for freshers, and the variety of domains, in your own words.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Are you willing to relocate?&lt;/strong&gt; TCS places freshers across India. Answer honestly.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Are you comfortable with rotational shifts?&lt;/strong&gt; Same: be honest, since this affects your posting.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Where do you see yourself in five years?&lt;/strong&gt; Show growth inside the company, not a plan to leave.&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Final tips
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Revise &lt;strong&gt;one&lt;/strong&gt; language deeply instead of three languages lightly.&lt;/li&gt;
&lt;li&gt;Know every line of your final-year project. Most TR questions start there.&lt;/li&gt;
&lt;li&gt;Practice speaking your answers out loud, not just reading them. Many freshers know the answer but freeze when they have to say it.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;If you want to rehearse these questions out loud before the real interview, &lt;a href="https://www.way2ask.ai" rel="noopener noreferrer"&gt;AI mock interview practice&lt;/a&gt; can help you get used to answering under time pressure and see where your answers need work.&lt;/p&gt;

&lt;p&gt;All the best for your TCS interview!&lt;/p&gt;




&lt;p&gt;&lt;em&gt;Sources: TCS NQT pattern and track details as reported by &lt;a href="https://www.faceprep.in/article/tcs-exam-pattern/" rel="noopener noreferrer"&gt;FACE Prep&lt;/a&gt;; round structure and common questions compiled from &lt;a href="https://www.weekday.works/post/tcs-interview-questions" rel="noopener noreferrer"&gt;Weekday&lt;/a&gt; and candidate reports. Check the official TCS NextStep portal for the latest pattern.&lt;/em&gt;&lt;/p&gt;

</description>
      <category>career</category>
      <category>interview</category>
      <category>programming</category>
      <category>beginners</category>
    </item>
  </channel>
</rss>
