Virtusa Consulting Services Full Stack Developer Interview Questions, Process, and Tips

Code was related to data structures and algorithms

Q1. Basic java oops questions
Add your answer
Q2. SDLC related question
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

Have to solve MCQ questions and 3 programming problems

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Add your answer
Q2. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Add your answer
Q3. 
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...read more
Add your answer

Round duration - 6 weeks
Round difficulty - Hard

Q1. Can you describe the use case of Account Statements Transcription as a full stack application, which involves converting an uploaded Excel sheet document into an SQL table, fetching data as per user needs ...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Technical questions were asked from core java, SQL, UI stacks, Multi threading, exception handling, java 8, UML, SDLC, collections, JDBC, PL/SQL, OS, Data Structures, sorting and searching algorithms, etc...

Q1. In the 100 Prisoners problem, each prisoner is randomly assigned a red or black hat. They can see the hats of all other prisoners but not their own. The challenge is to devise a strategy that allows the ma...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Medium

The round was online. It had coding, aptitude and verbal questions.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

It was at 11:45 am on Microsoft teams. Interviewer was friendly. I was asked to share my screen.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
 
Steps:
&...read more
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

It was on microsoft teams. Hr asked me basic questions.