Netaji Subhas Institute of Technology (NSIT) Placement Interview Questions

The topic of GD was Social media pros and cons

• Q1. If USD1 equals to INR1, then what will be its impact on the Indian economy?
  View Answers (1)
• Q2. What happens if cigarette banned by the govt. in India?
  View Answers (1)

• Q1. Since, I am a Mechanical engineer, so, there were questions related to different engines; questions related to my project, internships, etc.
  Add Answer

Round duration - 70 minutes
Round difficulty - Medium

• Q1. Find All Pairs Adding Up to Target Given an array of integers ARR of length N and an integer Target , your task is to return all pairs of elements such that th...read more
  Add Answer
• Q2. Shortest Path in a Binary Matrix Problem Statement Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a sourc...read more
  Add Answer

Round duration - 75 minutes
Round difficulty - Medium

First explained the approach to the interviewer. He was satisfied with the discussions and asked me to write code.

• Q1. Special Binary Tree Verification Determine whether a given binary tree is 'special'. A binary tree is defined as 'special' if every node either has zero or two...read more
  Add Answer

Coding Rond consisted of 3 questions

• Q1. 1. Data structures and algorithms
  View Answers (1)
• Q2. 2. Computer fundamentals
  Add Answer
• Q3. Revise all cs fundamentals
  Add Answer

Round duration - 90 mintues
Round difficulty - Easy

Nice environment everything went good.

• Q1. Sum of LCM Problem Statement Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N. The sum...read more
  Add Answer
• Q2. Vertical Order Traversal Problem Statement Given a binary tree, return the vertical order traversal of the values of the nodes in the tree. In a vertical order...read more
  Add Answer

Round duration - 90 minutes
Round difficulty - Hard

It was a tough round focus on the key concepts

• Q1. Stack with getMin Operation Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minim...read more
  Add Answer

Round duration - 90 mintues
Round difficulty - Easy

The round contain 20 MCQ and 2 coding questions.

• Q1. Jar of Candies Problem Statement You are given a jar containing candies with a maximum capacity of 'N'. The jar cannot have less than 1 candy at any point. Giv...read more
  Add Answer
• Q2. Fitness Test in Indian Navy Problem Statement The selection process in the Indian Navy includes a fitness test conducted in seawater, where a group of 3 traine...read more
  Add Answer

Round duration - 45 mintues
Round difficulty - Easy

Easy question where asked basic type like what is difference between inteprator and compiler. Method to prevent deadlock and best way to implement Fibonacci series.

• Q1. Nth Element Of Modified Fibonacci Series Given two integers X and Y as the first two numbers of a series, and an integer N , determine the Nth element of the s...read more
  Add Answer
• Q2. Reverse Alternate Nodes in a Singly Linked List Given a singly linked list of integers, you need to reverse alternate nodes and append them to the end of the l...read more
  Add Answer

Round duration - 120 minutes
Round difficulty - Easy

The coding round was at 11 am in the morning. The questions were of medium level. The questions were purely based on Data Structures and Algorithms.

• Q1. Sliding Maximum Problem Statement Given an array of integers ARR of length 'N' and a positive integer 'K', find the maximum elements for each contiguous subarr...read more
  Add Answer
• Q2. Longest Substring with At Most K Distinct Characters Given a string S of length N and an integer K , find the length of the longest substring that contains at ...read more
  Add Answer

Round duration - 45 minutes
Round difficulty - Easy

I was selected for the interview. The interview was conducted early in the morning at 10 am. The interviewer was very friendly and calm.

Round duration - 30 minutes
Round difficulty - Easy

This round was a mix of technical, puzzles and HR. The interview was fairly easy, The interviewer asked for my introduction and continued with the interview then.

• Q1. Stack using Two Queues Problem Statement Develop a Stack Data Structure to store integer values using two Queues internally. Your stack implementation should p...read more
  Add Answer

Round duration - 45 minutes
Round difficulty - Easy

This was the last round for getting selected as an intern. However, this was a pure technical round. Only coding questions were asked. Also, at the end he asked me the question, Why American express?

• Q1. Detect and Remove Loop in Linked List For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the m...read more
  Add Answer
• Q2. Interval List Intersection Problem You are provided with two sorted lists of closed intervals, INTERVAL1 and INTERVAL2 . A closed interval [x, y] (x < y) si...read more
  Add Answer

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

• Q1. Kth Largest Element Problem Statement Given an integer array and a number 'K', your task is to identify the kth largest element within the array. Input: The in...read more
  Add Answer
• Q2. Maximum Sum Path from Leaf to Root Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all r...read more
  Add Answer

Round duration - 55 minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

The test was a mix of quant, technical and behavioural questions
Test level- Moderate
Qualification criteria- Minimum marks in technical section

• Q1. Technical Round- SI vs CI difference/ Diesel vs Otto Cycle EV future Questions related to my fav subject Projects in college
  Add Answer
• Q2. HR Round- Why Hero About profile Future vision Family background Difficulty Level- Easy
  Add Answer

Round duration - 90 minutes
Round difficulty - Easy

Timing - 10AM-11:30AM
Online proctored test

• Q1. Binary Tree Right View Problem Statement Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes ...read more
  Add Answer
• Q2. 0/1 Knapsack Problem Statement A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the...read more
  Add Answer

Round duration - 45 minutes
Round difficulty - Medium

Timing : 4PM-5PM
Environment - Online

There was a panel of 3 interviewers

• Q1. How can you find the size of an array in C or C++ without using sizeof or any standard function?
  Add Answer
• Q2. Explain how indexing in a database works using B+ trees.
  Add Answer

Round duration - 45 mintues
Round difficulty - Easy

Timing - 11AM-12:15PM
Environment - online video call

Again there was a panel of 2 senior engineers

• Q1. Maximum Path Sum Problem Statement You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to ...read more
  Add Answer