SDE - 1 PayU interview experience | Aman Kumar

Interview rounds

Round

Easy

Online Coding Interview

Duration90 minutes

Interview date4 Sep 2019

Coding problem1

Nice environment

1. Zig Zag Traversal

Easy

15m average time

85% success

0/40

Asked in companies

You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the given tree.

Note:

In zigzag order, level 1 is printed from left to right fashion, level 2 is printed from right to left. and level 3 is printed from left to right again, and so on…..

For example:

For the given binary tree

The zigzag  traversal is [1, 4, 3, 5, 2, 7, 6]

Try solving now

Round

Medium

Face to Face

Duration90 minutes

Interview date5 Sep 2019

Coding problem2

Nice Environment

1. Find prime numbers

Easy

15m average time

80% success

0/40

Asked in companies

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

Try solving now

2. Technical Question

Use of DBMS in my project and explain how i handle the problems

SDE - 1

Interview preparation journey

Interview rounds

1. Zig Zag Traversal

You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to print the zigzag traversal of the given tree.

Note:

For example:

1. Find prime numbers

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

2. Technical Question