Skip to content

Interview Experience 170

Jump to bottom
pkkp86nitd edited this page Sep 15, 2019 · 1 revision

2019

Software Development Engineer FTE

"Round 1:(Online Coding Round )

It was hosted on Mettl.

There were 2 programming questions and 30 MCQ’s of programming fundamentals.

Round 2:(Technical 1)

43 Students were shortlisted. This round was for 40 mins and had to answer two programming questions.

1.Initially there’s a sorted array and some clockwise or anti-clockwise rotations are made, So, how many number of clockwise rotations are to be made to make it sorted.

2.Given a Binary Search Tree (BST), modify it so that all greater values in the given BST are added to every node .

link: https://www.geeksforgeeks.org/add-greater-values-every-node-given-bst/

Made some errors in edge cases in question 1 and later they were rectified.

Technicla 1 went well and shortlisted to Technical 2.

Round 3:(Technical Part 2)

This round was for 60 mins and had to answer two programming questions(mostly DS).

  1. Find the kth largest element in a stream of integers.

  2. Implement a queue which can enque, deque, delete and search in O(1)

    Implemented the first question using C++ STL and interviewer was expecting to solve with a heap from scratch.

    Asked to implement heapify and removing a element from heap functions.

Round 4:(Technical Part 2)

1.Given a binary array(consisting of only ones and zeroes) and an integer k. Assume every index of an array as a city and one represents there’s a water plant in that city. One water plant can supply water to the left k cities and right k cities. So how many number of water plants are to be picked so that every city can have water supply. If it isn’t possible print -1.

            Ex: Input => A = [0, 0, 1, 1, 0, 0, 0] and k = 3 
                  Output => 1(we can pick water plant at index three)

    Initially gave a brute force solution. Later gave some approaches but they failed. 

    Asked questions on semaphores, threads, sync and async methods, difference between fork and thread.

Round 5:(BR Round)

8 students were shortlisted. This round happened for one hour.

Discussed about internship projects in detail for 40 mins.

A programming question was asked.

1.Initially there was a full binary tree and children of some nodes are deleted. Return the initial level whose children are deleted. If the tree is full binary tree then return -1.

Round 5:(Extra Round)

One extra round was taken for me for 50 mins. Asked one programming question. Given a list of dates and values associated to that dates. A date is given as an input, If that date is found in the list return the value associated to it, if it isn’t found return the value of date which is just before the given date.

Gave a solution using c++ STL map. Asked a question about every map function I used there. Asked to say about map implementation details(hashing with chains and hashing with RGB trees). Was asked to implement own find(), get(), insert() functions using trees for the above question.

Result: Selected.

"

Clone this wiki locally