Krishna Computer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Medium

It was in the morning around 8:00AM-8:30AM. Platform used for this round was hackerrank. Coding questions were of moderate level.

Q1. 
Count Diagonal Paths
You are given a binary tree. Your task is to return the count of the diagonal paths to the leaf of the given binary tree such that all the values of the nodes on the diagonal are equa...read more
Ans. 
Count the number of diagonal paths in a binary tree with equal node values.
• Traverse the binary tree and keep track of diagonal paths with equal node values.

• Use recursion to explore all possible paths in the tree.

• Count the number of paths where all nodes on the diagonal have the same value.

• Handle cases where the tree has missing children denoted by -1.
Answered by AI
Add your answer
Q2. 
All Root to Leaf Paths in Binary Tree
You have a binary tree containing 'N' nodes labeled from 1 to 'N'. Your objective is to enumerate every path from the root to each leaf.
A leaf is defined as a node wi...read more
Ans. 
The task is to print all the root to leaf paths of an arbitrary binary tree.
• Traverse the binary tree using depth-first search (DFS) algorithm

• Maintain a current path list to keep track of the nodes in the current path

• When reaching a leaf node, add the current path to the result list

• Recursively explore the left and right subtrees

• Remove the last node from the current path after exploring each subtree
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

It was in the evening around 4:00PM-4:20PM. Platform used for this round was skype. Interviewer was very calm in questioning.

Round duration - 40 minutes
Round difficulty - Medium

It was in the early morning. Questions was mostly from aptitude and coding based.

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. 
Count the total number of subsequences in which all elements are equal in an integer array.
• Iterate through the array and count the frequency of each element.

• Calculate the total number of subsequences for each element using the formula (freq * (freq + 1) / 2).

• Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

It was in the afternoon period and it was very competitive.

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to solve this problem efficiently.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum value in the array as the result.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was late night. Interviewer was asking tricky questions to confuse me

Round duration - 25 minutes
Round difficulty - Easy

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. 
Count the total number of subsequences in which all elements are equal in an integer array.
• Iterate through the array and count the frequency of each element.

• Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1)) / 2.

• Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Answered by AI
Add your answer

Round duration - 10 Minutes
Round difficulty - Medium