I have given only ist round which is based on dsa in that round there is 3 questions abd level of that question is a very good . The questions are basucally from array and the concept is used sliding window ,dp .
Interview questions [1]
Question 1
Find maximum length of subarray in such a way where arr[i]- arr[i+1]=1.
It was smooth. Only standard DSA questions were asked. The interviewer was very helpful and overall experience was great. You must solve DSA questions and brush up on your core computer subjects like OS, DBMS etc.
First step, pass the infosys hackathon. Then only one interview. and After that you get the response within 20 days of the interview.
Question are as follow:
Some questions on DP, Core subject questions and one puzzle.
Interview questions [1]
Question 1
One question was on DP and then some core question.
Find maximum profit a thief get by robbing the house with these 2 conditions:
1) house is in circular position.
2) you cannot rob two adjacent house.