Company Name: Infosys
Job Role: Specialist Programmer
Years of Experience Required: 0
Drive: Offcampus(Infytq)CTC: : 8 LPA
Topics: Data Structures and algorithms, Python, DBMS, OS, Computer Networks.
Duration: 1- 4 months source
Source of Preparation: Practice on various coding websites like Codechef, Codeforces, Atcoder, HackerEarth, etc. Computer fundamental subjects from various youtube channels.
- Check Striver’s SDE Sheet for Interview Preparation.
- Check the ultimate resume-building guide for coding interviews.
- Blind 75 Leetcode
Infosys(Infytq) Interview Rounds
Online Qualifier: You can read more about this round here.
Final Round: This is also an online round. The 2 programming questions asked in this round would be a cakewalk if you have done coding in Python/Java (Your Choice)
Advantage Round: This is also an online round. The 3 programming questions asked in this round are tougher than the previous round. I do not clearly remember the problems. But 1 of them was a Dynamic Programming problem and I struggled to solve that problem and solved it after around 1 hour. the 2nd one is easier, around CF div2 B. 3rd one seemed easiest, but was only able to solve 4 test cases. Get 218/300.
Topics asked: Data Structure and algorithms, Computer Networks, Operating System, DBMS.
Problems: 2 problems were asked.
- Problem Statement: A 2D array is given.
Input Format: A= [[1,2,3], [4,5,6],[7,8,9,10]], L=”1.1” R=”2.1” You have to return all elements from 1st element of 1st row to 1st element of 3rd row inclusive.
There was also a second part of the question where he asked if he removed “.” from L or R then we should take the entire row.
- Problem Statement: Design Hashmap. I have given the linear probing solution.
Then he asked me various questions from Deadlock, Page Fault, TCP, UDP, Normalisation, Denormalisation etc.
Message to Aspiring Students:
You have to have a good hold on either Python or Java and DBMS to clear initial rounds. After that, you should read all Computer Fundamental Subjects and practice Leetcode M-H problems.