I applied through an employee referral. The process took 3 weeks. I interviewed at Infosys in Dec 2022
Interview
Medium DSA problem and questions on back-end , DBMS , Front end. Depends on the technology you are experienced with. Be ready to explain everything with an example and solve practical questions on all topics.
The interview had 2 live coding questions. One medium question and One hard question. Also had questions on OOPS, Java, C++. It went on quite well as I made the Interviewer satisfied with my performance.
Interview questions [1]
Question 1
Object Oriented Programming questions, Java questions, C++ questions
I applied online. The process took 3 months. I interviewed at Infosys (Poona) in Oct 2022
Interview
Application I applied online. The process took 4 weeks. I applied on 6th Oct 2022 and was interviewed online on 29 Oct 2022 Interview I applied on the Infosys career page and got their reply within 20 days. Usually, they msg via WhatsApp-bot or a robot-phonetic call in which they ask if you are shortlisted and whether you are interested in the opportunity or not. If, yes then they will schedule an interview. (This is round 1: Technical Round 1) Within a week after the first round, I got a reply that I have been selected for the next round NOTE: In between, they regularly sent updates or any urgent notifications via email or WhatsApp so be a bit active because in between they will ask for your documents too, such as latest compensation/offer letter. (This is round 2: Technical Round 2) Within a week got the result of round one and the very next week my next interview was scheduled. The last round is the HR round which might happen after 2-3 weeks after Round 2 (if u have cleared it).
Q: Given two sorted arrays: Sample Input: A = [1, 5, 9, 11, 13] B = [3,6,7,10,12, , , , , ,] (contains space to accommodate array A elements) Sample Output: B = [1,3,5,6,7,9,10,11,12,13] Write a function that accepts two arrays (A&B) and returns a single merged sorted array B without using Arrays. sort or Collection. sort. Assume that Array B will always have additional space to accommodate Array A elements.