Virtusa interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Virtusa
2 rounds | 5 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures and Algorithms, Object-Oriented Programming System, Operating system, Database Management System
Try to do Data Structures and Algorithms based questions and firstly attempt it yourself before going to the solution, also try to do it as quickly as you can. Also prepare for theory subjects like Operating system, Database Management System, etc which I prepared through Coding Ninjas subjective notes and they are very accurate and up to mark.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Keep your resume simple and complete. Mention some good level projects, your previous experiences and coding achievements if any.
Interview rounds
01
Round
Easy
Face to Face
Duration45 Minutes
Interview date10 Aug 2018
Coding problem3
1. DBMS Question
What is the difference between SQL and NoSQL databases?
Problem approach
If your data is very structured and ACID compliance is a must, SQL is a great choice. On the other hand, if your data requirements aren't clear or if your data is unstructured, NoSQL may be your best bet. The data you store in a NoSQL database does not need a predefined schema like you do for a SQL database.
2. DBMS based question
What is Normalization?
Problem approach
Normalization also simplifies the database design so that it achieves the optimal structure composed of atomic elements (i.e. elements that cannot be broken down into smaller parts).
Also referred to as database normalization or data normalization, normalization is an important part of relational database design, as it helps with the speed, accuracy, and efficiency of the database.
3. Sort 0 1 2
Easy
22m average time
0/40
Asked in companies
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
02
Round
Easy
Face to Face
Duration45 minutes
Interview date12 Aug 2018
Coding problem2
1. Third greatest element
Easy
20m average time
80% success
0/40
Asked in companies
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
Problem approach
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
2. Maximum Subarray Sum
Moderate
25m average time
75% success
0/80
Asked in companies
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.
Given the array [-5, -1, -8, -9], the maximum sum would be -1.
Follow up: Do this in O(N) time.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Virtusa
Selected 
1731 views
0 comments
0 upvotes
SDE - 1
1 rounds | 3 problems
Interviewed by Virtusa
Rejected
1631 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Virtusa
Selected 1096 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Virtusa
Rejected
1282 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
1 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 6877 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6240 views
3 comments
0 upvotes