This round was conducted on hackerrank and total 6 questions are there. 3 coding questions, 2 MCQ and 1 database design question.

Given a string 'S'and we will perform repeated deletion whenever a substring "AWS" is encountered. The remaining prefix and suffix will then be joined after deletion. For example: S = "ABCDAAWSWSFG , ABCDAAWSWSFG => ABCDAWSFG => ABCDFG
Find the resultant string after performing repeated deletion(possibly zero times). 
I solved it using stack.
Based on binary search, similar to Coco Eating Bananas on Leetcode, only the language is changed.
Ad Hoc problem, can be solved by making some observations. I can't remember the exact question but if you attend contests regularly on CP sites then you will be able to solve it easily.

Both MCQ are based on Graph. In both of the questions, DFS and BFS traversals are given and I have to tell whether they are correct or not.

Design a database for the Music school, the database must follow the requirements listed below

A music instrument can be played by any number of students
A student can play different types of music instruments
Teacher can only teach one instrument

After a quick introduction about me and the interviewer, he directly jumped into the coding questions. 
The questions are:

Delete nth node from the end of the linked list.
Write function to convert the decimal number to binary number using recursion.
SQL queries based on some hypothetical senerios.
 

After a quick introduction, he directly asked my to show one of my best project and explain the necessary details like technologies used, features of your project etc. 
He didn't interrupted me while i was explaining, after I am done explaining he asked me questions related to ReactJS as my project is built on it. He asked about HTTP status code, different classes of status code, and the status code which i have faced the most while implementing the project.
After this he pasted a DSA questions in the google doc and only asked the approach to solve the problem. The problem is the classical DP problem(Longest Palindromic Substring). He first asked me to explain what a palindromic substring is, then tell the approach. I first explain the brute force approach then optimised the solution using DP.
After that he asked 4-5 SQL queries based on some hypthetical senerios.
He also asked my some basic operating system questions.