CBNITS Intern Interview Questions and Answers

Some sql questions were given to solve

English amplitude question asked

Q1. Basic question on HTML css
Add your answer
Q2. Basic of HTML code
Add your answer

20 questions in 20 minutes

Q1. Introduction and CV based
Add your answer

Simple Aptitude test 1 hr

An aptitude test to filter out some more people

Round duration - 90 minutes
Round difficulty - Easy

It was just after the first round in the morning

Q1. 
Huffman Coding Challenge
Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...read more
Ans. Optimized Solution
We will be dividing our solution into three parts for better understanding. We will use a Min-Heap to build a binary tree and then traverse the binary tree to assign Huffman codes to each element.
 
 
1. Understanding the need of using a Min-Heap 
A basic idea would be to sort the frequency array and repeatedly give the smallest not used code to the character having maximum frequency. This ide...read more
Answered Anonymously
View 1 more answer

Round duration - 90 Minutes
Round difficulty - Medium

1 hr after the second round got over and results were announced in the morning.

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 using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

10 A.M in the morning.
The interviewers were very knowledgeable and humble

Q1. 
Unique Element In Sorted Array
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told about bitmasking approach.
Step 3 : I them them Binary Search approach(the most optiimsed one)
Step 4 : They told me to code it and run test cases.
Answered Anonymously
Add your answer
Q2. 
Find Nodes at Distance K in a Binary Tree
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told them about Binary tree approach
Step 3 : They told me to code it and dry run and run test cases.
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was after the first technical interview round.
Got a mail for the second interview round .
Timings approx 12 AM

Q1. 
Remove BST Keys Outside Given Range
Given a Binary Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...read more
Ans. 
Step 1 : Brute force array conversion approach.
Step 2 : Delete a node in a tree approach.
Step 3 : Optimised the above approach to delete only specified nodes to achieve the answer
Step 4 : Coded the approach and ran the test cases provided
Answered Anonymously
Add your answer
Q2. 
Inorder Successor in a Binary Tree
Given an arbitrary binary tree and a specific node within that tree, determine the inorder successor of this node.
Explanation:
The inorder successor of a node in a bi...read more
Ans. Inorder Traversal
• The fact that all the data values are unique makes the solution look very intuitive.
• We can simply store the inorder traversal of the given tree in some data structure, most probably arrays, and find the element present after the given node in the array.
• For inorder traversal, we can write a simple recursion code, where for every node, its left subtree is visited recursively, and then the node is visited...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Got a call from Hr after clearance of the first 2 rounds.
Timing were 5:30 P.M

Medium level coding questions on hackerrank ,1:30hr, topic- Array , DP , Matrix , Binary Search

Q1. Was Asked to Implement Hashmap and Question on OOPS and Dbms , SQL and Indexing
Add your answer

Q1. Brief Introduction
Add your answer
Q2. Rotten Oranges and basics of bfs and DFS
Add your answer