Interview
TCS MockVita 2026: Dates, Does It Count & How to Use It (MockVita 2 on 13-14 Nov)
TCS MockVita 2 is listed for 13-14 Nov 2026. Learn what MockVita is, whether it counts, how to use it, language tips and practice problems with approaches.

Practise the rounds for TCS MockVita
Short answer: MockVita is the practice contest TCS runs before the real CodeVita rounds. For Season 14, one third-party listing (Internshala) puts MockVita 1 on 23-24 October 2026 and MockVita 2 on 13-14 November 2026. The official CodeVita page does not list MockVita dates, so confirm before you plan around them. The official page describes MockVitas as running "just like actual rounds to give demo of the actual contest", and it says you must clear the actual rounds to move forward, so a MockVita is practice, not a stage you pass.
If you have registered for CodeVita and are wondering whether to bother with MockVita 2, the answer is yes. It is the only place you can meet the judge, the input format and the time pressure before marks matter.
TCS MockVita 2026: Key Dates (last checked 29 October 2026)
| Detail | Status |
|---|---|
| MockVita 1 | 23-24 October 2026 (Internshala; third-party) |
| MockVita 2 | 13-14 November 2026 (Internshala; third-party) |
| CodeVita registration deadline | 13 November 2026 (Internshala; not stated on the official page) |
| Pre-qualifier | 11-12 December 2026 (Internshala; third-party) |
| Contest length (official page) | 3 hours for a round |
| Languages (official page, this season) | C, C++, Java, Python. The page does not say whether this list applies to MockVitas specifically |
Only the contest length and language list come from TCS's own page. Every date comes from a listing we could not match to an official source, and several other 2026 articles say TCS had not published Season 14 dates. If your MockVita window differs, trust the email or dashboard from TCS.
Notice that the listed registration deadline (13 November) falls on the first day of MockVita 2. If you have not registered yet, do that today, not on the day of the contest.
What Is MockVita?
CodeVita is TCS's global coding competition. MockVita is a mock run of it. Per the official page, the point is a demo of the real contest: same style of statement, same platform, same kind of scoring pressure, without anything depending on the result.
Does MockVita count?
The official page does not state that MockVita scores feed into your CodeVita rank or qualification, and it says only that you must clear the actual rounds to move further. We found no official statement that MockVita results count. So the safe reading is:
- Treat it as practice, not as a qualifier.
- Do not skip a real round assuming MockVita performance will cover you.
- Check your dashboard or the Season 14 FAQ if you want certainty on any credit or certificates.
Past seasons' third-party write-ups sometimes mention that MockVita performance does not affect rankings, but we have not verified that for Season 14, so we are not stating it as fact.
Is it compulsory?
Not as far as the official page says. It is still the cheapest rehearsal you will get.
Why Use MockVita 2 Seriously
- You learn the judge. Input arrives in a particular format, output has to match exactly, and a stray space or a missing newline is a fail. Finding this out in a mock costs nothing.
- You calibrate difficulty. CodeVita problems vary a lot in difficulty, and you only know your personal pace after a live attempt.
- You test your setup. Internet, browser, language version, template code.
- You practise the reading. Statements are story-heavy. The skill of stripping a story to inputs, outputs and constraints is trainable.
- You rehearse the three-hour budget. Most people spend too long on the first problem they open.
For general contest structure and the full season plan, see our TCS CodeVita 2026 guide.
How to Use MockVita 2: A Plan
Before the contest (now to 12 November)
- Pick one language from C, C++, Java or Python and stay with it.
- Write a small template: fast input reading, a function skeleton, and a few helper functions (gcd, a grid-direction array, a string splitter).
- Do two timed 3-hour sessions on practice problems. Our CodeVita previous-year questions post is a good source.
- Test your connection and browser, and know your fallback.
During the contest
- First 10 minutes: read everything. Rank problems by how quickly you think you can solve them.
- Solve the easiest first. Get a full pass on it before moving on.
- Rewrite each statement in two lines (input, output, constraints) before coding.
- Run your own edge cases before submitting: smallest input, largest input, duplicates, all-equal, empty.
- Set a time cap per problem, such as 50 minutes. If you are still stuck, move on and come back.
- Leave the last 15 minutes for re-reading submissions, not new code.
After the contest
Upsolve. Solve every problem you missed, with no clock. Then write one line per mistake: misread, edge case, wrong complexity, input handling. This log is worth more than the contest itself.
Platform and Language Tips
- Input handling is half of it. Practise reading whole lines, space-separated numbers, and multiple test cases. In Python use
sys.stdin.read().split()for fast tokenised input; in C++ useios::sync_with_stdio(false); cin.tie(nullptr);. - Output must match exactly. Check separators, trailing spaces and capitalisation of words like
YESandNO. - Mind the time limit in Python. Loops over large inputs get slow. Prefer built-ins and avoid nested loops over 10^6 elements.
- Java: use
BufferedReaderrather thanScannerfor large input. - Know your integer ranges. Use 64-bit types in C++ and Java when sums can exceed about 2 billion.
- Do not print debug lines. Remove them before submitting.
- Tell the language apart from the version. Features like newer syntax may not exist on the judge. Stick to plain constructs.
Original Practice Problems
These are written by us in the style of timed contests. They are not from TCS and not from past papers.
Problem 1: Token Desk
A desk serves customers in the order they arrive. Each customer has an arrival minute and a service duration. The desk handles one customer at a time and starts the next one as soon as it is free (or when they arrive, if it is idle). For a list of customers sorted by arrival time, print the maximum waiting time among all customers.
Approach: simulate. Keep free_at, the minute the desk becomes free. For each customer, start time is max(arrival, free_at), wait is start - arrival, and then free_at = start + duration. Track the maximum wait. O(n). The trap is forgetting that an idle desk means start equals arrival, not the previous finish time.
PYTHON
Problem 2: Garden Paths
A rectangular garden is a grid of . (open) and # (blocked). A gardener starts at the top-left and wants to reach the bottom-right, moving only right or down. Count the number of distinct paths, modulo 1,000,000,007.
Approach: dynamic programming. dp[i][j] is the number of ways to reach cell (i, j). If the cell is blocked, it is 0. Otherwise it equals dp[i-1][j] + dp[i][j-1], both modulo the prime. Initialise dp[0][0] = 1 if that cell is open. Edge cases: blocked start or end, single row, single column. Time and space O(rows x columns), and you can reduce space to one row.
Problem 3: Digit Chain
Define f(n) as the sum of squares of the digits of n. Starting from a given n, repeatedly apply f. Print HAPPY if the sequence reaches 1, otherwise LOOP.
Approach: keep a set of values seen. Apply f until you reach 1 (print HAPPY) or revisit a value (print LOOP). The number of distinct values is small because f shrinks big numbers quickly. This tests simulation with a visited set rather than any clever mathematics.
Problem 4: Fewest Boxes
You have m items, each with a weight. A box holds at most W total weight. Items must be placed in the given order and you may not reorder them. Each time an item does not fit in the current box, you start a new box. Print the number of boxes used.
Approach: a straightforward greedy scan. Keep the current load; if load + w > W, increment the box count and reset the load to w. Start with one box. A nuance to watch for: an item heavier than W makes the input invalid, so confirm in the statement what to do.
Problem 5: Pair Targets
Given an array of n integers and a target T, count the pairs of indices i < j whose values sum to T.
Approach: use a hash map of value to count. For each element x, add count[T - x] to the answer, then increment count[x]. O(n). The mistake is counting a pair twice, or counting an element with itself. The order of "add then increment" avoids both.
Try them under a timer, one after another, without notes. If two take you more than 25 minutes each, that is your list for the week.
What to Do After MockVita 2
- Upsolve and log within 24 hours while the contest is fresh.
- Register (or confirm) for CodeVita before the listed 13 November deadline.
- Prepare for the pre-qualifier listed for 11-12 December: two more timed 3-hour sessions per week.
- Fill gaps. If implementation ran slow, drill simulation. If recursion failed, drill backtracking. The DSA Patterns Sheet is organised by pattern.
- Practise explaining. Contest results can lead to technical interviews, where you must describe your approach out loud. An AI mock interview is a good way to rehearse that.
- If you are also taking the NQT, see our TCS NQT November 2026 guide. It is a separate qualifying test with its own dates.
Common Mistakes
❌ Treating the mock as optional and showing up cold on the real day.
❌ Opening the hardest problem first. Read all, then order.
❌ Ignoring exact output format.
❌ Never upsolving. The learning happens afterwards.
❌ Changing language between MockVita and the real round.
❌ Assuming MockVita counts. The official page does not say so.
Frequently Asked Questions
What is TCS MockVita?
A practice contest that mimics the real CodeVita rounds, so you can try the platform and the style of problems. The official page describes it as a demo of the actual contest.
When is MockVita 2 in 2026?
13-14 November 2026 according to one third-party listing (Internshala). The official page does not list MockVita dates, so confirm with TCS.
Does MockVita count towards CodeVita qualification?
The official page does not say it does. It says you must clear the actual rounds to move forward. Treat MockVita as practice.
Do I have to register for CodeVita to take MockVita?
We could not confirm this on an official source. Register for CodeVita anyway; the registration deadline is listed as 13 November.
What languages can I use?
The official Season 14 page lists C, C++, Java and Python. It does not say whether that applies to MockVita specifically.
How long is a MockVita contest?
The official page gives 3 hours for a contest round; confirm the length for MockVita in your dashboard.
Where can I find MockVita 2026 questions?
TCS does not publish an official question bank that we could find. Use our original practice problems above and the previous-year questions and solutions post, and be wary of sites that claim to have this year's questions in advance.
How hard are MockVita problems?
The range is wide: some are plain simulations, others need dynamic programming or graph work. See the CodeVita 2026 guide for the topics that show up most.
What should I do after MockVita?
Upsolve, log your mistakes, register for CodeVita if you have not, and plan for the pre-qualifier listed for 11-12 December.
Final Thoughts
MockVita is free rehearsal. Use MockVita 2 to learn the judge, to test your template and to find your slow spots, then spend the weeks before the pre-qualifier fixing those. Confirm every date on the official portal, because the numbers in this guide come from a third-party listing.
Related reading: TCS CodeVita 2026 guide · CodeVita previous-year questions and solutions · TCS NQT November 2026 guide
Topics
Related on Thita
Your next step
Practise the rounds for TCS MockVita
Most selection rounds open with a timed coding test. Work through the DSA patterns they draw on, run your code in the browser, then rehearse the interview out loud with an AI interviewer.