Krishna Computers Pvt. Ltd interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Krishna Computers Pvt. Ltd

2 rounds | 3 Coding problems

Rajesh

Fresher | Dec 2020

Selected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Dynamic Programming, OOPS, Algorithms, Data Science

Tip

Tip 1 : Do practice as much as possible.
Tip 2 : Focus on skills rather than more on memorising.

Application process

Where: Referral

Eligibility: No Backlogs

Resume tip

Tip 1 : It should not be too long or too short.
Tip 2 : Do not put false things on resume.

Interview rounds

Round

Medium

Online Coding Test

Duration30 minutes

Interview date2 Dec 2020

Coding problem2

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

1. Count diagonal paths

Easy

20m average time

80% success

0/40

Asked in companies

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 equal.

Note:

A diagonal traversal Consider lines of slope -1 passing between nodes.
         1
       /    \
     4        2
    /  \        \
   8    5         3
       /  \       /
      9    7      6

Example: Here potential diagonals are: 
1 -- 2 -- 3
4 -- 5 -- 7 -- 6
8 -- 9 -- 7

For Example

Input: 

     5
  /  \
 6      5
  \       \
   6       5

Output: 2 

Explanation: 

Diagonal 6 – 6 and 5 – 5 contains equal value. Therefore, the required output is 2.

Try solving now

2. All Root to Leaf Paths in Binary Tree.

Moderate

25m average time

70% success

0/80

Asked in companies

You are given an arbitrary binary tree consisting of 'N' nodes numbered from 1 to 'N'. Your task is to print all the root to leaf paths of the binary tree.

A leaf of a binary tree is the node which does not have a left child and a right child.

For Example :

Given a binary tree :

All the root to leaf paths are :
1 2 4
1 2 5 
1 3

Note :

1. Two nodes may have the same value associated with it.
2. The root node will be fixed and will be provided in the function.
3. Note that the nodes in a path will appear in a fixed order. For example, 1 2 3 is not the same as 2 1 3.
4. Each path should be returned as a string consisting of nodes in order and separated by a space.
5. The path length may be as small as ‘1’.

Try solving now

Round

Easy

Video Call

Duration20 minutes

Interview date22 Dec 2020

Coding problem1

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