Technical interview questions
Virtusa technical interview questions for freshers - OOP, SQL, DBMS, coding prompts, and project deep-dives with sample answers.
Real Virtusa interview questions - candidate interview experiences and HR round prep, in one place.
Explore: Technical interview questions · Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Virtusa’s fresher process is a standard IT-services loop - aptitude, CS fundamentals, pseudocode, and coding in the online assessment, then OOP/SQL technical interviews, an optional group discussion, and HR. Many 2025–2026 drives split Coder (~₹5 LPA) and Power Coder (~₹6.5 LPA, candidate-reported) packages after the first OA sections; Power Coder candidates report a harder, longer coding block. Some specialised or off-campus flows (for example Neural Hackathon or data-engineer tracks) add extra technical rounds or SpeechX-style spoken assessments - confirm your invite, not an old blog post.
Technical interview questions
Virtusa technical interview questions for freshers - OOP, SQL, DBMS, coding prompts, and project deep-dives with sample answers.
Interview experience
Virtusa interview experiences covering Online assessment, Technical interview, Group discussion (some drives only), HR interview. Round-wise notes, common questions, and what candidates report clears each stage.
HR interview questions
Virtusa HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
| Round | Duration | What they test |
|---|---|---|
| Online assessment | 2-3 hrs (varies) | Aptitude, logical reasoning, verbal, technical MCQs, coding |
| Technical interview | 30-45 min | OOP, SQL, DSA basics, project discussion |
| Group discussion (some drives only) | 15-20 min | Communication, structure, listening |
| HR interview | 15-30 min | Motivation, relocation, shifts, joining |
PrepInsta and LinkedIn placement write-ups for 2025 graduates often describe five consecutive OA sections before interviews, though older drives used a single mixed paper:
| Section | Typical size | Time (reported) | Focus |
|---|---|---|---|
| Aptitude | ~10 MCQs | ~10 min | Speed arithmetic, ratios, basic logic |
| CS fundamentals | ~30 MCQs | ~30 min | OOP, DBMS, OS, output tracing |
| Pseudocode | ~10 MCQs | ~10 min | Loop invariants, complexity intuition |
| Coding challenge (Coder track) | ~4 problems | ~50 min | Arrays, strings, easy–medium logic |
| Power coding (Power Coder invite only) | ~3 problems | ~80 min | Harder DSA - trees, stacks, multi-step |
Technical panels on several 2025 Hyderabad drives also asked candidates to explain or rewrite code from the OA, not only fresh whiteboard questions - so keep your submitted solutions readable and be ready to optimize edge cases aloud.
These answers are compiled from public candidate reports and prep guides, not from an official notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| Which platform is it on? | PrepInsta lists HirePro. Virtusa does not publish the platform. |
| Does it have negative marking? | No, per PrepInsta’s 2026 pattern, and no recent candidate report mentions any. |
| How much is the cutoff? | Not published. A 2025 campus notice set eligibility at 65% aggregate across 10th, 12th and degree; other drives use 60%. |
| What is Coder versus Power Coder? | Coder is the general software-engineer track, reported at about ₹5 LPA. Power Coder is invite-only, based on how you score in the Coder challenge, and is reported at about ₹6.5 LPA. |
| How long is the whole assessment? | Reports range from about 90 minutes for a single mixed paper to about 180 minutes when the Power Coder challenge (3 problems in about 80 minutes) is included. A 2024 ASE candidate had 64 questions in 2 hours 5 minutes across aptitude, pseudocode, computer fundamentals, communication and coding. |
| Is there a sectional cutoff? | Not published. Sections are timed separately, and a 2024 ASE candidate described the coding section as the hardest and the deciding one, so do not rely on aptitude alone. |
| Is there coding? | Yes. The Coder challenge has about 4 easy-to-medium problems on arrays, strings and loops; Power Coder adds about 3 harder problems. A 2026 Junior Data Scientist drive set only 2 easy coding questions in a 90-minute test. |
| Is there a spoken English test? | On some drives. A 2026 campus drive added a 45-minute SpeechX assessment of reading, listening and grammar between the online test and interviews. |
| Is there a service agreement? | Yes, in candidate reports. A 2024 ASE candidate was asked in HR whether they would sign a 2-year service agreement. Read the terms in your offer letter. |
The interview follows your track. These are questions candidates have reported on GeeksforGeeks for 2024-2026 Virtusa drives; they show the level and style, not a fixed list.
| Track | Reported questions and topics |
|---|---|
| Coder / Associate Software Engineer | A 15-20 minute technical round: introduce yourself, which languages you know, and count the repeated occurrences of each character in a string in Java. Some 2025 Hyderabad panels asked candidates to explain or rewrite their own OA code. |
| Power Coder | Harder DSA in the invite-only challenge (trees, stacks, multi-step problems). Few public reports separate Power Coder interview panels from Coder ones, so prepare for the same OOP, SQL and project questions. |
| Junior Data Scientist (campus, 2026) | Your AI, ML and deep learning projects, basic RAG questions and 2 coding questions in the first interview; core data science concepts, probability questions and a string DSA problem in the second. |
| Hackathon route | Two coding tests where almost every test case must pass, then a 36-hour hackathon in Hyderabad building a project from an SRS document, with project reviews and technical interviews during the event. |
Asked across every track: why Virtusa, whether you will relocate anywhere in India, and your project and the hardest problem in it.
Sample answer frameworks for each of these are on the Virtusa HR interview questions page.
Coder and Power Coder are two tracks in the same Virtusa fresher drive. Everyone sits the Coder assessment (aptitude, CS fundamentals, pseudocode and about 4 coding problems); Coder offers are reported at about ₹5 LPA. Candidates who score well are invited to the Power Coder challenge, about 3 harder problems in about 80 minutes, and Power Coder offers are reported at about ₹6.5 LPA.
Virtusa also hires through its hackathon route and role-specific campus drives such as Junior Data Scientist, which add their own rounds. This page covers the Coder and Power Coder campus process; the track table above lists what the other routes ask.
Overloading means two or more methods in the same class share a name but differ in parameter list (type, count, or order). It is resolved by the compiler at compile time using the static type of the arguments, which is why it is called static or compile-time polymorphism. Return type alone cannot distinguish overloads. Overriding means a subclass provides its own implementation of a method inherited from a parent with the same signature; the JVM picks which version to run at run time based on the actual object, which is dynamic polymorphism. An overriding method cannot reduce visibility and cannot throw broader checked exceptions than the parent.
Abstraction is about hiding complexity behind a simpler contract - you declare an interface PaymentGateway with a charge() method, and callers do not know whether the implementation talks to a card network or a wallet. Encapsulation is about hiding data - you make the balance field private and expose deposit() and withdraw() so no caller can set a negative balance directly. The distinction interviewers want is that abstraction is design-level (what a type does), while encapsulation is implementation-level (how its state is protected). In Java, abstraction is achieved with abstract classes and interfaces, encapsulation with access modifiers plus getters and setters.
WHERE filters individual rows before any grouping happens, so it cannot reference aggregate functions. HAVING filters the groups produced by GROUP BY, so it can reference aggregates such as COUNT, SUM, or AVG. The logical order of evaluation is FROM, then WHERE, then GROUP BY, then HAVING, then SELECT, then ORDER BY - which also explains why a column alias defined in SELECT is usable in ORDER BY but not in WHERE. For example: SELECT dept_id, COUNT(*) FROM employees WHERE salary > 50000 GROUP BY dept_id HAVING COUNT(*) > 5;. Putting the salary filter in HAVING would be wrong, and putting the COUNT filter in WHERE would be a syntax error.
INNER JOIN returns only rows where the join condition matches in both tables. LEFT JOIN returns every row from the left table, filling NULLs in the right-hand columns where there is no match. RIGHT JOIN is the mirror image, and FULL OUTER JOIN keeps unmatched rows from both sides. To find employees with no department assigned, the standard anti-join is SELECT e.* FROM employees e LEFT JOIN departments d ON e.dept_id = d.id WHERE d.id IS NULL;. The IS NULL check on the right-hand key is what converts a LEFT JOIN into an anti-join, and it is a very common Virtusa follow-up.
Normalisation organises tables to remove redundancy and update anomalies. First normal form requires atomic column values and no repeating groups - no comma-separated list of phone numbers in one cell. Second normal form additionally requires that every non-key column depends on the whole composite primary key, not just part of it. Third normal form additionally removes transitive dependencies, where a non-key column depends on another non-key column - storing dept_name alongside dept_id in an employee table violates 3NF because dept_name depends on dept_id, not on the employee. In practice teams sometimes denormalise deliberately for read performance, and saying that shows judgment rather than rote learning.
A typical index is a B-tree keyed on one or more columns, so looking up a value takes O(log n) page reads instead of a full table scan that reads every row. A clustered index physically orders the table rows by the key and there can be only one; a non-clustered index is a separate structure holding key values plus row pointers. The cost is that every INSERT, UPDATE, and DELETE must also maintain the index, so write throughput drops and disk usage rises. Indexes also stop helping when the query applies a function to the indexed column, such as WHERE YEAR(created_at) = 2024, because the engine can no longer match the stored keys.
Use two pointers, one at index 0 and one at the last index, swap the characters they point to, then move them towards each other until they cross. That is O(n) time with O(1) extra space, and it works on a char array in Java or a list in Python. In Java a plain String is immutable, so you either convert to a char array or use StringBuilder’s reverse() method; in C you can swap in place directly in the buffer, remembering the terminating null byte stays at the end. If the interviewer adds Unicode, note that swapping raw bytes breaks multi-byte characters and you should operate on code points.
ArrayList is backed by a resizable array, so random access by index is O(1), but inserting or deleting in the middle is O(n) because elements must shift, and growth occasionally costs a full copy into a larger array. LinkedList is a doubly linked list, so inserting or deleting at a known node is O(1), but reaching index i requires walking the chain, making get(i) O(n). In real code ArrayList wins almost always because contiguous memory is cache-friendly and the pointer overhead per LinkedList node is significant. Use LinkedList mainly when you need a queue or deque with heavy head insertions, and even then ArrayDeque is usually faster.
A stack is LIFO - last in, first out - like undo history or a call stack during recursion. Push and pop happen at one end, so the most recent item leaves first. A queue is FIFO - first in, first out - like a print spool or BFS frontier. Enqueue at the tail, dequeue at the head. Virtusa pseudocode and MCQ sections love tracing which element is removed after a mixed sequence of push/pop versus enqueue/dequeue; draw the container after each operation instead of guessing from memory.
A process is an executing program with its own memory space; a thread is a lighter unit of execution inside that process, sharing heap memory but carrying its own stack. Multiple threads can speed up I/O-bound work but need synchronization on shared mutable data to avoid race conditions. OS fundamentals MCQs in Virtusa OA often ask about context switching cost (process heavier than thread) and why too many threads can hurt performance on a single CPU-bound task.
Checked exceptions (subclasses of Exception other than RuntimeException) must be declared or caught at compile time - file I/O, SQL failures. Unchecked exceptions extend RuntimeException - null pointer, illegal argument - and represent programming bugs or unrecoverable states the compiler does not force you to handle. In interviews, tie this to Virtusa-style service code: catch and log checked failures at boundaries, validate inputs to avoid unchecked crashes in production.
About 4 easy-to-medium coding problems in the Coder challenge, in roughly 50 minutes. Candidates invited to Power Coder get about 3 harder problems in about 80 minutes, and a 2026 Junior Data Scientist drive set only 2 easy coding questions in a 90-minute test.
Yes, according to candidate reports. A 2024 ASE candidate was asked in the HR round whether they would sign a 2-year service agreement with Virtusa; read the exact terms in your offer letter.
No negative marking is reported across recent Virtusa drives. Confirm on the instruction screen of your own test.
Coder is the general software-engineer track, reported at about ₹5 LPA. Power Coder is an invite-only challenge of about 3 harder problems in 80 minutes, offered to candidates who score well in the Coder challenge, and is reported at about ₹6.5 LPA.
Virtusa fresher hiring usually runs in four stages: 1. Online assessment - aptitude, logical reasoning, verbal ability, technical MCQs and coding questions. 2. Technical interview (30-45 min) - programming fundamentals, OOP, SQL, data structures, and a detailed project discussion. 3. Group discussion (15-20 min) - held only on some drives, on a general topic. 4. HR interview (15-30 min) - motivation, relocation, shifts, and joining timeline. Reports vary by drive and track.
Virtusa interviews commonly cover: aptitude, logical reasoning and verbal ability in the online test; easy-to-medium coding problems on arrays and strings; OOP concepts (abstraction, encapsulation, overloading vs overriding); SQL joins, GROUP BY and WHERE vs HAVING; DBMS basics such as normalisation and indexes; a walkthrough of your own project; and HR questions on why Virtusa, relocation, shifts and the service agreement.
Most candidate reports describe three to four rounds: an online assessment, one or two technical interviews, an optional group discussion, and an HR round. The group discussion is frequently dropped depending on applicant numbers and time. Virtusa also runs different fresher tracks with different numbers of coding sections, so check that cycle’s college placement email.
The Virtusa technical interview (30-45 min) usually starts with a detailed project discussion - stack choice, your specific contribution, and the hardest bug you fixed - then moves to OOP concepts, SQL query writing, DBMS basics, and one or two coding problems on arrays or strings. Expect to be quizzed on any language or framework listed on your resume.
Good fit: You can sit a two-hour mixed paper without freezing, you will speak English into a mic if asked, and you will relocate. You already write Java or Python loops.
Harder path: You only practiced 40-minute aptitude dumps; you refuse a 2-year agreement you have not read; you freeze on read-aloud. Virtusa HR is a logistics round.
Use this as a default four-week loop before a Virtusa drive. Adjust to your invite timeline.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Candidate-reported fresher/early-career packages for Virtusa often cite ~₹4-5.5 LPA (candidate-reported). Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Virtusa interview experience page. For OA papers and coding drills, use Virtusa on placementpapers.app. OA quick answers draw on PrepInsta’s Virtusa recruitment page (2026 pattern), FACE Prep’s Virtusa guide and a 2025 CBIT campus placement notice. Track-wise questions, the service-agreement answer and the 2026 SpeechX detail draw on GeeksforGeeks interview experiences for Virtusa ASE (2024), the Virtusa hackathon route and Junior Data Scientist (January-February 2026).
High-demand company guides often searched alongside this page: TCS interview questions · Infosys interview questions · Amazon interview questions · Google interview questions · Accenture interview questions · Capgemini interview questions.