Software Engineer Envecon interview experience | Avni Mittal

Interview rounds

Round

Medium

Online Coding Interview

Duration120 minutes

Interview date1 Jan 2019

Coding problem1

1. Rotate array

Easy

25m average time

80% success

0/40

Asked in companies

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

Try solving now

Round

Medium

Face to Face

Duration20 minutes

Interview date3 Jan 2022

Coding problem1

1. Bubble Sort

Easy

10m average time

90% success

0/40

Asked in companies

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

Bubble Sort implementation for the given array:  {6,2,8,4,10} is shown below :-

Problem approach

Optimization techniques were asked...and determining complexity

Try solving now

Round

Medium

HR Round

Duration10 minutes

Interview date7 Jan 2019

Coding problem1

1. Basic HR Question

Able to relocate, travelling is not a issue

Software Engineer

Interview preparation journey

Interview rounds

1. Rotate array

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

1. Bubble Sort

Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.

You are given an unsorted array consisting of N non-negative integers. Your task is to sort the array in non-decreasing order using the Bubble Sort algorithm.

For Example:

1. Basic HR Question