Round was on Hackerrank platform with WebCam required.

Test Format:

3 Coding questions + 20 MCQs (7 questions based on DS,OS, SQL,Networking and 13 aptitude questions)

Duration: 1 hour 20 minutes in total, but each coding question and each section had different time allocated.

SECTION 1 : 3 Coding questions

Instruction: You cannot revisit previous coding question if you've moved to next question(with or without submitting) or if time allocated to that question is completed.

A fancy statement given for this problem

https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/ . Time given to solve: 15 minutes

Another fancy statement was given but the problem boiled down to:

Given an input matrix of sizen*n filled with integers (not necessarly sorted). From this input matrix, another matrix of same size n*n is generated, which is spirally sorted (input matrix elements are sorted and then elements are inserted in spiral order in matrix). Then you are given Q queries having target values to be searched. Have to search this target in spirally sorted matrix which we created and return the element present in input matrix at the searched index.

Example:

Input matrix:

1 4 5

2 3 9

6 8 7

Input queries: [3 , 6, 7, 8 , 2]

Output: [ 5, 8 , 6, 2 , 4]

Explanation:

Spirally sorted matrix created:

1 2 3

8 9 4

7 6 5

Query1: index of 3 in spirally sorted matrix is [0,2], corresponding element in input matrix is 5.

Query2: index of 6 in spirally sorted matrix is [2,1], corresponding element in input matrix is 8 and so on.

Time given to solve was: 15 min

Long story was given but in short problem was:

Given a string having numbers from 0-9. Let numeric value of this string be "num". Find number of ways to get a string containing all digits from 0-9 by performing following operations at most once.

a) Replace the string with number we get by dividing "num" by power(10 ,k ) for any k.

b) Replace the string with remainder of "num' on division with power(10,k) for any k.

Example input: "121234567890"

Output: 3

Explanation:

way1 : No operation, string already contains all digits from 0-9

way 2: second operation with k=10, remainder with power(10,10) is "1234567890" which contains all digits

way 3: second operation with k=11, remainder with power(10,11) is "121234567890" which contains all digits.

Input string size range: [1,1e5]

Time given to solve : 30 minutes

SECTION 2: DS, OS, Networking, DBMS, CS fundamental MCQs

Time to solve 7 question was 7 minutes.

SECTION 3: Aptitude MCQs

13 minutes for 13 questions