Dr. B.R. Ambedkar National Institute of Technology (NIT), Jalandhar Placement Interview Questions

Round duration - 90 minutes
Round difficulty - Medium

Basically a hackerrank link was shared and I was suppose to take the test within a day. Online Test comprised of 3 algorithmic Questions. Duration of round was 90 minutes.
 

• 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
  View Answers (1)
• Q2. Longest Increasing Subsequence Problem Statement Given an array of integers with 'N' elements, determine the length of the longest subsequence where each eleme...read more
  View Answers (1)

Round duration - 70 minutes
Round difficulty - Medium

It was a 60 minute virtual face 2 face round with 2 senior software engineers of the company. Interview started with brief introduction by the engineers followed by my Introduction. Interview started at 3:00 P.M and lasted till 4:10 P.M. Google Doc was used for coding purposes.

• Q1. Search Element in a Rotated Sorted Array Given a sorted array that has been rotated, the task is to find the index of a specific element. The array is initiall...read more
  View Answers (1)
• Q2. Construct Binary Tree from Parent Array Representation Given an array parent which represents a binary tree, the parent-child relationship is defined by (PAREN...read more
  View Answers (1)

Round duration - 60 minutes
Round difficulty - Medium

It was a face 2 face algorithmic round taken by Senior Backend engineer. Interview Round Started at around 2:00 P.M and lasted till 3:05 P.M. Interview started with the brief introduction followed by 2 algorithmic questions. Interviewer was focusing problem solving skills. After discussing the approach, Coding part was to be done on google doc.

• Q1. Maximum Path Sum in a Matrix Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell...read more
  View Answers (1)
• Q2. Partition Equal Subset Sum Problem Given an array ARR consisting of 'N' positive integers, determine if it is possible to partition the array into two subsets ...read more
  View Answers (1)

Round duration - 120-130 minutes
Round difficulty - Medium

It was a face 2 face round which was taken by Line manager. Interview started at 11:00 A.M and lasted around 2 hours approx. Interviewer was very friendly and supportive. Interview started with brief introduction of the interviewer followed by mine. Then a System design question was asked by the interviewer over google doc. Interviewer was focusing on how I'm approaching the problem. Overall It was a good experience.