Round - 1 (Hackerrank Test)

1.Aggressive Cows

2.Given N(total nodes) and two arrays consisting the edges, for each acyclic graph, add nodes in graph, calculate the square root and add all square roots.
Ex: [1,2,3] [4,7,8] N=10

Round - 2 (Technical(Programming round) Interview in Hackerrank )

1. Given an array and k operations, in each operation replace a number with half of it. After k operations, return the sum of array that is minimum
   Ex: [1,2,4] k=3
   k=1 -> 1 2 2
   k=2 -> 1 2 1
   k=3 -> 1 1 1 -> Sum=3

2. Given a source and distance, in a 2d array containing blocks which breaks if we reach adjacent to it twice, return true if there exists a path

3. The keyboard have only 3 keys, K,L,A and performs 3 operations ctrl-A(select all), crtl-C(copy), ctrl-V(paste). Return the maximum number of KLA words that can be formed for a given N.
   Ex: N=6
   Words = 2 -> KLA ctrl-A ctrl-C ctrl-V
   N=8
   Words = 4-> KLA ctrl-A ctrl-C ctrl-V ctrl-V ctrl-V

Round - 3 (Technical Interview in Hackerrank)

1. Given an array with min length of 8, choose 2 groups of 2 numbers such that in each group, the two numbers must not be adjacent. Multiply the numbers in both groups and subtract one from other. Maximize this result
   Ex: 2,1,3,4,8,6,7,9
   2 groups -> 1,4 & 6,9 -> Diff = 54-4 = 50

2. Given a 2d sorted array, sorted in rows and sorted in columns, return a 1d array that is sorted

3. Find the absolute sum b/w consecutive elements in array and add it. Replace all occurrences of given number in the array and repeat the procedure.

Round - 4 (LLD)

1. Difference between CTYPE map and STL map
2. Hashing concept and how to avoid collisions in hash function
3. Design restaurant billing system
4. Design Excel sheet.
5. Some questions on SOLID principes.

Round - 5 (HM)
Discussion focused on current job & some situation based questions

Round 6 (HR)
Basic questions. They don't ask salary expectations.
But offers a best compensation according to them.