Status: Fresher, B.Tech CS[2020 Batch]
Round 1: Written Test [Two sections] [90 minutes]
Section A:
This section was having 2 programming output, 2 time-complexity question, 2 DBMS query question, 1 programming MCQ, 1 Computer Network MCQ[related to subnet]. In total there were 8 questions. Level of difficulty was very-easy to easy.
Section B:
This section was having 3 programming question, all required to write full code with well defined time-complexity and space complexity
Problem 1.
Difficulty Level : Easy
Given a string, you can delete character as many you want, displace the character wherever you want, you have to return maximum length of palindrome that can be formed.
Problem 2.
Difficulty Level: Easy-Medium
Given a maze-matrix. Every cell can have two values 0[blocked] or 1[free]. One cell has value 2[starting point] and one cell has value 3[destination point]. You have to find that is it possible to find a way from 2 to 3.
Problem 3.
Difficulty Level: Medium
Given an array of positive numbers.
arr = [1,2,3,4,5]
Select the ith element. Multiply it with (i-1)th and (i+1)th element and add this value to K. Remove this ith element from array. Repeat above untill all elements are not removed. For corner elements, consider 1 as their side elements. You have to return maximum K possible.
For eg. For above the maximum K possible is 60+30+10+5+5
Around 600-700 students give this written test. Only 9 students could make it.
Round 2: Technical Interview-1 [70-90 minutes]
They asked questions about your resume, what you've done, questions about DBMS.
These are:
i) Design Database schema for fully automated system for ordering food at restaurant. And different questions while designing it.
ii) What is URL shortener? [In this they want to see your problem solving skills]
iii) Some OS questions like Deadlocks.
Round 3: Technical Interview-2 [70-90 minutes]
They asked mainly DS Algo and DBMS theory questions.
i) Given an array of integers, add a given value to a range of [l,r] of array many times. Finally return the maximum value in array after above changes.
ii) Given flight routes. For eg. [[A,B],[A,C],[B,C],[B,D],[D,E]]. You have to tell, is there any route possible to visit all flight. If possible, give all routes in lexicographical order.
iii) Given two sentence of space separated words. But words in 1 sentence may or may not exactly present in 2 sentence. You have to tell whether these are same sentence or not. Order of words are not needed to be same.
iv) Given an array, find 4 elements whose sum is given number.
v) What is ACID properties.