Xoriant Software Developer Intern Interview Questions and Answers

Q1. There are three technical rounds one round will be tough
Add your answer

Q1. They didn't ask me anything
Add your answer
Q2. Will give U false promises and showoff about the company
Add your answer

Q1. What is polymorphism?
Ans. 
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).

• Example: Inheritance allows a child class to override a method from its parent class, exhibiting polymorphic b
Answered by AI
Add your answer
Q2. And other questions related to cs fundamentals
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

Q1. What is segmentation in the context of operating systems?
Add your answer
Q2. How many levels of normalization are there in database management systems?
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. Brute Force Approach
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
 
Here is the algorithm :
 
1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...read more
Answered Anonymously
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered Anonymously
Add your answer

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

Q1. What are the sub-parts or phases of the analysis part in compiler design?
Add your answer
Q2. 
Left Rotations of an Array
Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
Input:
...read more
Ans. Rotate One Element At A Time
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
 
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a Coding round with 2 programming questions which need to solved in 60 minutes in any of the languages (C/C++/Java/Python)

Q1. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. Depth First Search
• Ninja can move in at most four directions i.e left, right, up, and down.
• We will take a 2-D array ‘directions’ of size 4 x 2  in which the first column denotes the shift in the horizontal direction and the second column denotes a shift in the vertical direction.
    We will store all the four directions { (0,1) (0,-1) ( 1,0) ( -1,0 ) )} in 2-d array.
• In each direction, Ninja continues to m...read more
Answered Anonymously
View 1 more answer
Q2. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. Brute Force
• The most obvious brute force approach would be to sort the array in descending order and return the ‘K’th element from the beginning of the array.
• Sort the array in descending order, for sorting most of the languages have their inbuilt sort methods which are usually very fast.
• After sorting, return the element arr['K'-1](i.e. element at index ‘K’-1, considering 0-based indexing).
Space Complexity: O(1)Explanati...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was in the morning at around 10 a.m conducted on Skype.

Q1. 
Median of Two Sorted Arrays
Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...read more
Ans. Sorting
The first approach is by joining the array and again sorting is to get median.
 
The algorithm is as follows:
• Create a new array of size of total number of elements.
• Insert elements of both the arrays in the array.
• Sort the array and find the median.
Space Complexity: OtherExplanation:
O(N + M) per test case, where ‘N’ and ‘M’ are the sizes of the arrays.
 
In the worst case, we will be creating a single array...read more
Answered Anonymously
Add your answer
Q2. 
Distance Between Two Nodes in a Binary Tree
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...read more
Ans. Naive Approach
In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

A HR Round in which the interviewer discussed about me and some things about my resume (Achievements, Projects etc.)

Round duration - 90 Minutes
Round difficulty - Medium

Timing: 6 PM to 7:30 PM IST
Environment: Test took place on Hackerrank. The test was proctored.
Details: 4 questions with varying difficulty were there. Partial score was allowed.

Q1. 
Grid Satisfaction Problem
In this problem, you are given a grid of size N*M containing two types of people: type ‘A’ and type ‘B’. You are given the number of people of each type: 'countA' denotes the num...read more
Ans. Using Recursion
The approach is to use Recursion along with Bitmasking. We can observe that we only need to know the last M cells we processed. We should only consider the cells at the top and left of the current cell because the right direction will be covered by someone else's left position, and the bottom position will be covered by someone else's top position. If a cell is filled, its contribution is fixed. If a nei...read more
Answered Anonymously
Add your answer
Q2. 
Max Game Minimum Penalty Problem
In this game, you are given a collection of 'N' numbers. The objective is to minimize the total penalty incurred while playing by following these steps:
1. Select any two ...read more
Ans. Brute Force
1. The idea is to keep only the required elements in the vector/array. Let the given array be { 3, 4, 5, 4}.
2. We pick the 2 smallest elements i.e 3 and 4 in the above example and replace them with their sum. The above array hence becomes {5, 4, 7}.
3. Along with this, we also maintain the penalty variable and keep on updating it. Initial value of the penalty will be 0. After we perform step 2, the penalty becomes 4+3...read more
Answered Anonymously
Add your answer
Q3. 
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...read more
Ans. Recursion
The basic idea of this approach is to break the problem into subproblems. 
Now, there are three possible cases:
 
1. The diameter of the tree is present in the left subtree.
2. The diameter of the tree is present in the right subtree.
3. The diameter of the tree passes through the root node.
 
Let us define a recursive function, ‘getDiamter’, which takes the root of the binary tree as input parameter and return...read more
Answered Anonymously
Add your answer
Q4. 
Problem Statement: Find the Number of States
You are given ‘n’ cities, some of which are connected by bidirectional roads. You also have an ‘n x n’ matrix ‘roads’, where if city ‘i’ and city ‘j’ are conne...read more
Ans. Use Disjoint-set data structure
Disjoint-set (or Union-find) is a data structure that stores a collection of disjoint (non-overlapping) sets. This data structure consists of three basic operations:
• makeSet(‘V’): Create a new set containing the element 'V'.
• unionSet(‘A’, ‘B’): Merge the two specified sets, the set containing element ‘A’ and the set containing element ‘B’.
• findSet('V'): Return the representative (also called...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Problems were asked from projects, and with one easy algorithm problem, they tested problem-solving skill.

The interview started with an introduction, post which my projects were discussed.
Out of two projects, one was discussed for about 15 minutes, and another for 5 minutes. The questions were more on underlying concepts, its conceptual working, rather than implementation details. They were satisfied with my answer.

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

In this round, my project was discussed for 5 minutes, and later only OS, DBMS was asked. No coding problems were asked.
It was more of a discussion round for me.
One of the interviewers had 20+ years of experience, while the other 7+ years of eperience.
Questions were mostly asked from the OS course (nearly 45 minutes) and had a healthy discussion. I didn't knew the answers to a few questions, of which the interviewer explained the answer.

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.

Q1. 
Topological Sort Problem Statement
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
Explanation:
A directed acyclic g...read more
Ans. DFS traversal of DAG
In topological sort a vertex u must come before vertex v if there is a directed edge between u and v. We can modify DFS traversal of a graph to achieve this.
 
The algorithm will be-
• We can declare a stack ‘topSort’ which will store the nodes after the topological sort.
• We also maintain an array/list ‘visited’ of size N, denoting which node is visited in a dfs traversal. Initially, all elements of ...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

4 questions. 2 hard, 1 medium, 1 easy. Those who were able to 2.5 questions were shortlisted. 2 DP Questions Hard, 1 Graph medium and 1 easy array based question.

Q1. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Used DFS and Flood Fill Algorithm.
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Face to Face Interaction. Project discussion in great depth. Talked about Machine learning.

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
A twisted level of Longest Palindromic Substring. If you know the approach for this, the question was a cakewalk.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Very tough Data structure questions to get the most optimum approach only.

Q1. 
Rearrange Linked List Problem Statement
Given a singly linked list in the form 'L1' -> 'L2' -> 'L3' -> ... 'Ln', your task is to rearrange the nodes to the form 'L1' -> 'Ln' -> 'L2' -> '...read more
Ans. 
Use a Stack based approach storing the heads in 2 stacks. Reverse the second half and join the linked list.
Answered Anonymously
Add your answer
Q2. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
I used a heap based approach and so did it in O(Log(n)). Interviewers told me to optimise so I did it with a Dequeue in O(n).
Answered Anonymously
Add your answer