-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 121(Intern)
"Round 1 (online round) : Given an array of integers, print the count of all subarrays whose sum is 0. MCQ questions based on complexity and comprehensive questions on DP and binary search.
Interview rounds :
1st panel - Given a matrix, rotate it by a Given angle, which is a multiple of 90. Rainwater trapping problem. Generic questions like something about myself and why do I wish to join the company. Questions picked from CV asking about different achievements.
2nd panel - (DS) Given a forest of trees, find the optimum height at which the trees should be cut (one common height for all) such that at least K amount of wood can be received. Given a bag full of strings S and queries with 2 strings Si and Sj, find if it’s possible to achieve Sj from Si by a series of operations where each operation is changing a single character in the string, and the attained string after each operation should be in the bag. Given a dictionary full of many words, find if a word is present in that dictionary and print all words having the given word as it’s prefix. Complexities of each of these questions. Generic questions like something about myself.
3rd Panel - If no data structure exists in the world except for an array, find the repeated integers in a given array. Puzzles Situational questions "