MNC Group Software Engineer Interview Questions and Answers for Freshers

Q1. MVC , C#, ASP.net
Add your answer

Q1. Managerial question
Add your answer

The test carried 7 sections of aptitude with no negative markings and the questions were also easy with time duration of 1 hours which was to be used for the coding round also

Basic understanding was checked, if basics are clear of DSA and computer science fundamentals then very easy to crack

Q1. Questions about Resume
Add your answer
Q2. High Level Discussion about tools like Kafka, Redis, Mongo
Add your answer

Design a working nodejs portfolio platform with api's and some condition

It was basic aptitude along with java MCQ

Q1. Core java, SpringBoot
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

Q1. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. 
This is a straight forward application of Floyd Warshal algorithm
Answered by CodingNinjas
View 1 more amswer
Q2.  Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b, you need to check if these n...read more
Ans. 
This was a modified version of DFS on tree and storing the results in a dp to avoid recalculation.
Answered by CodingNinjas
View 2 more amswers

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

Q1. Nodes In Complete Binary Tree
You are given the root of a complete binary tree, you need to calculate the number of nodes in the given complete binary tree.
A complete binary tree is a tree in which all...read more
Ans. 
The basic solution of this problem is easy. You just need to do a level order traversal of the tree and wherever you find the first vacant spot, you can enter the node there.
The trick was to find the optimal solution. You need to use the property of almost full binary tree. Knowing the value of the node to enter, you can directly eliminate one side of the tree and just traverse the other side of the tree.
Answered by CodingNinjas
View 2 more amswers
Q2. Rearrange Array Numbers to form Largest Possible Number
You are given an array(ARR) of length 'N', consisting of non-negative integers. Using only these given numbers, rearrange the numbers in such...read more
Ans. 
This was a standard array manipulation problem. You just need to find the cases that should be satisfied by the second largest number.
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

Q1. DBMS Question
Interviewer asked me to explain the ACID properties and explain the rollback mechanism in DBMS.
Ans. 
Tip 1 : Focus on the basics of DBMS 
Tip 2 : Try applying the DBMS concepts on the problems at hand.
Answered by CodingNinjas
Add your answer

70 minutes test, and 4 questions

Q1. Behavioural Queston
Add your answer

Round duration - 100 minutes
Round difficulty - Easy

Test started at 04:00 PM sharp and complete the same by 06:00 PM.
The test duration is 1 hour 40 minutes.
Environment (Amcat) is user friendly.
Web cam and mic were enabled

Q1. Longest Palindromic Subsequence
You have been given a string ‘A’ consisting of lower case English letters. Your task is to find the length of the longest palindromic subsequence in ‘A’.
A subsequence is ...read more
Ans. Recursive Approach
The main idea behind this approach is to use recursion. The idea is to compare the first character of the string A[i..j] with its last character. There are two possibilities:
1. If the first character of the string is the same as the last character, we include first and last characters in the palindrome and do a recursive call for the remaining substring A[i + 1, j - 1].
2. If the last character of the string...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Ways To Make Coin Change
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 45 minutes
Round difficulty - Hard

Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly

Q1. Maximum Sum of nodes in a binary tree such that no two nodes are adjacent
You have been given a binary tree with an integer value associated to each node. You are supposed to choose a subset of these nodes...read more
Ans. Using Memoization
Keeping in mind the fact that both node and its children can not be considered for the maximum sum at the same time, we know that if we take a node into our sum, then we will directly call recursively for its grandchildren, OR if we don't take the node into our consideration, we will call for its child nodes and finally consider the maximum sum from both these results.
 
Considering the above idea, ...read more
Answered by CodingNinjas
View 1 more amswer
Q2. Basic Puzzles
There are 3 mislabeled jars, with apple and oranges in the first and second jar respectively. The third jar contains a mixture of apples and oranges. You can pick as many fruits as required to...read more
Add your answer