ACKO was visited our campus and here is my experience of 2 round out of 3 round :-
Out of 100 students only 21 selected for first round and I was one of them.

Round 1:-

• Interviewer started with his introduction and then I also introduced myself. They he begin with somes with my resume questions like my work in summer internship that I had done, projects that I have made etc. questions were like why you used this tech stack what are alternatives , If you want to make version-2 of it what modifications you will made, etc.
• Then started basic questions with 2 Sum standard questions I only told me brute force approach and he agree but he didn't asked me to optimize it I don't know why??
• Then he moved to next questions which was - Given some array which is storing the information of each car i.e arr[i]=[xi,yi,wi]. where (xi,yi) is position of ith car having wi weight.
  Also given Truck having initial position (xt,yt) and with capacity to hold cars cap.Initially truck is in the garage. Now you have to bring all cars from their position to garage it truck is full it can't hold anymore car. So it has to go back to garage dump all cars and go again to bring the cars. You have to tell what is minimum distance the truck has to travel so that it brings all cars from their position.
  Then I told my approach and he asked some questions I write the code for it also.
  Then interviewer end up the interview by asking "DO you have any questions?"
  I asked few questions.

Result - [selected for Round 2 (Again DSA round)]

Round 2:-

This round again started with intro of both of us.Then deep resume grinding everything from experience to personal projects.
After he presented 1 questions which was similar to this Link.
Than I told him my approach.

Then he asked one more DSA questions which was like this-

You are standing a some point and there is an enemy who want's to kill you. Enemy has various ways to reach till you position.
for example:- Let enemy initially at point A and you initially at B. Then enemy can visit points adjacent to A and then again some point adjacent to previous point etc till he reaches your point and kills you. Now you have to block the routes so that you can protect yourself. Each edge have some cost assigned to it which you have to pay to remove it. You have to find the minimum cost to remove edges so that you are able to protect yourself.

Result -> !! Rejected !!