Innovaccer Software Developer Intern Interview Questions and Answers

Mcqs on os,dbms,cn oops,dsa

Q1. Diameter of tree,2 sum, sliding window
Ans. 
The question covers topics like tree diameter, 2 sum problem, and sliding window technique.
• For the diameter of a tree, you can use depth-first search (DFS) or breadth-first search (BFS) to find the longest path between any two nodes.

• The 2 sum problem involves finding two numbers in an array that add up to a given target. You can use a hash table or two pointers approach to solve it efficiently.

• Sliding window technique ...read more
Answered by AI
Add your answer
Q2. Diameterof tree
Add your answer
Q3. Two sum
Add your answer
Q4. Slding window
Add your answer

Q1. Sort array of 0,1,2 oops quesions
Ans. 
Sort an array of 0s, 1s, and 2s in ascending order.
• Use the Dutch National Flag algorithm to sort the array in a single pass.

• Maintain three pointers: low, mid, and high.

• Swap elements based on their values and move the pointers accordingly.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.

Round duration - 60 minutes
Round difficulty - Medium

The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.

Q1. 
Sum of N-Digit Palindromes
Determine the sum of all N-digit palindromes for a given integer 'N'. A palindrome is defined as a number that remains the same when its digits are reversed.
Example:
Input:
...read more
Ans. 
Run a loop from 10^(n-1) to 10^(n) – 1 and check when the current number is palindrome or not. If it is, adds its value to answer.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.

Round duration - 100 Minutes
Round difficulty - Hard

**Criteria:
8 CPI or Above (only CSE, MnC). All students irrespective of history of backlogs or current backlogs were considered if they satisfied the CPI criteria.

It was first round..
This round was the Online test which was around 1 Hour 40 Minutes long(don't remember exact time).

Timing from 19:00 to 20:40
Environement was comfortable.
Hackerrank is a good platform for online tests.

All questions were new for me, So cant give any links.

Q1. 
Minimum Removals Problem Statement
Given an integer array ARR of size N and an integer K, determine the minimum number of elements that need to be removed so that the difference between the maximum and mi...read more
Add your answer
Q2. 
Minimum Number of Stabs to Kill the King
You are given the initial health of a king represented by an integer N. Your task is to determine the minimum number of stabs required to reduce the king's health ...read more
Add your answer
Q3. 
Minimum Time Problem Statement
In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...read more
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on zoom. Interviewer shared codepad link and you were asked to code and pass sample test case given by interviewer. Only one question(coding) was asked(More follow questions).
Interviewer was really helpful..

Q1. 
XOR Query Problem Statement
Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.
There are two types of que...read more
Add your answer

Round duration - 90 Miinutes
Round difficulty - Medium

Again pattern was same(Zoom video call and I was asked to code and 1 question was there(+Follow up)).
Timing was afternoon time around 13:00

Q1. 
Scramble String Problem Statement
You are given an integer 'N' and two strings S and R, each having the size N. Determine if you can scramble string S to obtain string R using specified operations.
Your ...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a zoom video call.
In starting 5 minutes, interviewer tried to make me comfortable with him..

Round duration - 75 minutes
Round difficulty - Medium

2 coding questions

Q1. 
Check if Binary Search Tree (BST)
Given a binary tree with 'N' nodes, verify whether this tree is a Binary Search Tree (BST). Return true if it is a BST and false otherwise.
Definition:
A Binary Search ...read more
Add your answer
Q2. 
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
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Q1. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

It was conducted in the evening at around 7:00 p.m.
The hackerrank environment is clearly the best for conducting coding exams as it provides a decent interface for debugging and testing purposes.
There were 3 questions- 1 of easy level and 2 of medium level.

Q1. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Add your answer
Q2. 
Ways to Arrange Balls Problem
You are given 'a' balls of type 'A', 'b' balls of type 'B', and 'c' balls of type 'C'. Determine the total number of ways to arrange these balls in a straight line so that no...read more
Add your answer
Q3. 
Longest Common Subsequence of Three Strings
Given three strings A, B, and C, the task is to determine the length of the longest common subsequence across these three strings.
Explanation:
A subsequence ...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round was conducted on CodePair platform which provides a IDE along with a video call for interviews.
There were 2 interviewers and both were friendly.
I was first asked about the various subjects I have studied in my curriculum. Then I was asked about my favourite programming language to which I answered Python.
After this, they asked various confusing questions based on function calling, argument passing and pass by object reference concept in Python. 
Then they asked about the implementation of dictionary in Python and wanted me to design one with the help of lists(arrays) and optimize its search, add and delete operations. (Could be done with hashing and probing).
Then they asked questions from subjects like Computer Architecture and Theory of Computation (Basic questions were asked so you should just remember the key topics in the subject).

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

This was a pure coding round consisting of three questions where time allotted for one easy question was 15 minutes while the other two questions were to solved in 30 minutes each.
total time = 15+30+30= 75 minutes

Q1. 
Binary Ones Count Problem
Develop a program to determine the number of '1's in the binary form of a given integer.
Input:
The input consists of a single line containing an integer N.
Output:
The outpu...read more
Add your answer
Q2. 
Longest Increasing Subsequence Problem Statement
Given 'N' students standing in a row with specific heights, your task is to find the length of the longest strictly increasing subsequence of their heights...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

There were 2 interviewers and the round was carried out on code pair platform of HackerRank

Q1. 
Candy Distribution Problem Statement
Prateek, a kindergarten teacher, needs to distribute candies to his class. Each child has a performance grade, and all students stand in a line.
The rules for distrib...read more
Add your answer