System Engineer TCS interview experience | Anonymous

Interview rounds

Round

Medium

Video Call

Duration45 minutes

Interview date4 Jul 2022

Coding problem2

I was around morning at 11 they have started with introduction then started with python basics to advance. Given one problem to solve it was easy fibbonace series. Then asked about numpy and pandas and the Django concept like MVT then reast API.

1. Fibonacci Member

Easy

0/40

Asked in companies

Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.

Problem approach

I have solved using recursion

Try solving now

2. Convert binary tree to mirror tree

Easy

15m average time

85% success

0/40

Asked in companies

Given a binary tree, convert this binary tree into its mirror tree.

A binary tree is a tree in which each parent node has at most two children.

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

Note:

1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.

Try solving now

Round

Easy

HR Round

Duration30 mintues

Interview date7 Jul 2022

Coding problem1

Basics HR question.

1. Basic HR Questions

Why do you want to join us?
Where do you see yourself in three years?
What are your strengths and weaknesses?

System Engineer

Interview preparation journey

Are you ready for your Dream Job?

Interview rounds

1. Fibonacci Member

Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.

2. Convert binary tree to mirror tree

Given a binary tree, convert this binary tree into its mirror tree.

A binary tree is a tree in which each parent node has at most two children.

Mirror of a Tree: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged.

Note:

1. Basic HR Questions