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
It’s christmas and Santa is here with ‘K’ gifts. There are ‘N’ children in the park who are standing in a straight line, and not crowding up due to COVID restrictions. You are given an array “di...read more
Ans. Brute Force
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other. 
 
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...read more
Answered by CodingNinjas
Add your answer
Q2. Valid String
You have been given a string 'S' containing only three types of characters, i.e. '(', ')' and '*'.
A Valid String is defined as follows:
1. Any left parenthe...read more
Ans. Brute Force
We can try each of the three possibilities for every asterisk in the string with the help of recursion. 
 
We will use a temporary string which will keep track of our current possible string. In the end, we can linearly check each possible string. If any of the possible string is a valid string, we print ‘Yes’, otherwise ‘No’.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the length of the str...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10 AM. Platform is very good.

Q1. Lazy Santa
It’s christmas and Santa is here with ‘K’ gifts. There are ‘N’ children in the park who are standing in a straight line, and not crowding up due to COVID restrictions. You are given an array “di...read more
Ans. Brute Force
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other. 
 
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...read more
Answered by CodingNinjas
Add your answer
Q2. Valid Parentheses
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &...read more
Ans. Valid Parenthesis
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
 
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
 
Pseudo Code:
• Decla...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing was 10 AM. Platform is very good.

Q1. Lazy Santa
It’s christmas and Santa is here with ‘K’ gifts. There are ‘N’ children in the park who are standing in a straight line, and not crowding up due to COVID restrictions. You are given an array “di...read more
Ans. Brute Force
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other. 
 
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...read more
Answered by CodingNinjas
Add your answer
Q2. Valid Parentheses
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &...read more
Ans. Valid Parenthesis
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
 
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
 
Pseudo Code:
• Decla...read more
Answered by CodingNinjas
Add your answer