J S S Academy of Technical Education, Bangalore Placement Interview Questions

Round duration - 70 minutes
Round difficulty - Easy

• Q1. Parth's OCD Challenge Parth, a budding programmer, has received an array 'ARR' of 'N' positive integers. His OCD is triggered whenever an odd number appears at...read more
  View Answers (1)
• Q2. Find All Occurrences in Matrix You are provided with a matrix of characters, CHARACTER_MATRIX of size M x N , and a string WORD . Your goal is to locate and di...read more
  Add Answer
• Q3. Print Nodes at Distance K from a Given Node Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K fro...read more
  Add Answer

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Diagonal Traversal of a Binary Tree Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal....read more
  Add Answer
• Q2. Binary Tree Diameter Problem Statement Given a binary tree, determine the length of its diameter. The diameter is defined as the longest path between any two e...read more
  Add Answer

Round duration - 50 minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Next Greater Element Problem Statement Given a list of integers of size N , your task is to determine the Next Greater Element (NGE) for every element. The Nex...read more
  Add Answer
• Q2. Subset Sum Equal To K Problem Statement Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K. Provi...read more
  Add Answer

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Buy and Sell Stock Problem Statement Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' ...read more
  Add Answer

Round duration - 45 minutes
Round difficulty - Medium

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Diagonal Traversal of a Binary Tree Given a binary tree of integers, find its diagonal traversal. Refer to the example for clarification on diagonal traversal....read more
  Add Answer
• Q2. Binary Tree Diameter Problem Statement You are given a Binary Tree, and you need to determine the length of the diameter of the tree. The diameter of a binary ...read more
  Add Answer

Round duration - 45 Minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Next Greater Element Problem Statement Given a list of integers of size N , your task is to determine the Next Greater Element (NGE) for every element. The Nex...read more
  Add Answer
• Q2. Subset Sum Equal To K Problem Statement Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K. Provi...read more
  Add Answer

Round duration - 45 Minutes
Round difficulty - Medium

The nature of the interviewer was very kind, helped me when I stuck. The test was proctored, our webcam and mic were on, and shared my screen.

• Q1. Buy and Sell Stock Problem Statement Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' ...read more
  Add Answer