TCS Prime Interview Questions 2026: 30 Questions with Answers, and What Changes vs Digital and Ninja

TCS Prime is the top profile in TCS fresher hiring, and its interview is where "I cleared the NQT" stops mattering. This page is for candidates with a Prime shortlist or aiming for one: the 2026 process, how the Prime interview differs from Digital and Ninja, and 30 questions with sample answers at the level a Prime panel actually asks.

If you are preparing for Ninja, use the TCS Ninja page instead. Prime panels assume you can code and start from there.

How TCS Prime hiring works in 2026

As of September 2026, TCS fresher hiring runs through a single integrated National Qualifier Test (NQT), and the same test feeds all three profiles: Ninja, Digital and Prime. There is no separate Prime exam.

The test. Placement-site breakdowns of the 2026 pattern describe an 83-question, 190-minute test. Part A (Foundation): Numerical (20 questions, 25 minutes), Verbal (25, 25 minutes), Reasoning (20, 25 minutes). Part B (Advanced): about 15 advanced quantitative and reasoning questions in 25 minutes, and two to three coding problems in 90 minutes. Part B, above all the coding, decides whether you are called for Digital or Prime.

Cut-offs. TCS publishes no score, percentile or section hurdle for any profile. Anyone quoting an exact Prime cut-off is guessing.

Eligibility. B.E./B.Tech/M.E./M.Tech/MCA/M.Sc in the listed streams, a minimum of 60 percent aggregate across Class X, Class XII and graduation, no active backlogs, and at most a one-year gap. The same criteria apply to all three profiles.

Interviews by profile. Ninja shortlists mostly get an HR interview, sometimes with a technical component. Digital gets a technical round plus HR. Prime typically gets two technical rounds plus HR, on the same day on campus and in separate video slots off campus.

Compensation. TCS does not publish CTC on the NQT page. Candidate-reported figures compiled by PapersAdda (revised 3 September 2026) put Ninja at about 3.36 to 3.6 LPA, Digital at about 7 LPA and Prime at roughly 9.17 to 11.5 LPA; the article flags them as unverified. Confirm with your placement cell.

Downgrades. A Prime shortlist is not a Prime offer; a weak interview regularly ends in a Digital or Ninja offer instead.

What changes between Ninja, Digital and Prime

The difference is not the topics; it is the follow-up. A Digital interviewer asks what an index is. A Prime interviewer asks when it slows a write and what you would do if the planner ignored it.

What the TCS Prime interviewer is testing

• Can you code live and explain the complexity. Medium problems, a working solution in ten minutes, an honest big-O.
• Do you understand your own project. Every architectural choice will get "why not the alternative".
• Core CS with trade-offs. DBMS, OS, networks and OOP at the level of "when does this break".
• Reasoning about scale. Small design questions to see whether you think in terms of load, failure and cost.
• Whether you are worth the Prime band. Managers ask, in one form or another, why they should pay you three times a Ninja salary.

30 TCS Prime interview questions with sample answers

Coding and data structures

1. Find the second maximum element in an array without sorting. (reported in a 2026 Prime interview)

"One pass with two variables, first and second, initialised to a sentinel. If an element beats first, move first to second and set first; else if it beats second and differs from first, set second. O(n) time, O(1) space, and duplicates are handled because I skip values equal to the current maximum. For 'kth largest' I would switch to a min-heap of size k, O(n log k), or Quickselect."

2. Check whether a string is a palindrome, ignoring case and non-alphanumeric characters.

"Two pointers from both ends: skip characters that are not letters or digits, compare lower-cased characters, stop at the first mismatch. O(n) time, O(1) extra space. Cleaning with replaceAll and reversing works too, but allocates two extra strings, and the interviewer will ask why."

3. Given an integer array and a target, return the indices of two numbers that sum to the target.

"A hash map from value to index: for each element, if target - value is already in the map return both indices, else insert. One pass, O(n) time and space. If the array is sorted and extra memory is out, two pointers give O(n) time and O(1) space. I would state both and ask which constraint matters."

4. Detect a cycle in a linked list and find where it starts.

"Floyd's algorithm: slow pointer moves one step, fast moves two; if they meet there is a cycle. To find the start, reset one pointer to the head and move both one step at a time; they meet at the entry, because the head-to-entry distance equals the meeting-point-to-entry distance modulo the cycle length. O(n) time, O(1) space, no visited set."

5. Implement an LRU cache with O(1) get and put.

"A hash map pointing to nodes in a doubly linked list. get finds the node, moves it to the head and returns the value. put inserts or updates at the head and, over capacity, removes the tail node and its map entry. Both are O(1) because the list unlinks in O(1) with a node reference. I would mention Java's LinkedHashMap with access order as the shortcut and then write the manual version."

6. Find the length of the longest substring without repeating characters.

"Sliding window with a map of each character's last index. Move the right pointer; if the character was seen inside the window, jump the left pointer past its last index; track the maximum. O(n) time, O(k) space for the alphabet. For 'abcabcbb' the answer is 3."

7. Your solution is O(n log n). Can you do better, and should you?

"Often yes with a hash structure, at the cost of memory and cache behaviour. Sorting-based O(n log n) is sometimes preferable: no extra memory, simple, and for a few thousand elements the difference is invisible. I would ask what n is and whether memory is constrained before rewriting."

8. Write a SQL query for the second-highest salary in each department.

"SELECT dept_id, salary FROM (SELECT dept_id, salary, DENSE_RANK() OVER (PARTITION BY dept_id ORDER BY salary DESC) AS rnk FROM employees) t WHERE rnk = 2. DENSE_RANK handles ties, so two people on the top salary do not hide the real second. Without window functions, a correlated subquery counting distinct higher salaries works but scans more."

Core computer science

9. Process versus thread. When would you use multithreading in Java?

"A process has its own address space; threads share the process's memory and are cheaper to create and switch. I would use threads for I/O-bound work such as calling several APIs in parallel, through an ExecutorService rather than raw threads. Shared memory is the benefit and the danger; anything shared and mutable needs synchronisation or a concurrent collection."

10. Explain ACID with an example of atomicity failing.

"Atomicity: all or nothing. Consistency: constraints hold before and after. Isolation: concurrent transactions behave as if serial. Durability: committed data survives a crash. Atomicity fails if a transfer debits account A, the application crashes, and B is never credited; a transaction wraps both updates so the debit rolls back."

11. What is a B-tree index, and when does an index hurt?

"A balanced tree of sorted keys with row pointers, giving O(log n) lookups and range scans. It hurts on write-heavy tables, because every write must update the index too; on low-selectivity columns like a boolean, where a scan is cheaper; and when a composite index is not filtered on its leading column, so it is never used."

12. You normalised to 3NF. When would you deliberately denormalise?

"For read-heavy reporting where five-table joins per request are too slow: store a precomputed total or a name copy on the fact row and keep it consistent through the write path or a job. Also when data is naturally immutable, like an order snapshot that must not change when the product price changes later."

13. What happens between typing a URL and seeing the page?

"DNS resolution, possibly cached at several levels. A TCP three-way handshake, then a TLS handshake for HTTPS. An HTTP request; the server, usually behind a load balancer, returns a response. The browser parses HTML, fetches CSS, JS and images, builds the DOM and render tree, and paints. If pushed, I would go into caching headers or HTTP/2."

14. Abstraction versus encapsulation, and interface versus abstract class in Java.

"Abstraction hides complexity behind a contract; encapsulation hides state behind methods. An interface defines only the contract and a class can implement many; an abstract class can hold state and partial implementation, single inheritance only. Interface for a capability like Comparable; abstract class when subclasses share code, like a base Report with a template method."

15. What are the four conditions for deadlock, and how do you prevent it?

"Mutual exclusion, hold-and-wait, no pre-emption, and circular wait. Prevention breaks one of them; the practical one is always acquiring locks in the same global order so circular wait cannot form. Lock timeouts and lock-free structures are the other tools. In a database, keep transactions short and touch tables in a consistent order."

16. REST versus SOAP, and what does idempotent mean?

"REST is an architectural style over HTTP with resources and verbs; SOAP is a protocol with an XML envelope and a WSDL contract, still common in the banking integrations TCS works on. Idempotent means repeating a request has the same effect as sending it once: GET, PUT and DELETE should be, POST usually is not, which matters when a client retries after a timeout."

Project and design

17. Walk me through your project's architecture. What breaks first at ten times the users?

Explain in layers: client, API, business logic, database, any queue or cache. Then name the real bottleneck. "The single Postgres instance breaks first, because every dashboard load runs four aggregate queries; I would add a read replica and cache the aggregates for 60 seconds. Next is the synchronous email sending in the request path; that goes to a queue." Prime panels want to hear that you know your weak points.

18. Design a URL shortener.

"An API that takes a long URL, generates a short key, stores the mapping and redirects on lookup. Keys: base-62 encoding of a counter, six characters give 56 billion. Storage: a key-value store or an indexed table. Reads dominate, so add a cache. Then expiry, 301 versus 302 depending on whether we want click analytics, and rate limiting so one client cannot exhaust keys."

19. How did your project handle authentication? Sessions or JWT, and why?

"JWT with a short expiry and a refresh token, because the front end and API were on different origins. A JWT cannot be revoked before expiry, so access tokens lived fifteen minutes. For a single server-rendered site, a session cookie with server-side storage would have been simpler and revocable."

20. Design the classes for a parking lot.

"Entities: ParkingLot with levels, Level with Spot objects, Spot with a size enum, Vehicle abstract with Car, Bike, Truck, and Ticket with entry time and spot. park(vehicle) finds the first free spot that fits; unpark(ticket) frees it and computes the fee through a PricingStrategy interface so hourly and flat pricing can be swapped. Allocation lives in a strategy too."

21. What tests did you write, and what did they catch?

"JUnit tests for the pricing and validation logic, and a few integration tests hitting the API with a test database. The unit tests caught a rounding bug in the fee calculation before the demo. I had no UI tests and would add them for the login flow." Say what you did not test; Prime panels respect honesty over a perfect claim.

22. How did your team avoid merge conflicts?

"Feature branches off main, small pull requests, rebase before opening the PR, and one owner per module so two people rarely touched the same file. Conflicts were resolved on a call, and a CI check blocked merging any PR that failed tests."

Managerial-style questions

23. You are a Prime hire and get allocated to a legacy mainframe project. How do you react?

"I would take it and learn it properly. Legacy systems run the banks and insurers TCS serves, and understanding them is rare and valuable. I would ask about the modernisation roadmap so I know which skills to build alongside, and keep my Java and cloud skills current on the internal platforms. I would not treat it as a demotion."

24. Prime pays much more than Ninja. Why should we pay you Prime?

"Because of what I can do on day one: take a medium-complexity module, design it, code it with tests and explain it to a client. My project is deployed, not just presented, and I can defend every decision in it. I expect to be measured against that bar."

25. How do you keep up with technology? Name something specific.

Name one thing you actually did in the last three months. "In July I moved my project from a single VM to Docker Compose with a separate database container and learned why the app could not reach the database by localhost any more." Specific beats "I read blogs".

26. A client calls at 6 pm saying the report is wrong, and your lead is on leave.

"Acknowledge within minutes and ask for one concrete example to reproduce. Check whether it is a data or a logic issue. If the fix is safe and covered by tests, I make it and message the lead; if it touches billing or anything irreversible, I escalate to the next person in the hierarchy rather than change production alone."

HR questions

27. Tell me about yourself, Prime version.

Sixty seconds: degree and college, strongest technical area with one proof, project in one sentence with a result, why Prime. "I am a final-year CS student at [college]. My strongest area is Java backend work; I built a hostel-complaint system with Spring Boot and Postgres that our hostel actually uses, and I did the schema and API design. I want Prime because I want projects where that kind of ownership is expected."

28. Why TCS when you have product-company offers?

"Scale and breadth. The systems I would work on at TCS serve millions of users from day one, and over three years I can see banking, retail and telecom domains, which one product company cannot give me. If I specialise later, I want to have seen the options."

29. Are you fine with relocation, shifts and the service agreement?

"Yes to relocation anywhere in India; my family knows. Yes to shifts when a project needs it. I have read the service agreement terms and I am comfortable with them." If you have a genuine constraint, state it now with a reason; a surprise after the offer is worse.

30. Do you have any questions for us?

Ask about work, not perks. "What kind of projects do Prime joiners usually start on, and how soon do they get client interaction?" and "How does TCS decide when a fresher moves from support to development work?"

Mistakes that cost Prime candidates the profile

• Coding without narrating. Five silent minutes read as stuck. Talk through the approach, then code.
• A project you cannot defend. "The team decided" answers to architecture questions end Prime consideration fast.
• Memorised definitions with no trade-offs. Prime questions are always "and when does that break".
• Treating design questions as a lecture. Ask clarifying questions, state assumptions, then design.
• Contradicting the HR answers on location, offers or higher studies. Panels compare notes.
• Acting entitled about the profile. A Prime shortlist can become a Ninja offer in one bad round.

How to practise the TCS Prime round

Prime interviews reward two things reading cannot give you: coding aloud under time pressure, and defending decisions when someone pushes back. Both need repetition with feedback.

In MockMate Practice, attach your resume and paste the TCS role description, choose a technical round and run an adaptive session in the browser. You solve a problem in the code editor while the interviewer persona asks about complexity and edge cases, and project questions follow up on what you actually said, the way a Prime panel does. The report shows each answer, response timing, coaching evidence and recurring weaknesses, with a recommended next practice. Eligible accounts get three free Practice starts of up to ten minutes each as of September 2026. Use MockMate Live assistance only in interviews or meetings where the organisation or interviewer permits it; TCS selection rounds do not, so stay with Practice.

A ten-day plan: days one to four, two medium problems daily from arrays, strings, linked lists and hashing, spoken aloud. Days five to seven, rewrite your project as architecture, one decision, one thing that breaks at scale. Days eight to ten, Practice rounds, reports, and the two weakest answers fixed each time. For the managerial questions inside Prime rounds see the TCS managerial round page; for the broader process, the TCS hub.