SimplifyVMS Software Developer Intern Interview Questions and Answers

Q1. Implement stack Data structure
Add your answer
Q2. Basic C++ and OOPS concepts
Add your answer

Interview was for about 30 mins . One easy level question was asked on array.
Q. Given a string. If on rearranging the characters of string it can become palindrome then return true else false.
Some follow up questions were asked on the implementation of the solution.

Q1. Why do you want to join us?
Add your answer
Q2. Where do you see yourself in next 5 yeas?
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing was 10 AM. Platform is very good.

Q1. 
Lazy Santa Problem Statement
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance...read more
Ans. 
Find the minimum distance Santa must travel to distribute 'K' gifts to 'K' different children standing in a straight line.
• Sort the array 'distance' in ascending order to simplify the problem.

• Calculate the distance between each adjacent child and find the minimum sum of distances for 'K' gifts.

• Keep track of the minimum sum of distances as you iterate through the array.
Answered by AI
Add your answer
Q2. 
Valid String Problem Statement
Given a string S consisting solely of the characters '(', ')', and '*', determine if it is a valid string.
Definition of Valid String:
1. Every left parenthesis '(' must h...read more
Ans. 
Determine if a string consisting of '(' , ')' and '*' characters is valid based on given rules.
• Iterate through the string and keep track of the count of left parentheses, right parentheses, and stars.

• Use a stack to keep track of the positions of left parentheses.

• If at any point the count of right parentheses exceeds the count of left parentheses + stars, the string is invalid.

• If after iterating through the string, ther...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10 AM. Platform is very good.

Q1. 
Lazy Santa Problem Statement
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance...read more
Ans. 
Find the minimum distance Santa must travel to distribute 'K' gifts to 'K' different children standing in a straight line.
• Sort the array 'distance' in ascending order to simplify the problem.

• Calculate the distance between each adjacent child and find the minimum sum of distances for 'K' gifts.

• Keep track of the minimum sum of distances as you iterate through the array.
Answered by AI
Add your answer
Q2. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if a given string consisting of parentheses is balanced or not.
• Use a stack data structure to keep track of opening parentheses

• Iterate through the string and push opening parentheses onto the stack and pop when encountering a closing parenthesis

• If at the end the stack is empty, the string is balanced, otherwise it is not
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing was 10 AM. Platform is very good.

Q1. 
Lazy Santa Problem Statement
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance...read more
Ans. 
Find the minimum distance Santa must travel to distribute 'K' gifts to 'K' different children standing in a straight line.
• Sort the array 'distance' in ascending order to simplify the problem.

• Calculate the distance between each adjacent child and find the minimum sum of distances for 'K' gifts.

• Keep track of the minimum sum of distances as you iterate through the array.
Answered by AI
Add your answer
Q2. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if a given string consisting of parentheses is balanced or not.
• Iterate through the characters of the string and use a stack to keep track of opening parentheses.

• When encountering an opening parenthesis, push it onto the stack. When encountering a closing parenthesis, check if it matches the top of the stack.

• If the stack is empty at the end or if there are unmatched parentheses, the string is no...read more
Answered by AI
Add your answer