Recently, I participated in the interview process for SRIB. Here is my experience:

Round 1 (Online test):
This was an online coding round in which we were supposed to solve 3 problems in 70 minutes.

Q1. Given a 2D matrix, sort the given matrix row wise (i.e. sort every row of the matrix).

Q2. Given a binary tree, replace the value of every node by the sum of all values of the left subtree and right subtree, excluding the node itself. (Note: Cant allocate any extra memory).

Q3. Given an array, find the subsequence with the maximum sum following the property that no two elements should be from two adjacent indexes of the array.

I was able to solve all the questions very quickly. Since many people were able to solve all the problems, the shortlisting for the interviews was done on the basis of the efficiency and readability of the code. I was selected for the interviews.

Round 2 :
This was a technical interview round of 40 minutes. The interviewer was really supportive. He started with a brief introduction about himself and then asked for my introduction. He then asked me some questions about my college life, my locality, about my interest in Computer Science, etc. After that, he moved on to my projects and we had a detailed discussion on it. He then asked about my favourite subjects in my B.Tech course. I told him about OOPS, Data structures and C programming.
Question related to OOPS:
Q1. Explain diamond problem.
Q2. Difference between abstraction and encapsulation.
Q3. Significance of protected visibility label in class.

There were some more questions on OOPS. I am not able to recall the exact questions that he asked in the remaining 2 sections but the questions of Data structures were easy to answer, the C programming questions were relatively difficult.
After this, he started to ask about some famous deep learning algorithms like Gradient descent with momentum, Convolutional networks, activation functions and their significance and stuff like that. I was able to answer almost all the questions.
Finally, he asked me a simple puzzle which I was able to solve.

Round 3:
This round was conducted on google docs on a collaborative editor and went on for about 40 - 45 minutes. He asked me 2 coding questions.
Q1. Given a string formed by concatenating the strings "one" and "two" any number of times in any arbitary order.
Output a string by following the given condition:
If you encounter a "one", replace it with "oneone".
If you ecounter a "twotwo" replace it with "two".
Sample I/O:
Input: "onetwotwo"
output: "oneonetwo"
Q2. Given a binary tree, write a program to output its level order traversal in reverse order (i.e. greatest level nodes will be the first to be printed).

In both the questions, I was asked to optimise the code that I have written. I was able to solve both of the questions and was also able to explain my approach to the interviewer.
Advice: Be ready for any question on your projects that you have mentioned. If you are stuck at any point, ask for hints. They will definitely help you out.
Final verdict - selected