Malviya National Institute of Technology (NIT), Jaipur Placement Interview Questions

Round duration - 45 minutes
Round difficulty - Hard

Round was scheduled in the early afternoon hours most probably from 1 to 2 on hackerrank.

• Q1. BST to Greater Tree Problem Statement Given a binary search tree (BST) with 'N' nodes, the task is to convert it into a Greater Tree. A Greater Tree is defined...read more
  Add Answer
• Q2. Ninja and Binary String Problem Statement Ninja has a binary string S of size N given by his friend. The task is to determine if it's possible to sort the bina...read more
  Add Answer

Round duration - 40 minutes
Round difficulty - Medium

This round was conducted on Code Share platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 25th August and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.

• Q1. Spiral Order Traversal of a Binary Tree Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree. Input: The inpu...read more
  Add Answer

Round duration - 80 minutes
Round difficulty - Easy

This round was scheduled in the evening hours around 7pm at Hackerrank platform and all the participants were required to fill a form which was shared 2 days prior to the test date. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

• Q1. Ways To Make Coin Change Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value us...read more
  Add Answer
• Q2. Find the Duplicate Number Problem Statement Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, a...read more
  Add Answer

Round duration - 45 minutes
Round difficulty - Hard

This round was conducted on Zoom platform. I was shared the invitation link one day prior to the interview and also was told the name of my interviewer. I looked at the profile of the interviewer at linked.in and got a better understanding of what kind of person he was and prepared accordingly. The round was scheduled at 3 :00 pm on 20th August and I was eagerly waiting for the clock hands to reach 3 o'clock since morning and finally I went in front of him after wearing a white shirt and a black coat over it along with a tie over it.

• Q1. First Negative Integer in Every Window of Size K Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous ...read more
  Add 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 2 + y ...read more
  Add 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 arra...read more
  Add 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...read more
  Add 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 specifi...read more
  Add Answer

Round duration - 75 minutes
Round difficulty - Easy

Smooth platform of Hackerrank.
Nice user interface.

• Q1. 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 ->...read more
  Add Answer

Round duration - 75 minutes
Round difficulty - Hard

It was a coding round on Hackerrank.

• 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 ; otherw...read more
  Add 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 ->...read more
  Add Answer

Round duration - 90 minutes
Round difficulty - Hard

Timings of the round were early evening around 7 o'clock.
It was help on hackerearth.

• Q1. Check if Two Trees are Mirror Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other. Explanation: Two t...read more
  Add Answer

English reasoning aptitude+ core subjects

• Q1. Mass and energy balance + mass and heat transfer+ past experience related+ fluid dynamics
  Add Answer