Round 1 (Hacker rank) :

1. Positional elements
2. https://leetcode.com/problems/unique-paths/

Solved both.

Round 2 (Coderpad) :

1. https://leetcode.com/problems/first-unique-character-in-a-string/
2. Given a list of students with their scores in different subjects find the student with a max average score.

Solved both.

Round 3 (Coderpad) :

1. From a 2D array with only 0s and 1s, find the row with maximum 1s and the count. Each row is sorted. (Solved)
2. From an array, find all the subsets whose sum is 0. (Explained the brute force approach, tried to do through recursion).

Round 4 (Design) :

1. Design for an e-commerce site. (Messed up this. I had to do both LLD and HLD. Explained and did both, but probably wasn't clear enough).
2. Print leaf nodes of a binary tree. (Solved)
3. Boundary traversal of binary tree. (Solved)

For the last 2, only explaining algorithm and pseudo code was enough.

Round 5 (Hiring Manager) :

1. General work and project related stuff.
2. https://leetcode.com/problems/implement-queue-using-stacks/

I think the issue at my end was that I didn't prepare well for design round and gave some sort of vague approach only. If you are attending / planning on attending prepare the commonly asked questions well, that would definitely help.