Netaji Subhas Institute of Technology (NSIT) Placement Interview Questions

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

• Q1. Combination Sum Problem Statement Given three integers X , Y , and Z , calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each d...read more
  View Answers (1)
• Q2. Longest Path In Directed Graph Problem Statement Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are num...read more
  View Answers (1)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

• Q1. Factorial Trailing Zeros Problem You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trail...read more
  View Answers (1)
• Q2. Reverse Linked List Problem Statement Given a singly linked list of integers, your task is to return the head of the reversed linked list. Example: Input: The ...read more
  View Answers (1)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

• Q1. Implementing a Priority Queue Using Heap Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy pr...read more
  View Answers (1)
• Q2. Largest BST Subtree Problem Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree). Input: The f...read more
  View Answers (1)

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

• Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
  View Answers (1)