Viaplus Intern Interview Questions and Answers

There were 3 questions in the online assessment.

1 - Binary Search
2 - DP
3 - Graphs

Q1. Implement a persistence stack with constant time operations
Ans. 
Implement a persistence stack with constant time operations
• Use a combination of a stack and a hashmap to achieve constant time operations for push, pop, and get operations

• Maintain a stack to store the elements and a hashmap to store the index of each element in the stack

• When pushing an element, add it to the stack and update its index in the hashmap

• When popping an element, remove it from the stack and also remove its i...read more
Answered by AI
Add your answer

Q1. Median of two sorted arrays and OOPs basics
Ans. 
Finding the median of two sorted arrays and discussing OOPs basics
• To find the median of two sorted arrays, merge the arrays and then calculate the median

• OOPs basics include concepts like encapsulation, inheritance, polymorphism, and abstraction

• Example: Median of [1, 3] and [2] is 2.0
Answered by AI
Add your answer

Logical reasoning questions was there

Q1. Tell me about yourself? From which institute you have done your schooling and college? What are your strengths and weaknesses? How much time did it took to come to the office?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was technical round and it was held on google meet around 1 pm

Q1. Puzzle
Given two hourglass of 4 minutes and 7 minutes, the task is to measure 9 minutes.
Add your answer
Q2. Technical Questions
What is multithreading ?
What is diamond problem ?
He asked some technical questions related to my projects
Add your answer
Q3. Maximum Sum Rectangle
You are given an M X N matrix of integers ARR. Your task is to find the maximum sum rectangle.
Maximum sum rectangle is a rectangle with the maximum value for the sum of integers pr...read more
Ans. Brute force
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Medium

It was managerial round and took place around 3 pm

Q1. OS Questions
Producer Consumer Problem using Semaphores
What is Banker's algorithm?
What is Belady's Anomaly ?
Add your answer
Q2. Infix to Postfix
You are given a string EXP which is a valid infix expression. Convert the given infix expression to postfix expression.
Infix expression is of the form a op b. Where operator is is betwe...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered by CodingNinjas
Add your answer