Round 1: Online Hackerrank round (90 minutes)
- Find number of Positional Elements
- 0/1 Knapsack problem. The problem required you to print the exact order of the items taken into the knapsack.
Round 2: Online Coderpad round
- Given a string ” A B A B C A B A B C D”, you have to compress it into the following format:
A B * C * D.
Here, till A B * of the output, A B repeats twice, but till A B * C *, A B A B C repeats twice. I could not solve this and went to next question.
- Given a matrix of numbers, the task was to collect the maximum numbers possible when going from bottom left corner of the matrix to top right corner of the matrix. The only two directions you can move are up and right. I was able to solve this.
The interviewer told me that HR will get to you. But I don’t think I have impressed him enough for the call of next round to be honest.