Company: Infosys
Role: Specialist Programmer L3
Years of Experience : 0 (Fresher)
Mode: Oncampus
College: Tier 3
Year of Graduation: 2026

Infosys came to my college oncampus for hiring of DSE / SP L1,L2,L3 roles

Round 1 : Online Assessment (Offline Round): January 19, 2026

Online assessment questions:

1. Based on prime factorization and optimization
   Q) find max sum subarray with conditions like prime factors of product should be m , bitwise & should be <=x , and few conditions -
   I precomputed prime factors and solved it (12/12 Testcases)

2. 2d dp similar to LIS but with different conditions
   Q ) maximum number of gates u can take based on some conditions of 2 arrays - used LIS type of dp (12/12 Testcases)

3. bfs + matrix + geometry
   Q ) transaction states , 2d points , centroid , some formulas , find the sequence with highest score (12/12 Testcases)

4. tree+ dp + backtracking + bitwise -
   Q) tree , take par and child get some score , if all bits r taken some score , if few are taken some score , etc, take m nodes and maximise score (6/12 Testcases)

I solved 3 full and 4th question 6/12 testcases
Got shortlisted for Specialist Programmer L3 Interview
Results were announced on January 20, 2026

Round 2: Interview (January 21, 2026 - Infosys Office Offline)

DSA Questions -

1. Given some coins , use minimum no of coins (you may pick one coin infinite times) to sum up to the target sum.(Medium)
   Interviewer asked me explain approach and solve it on pen paper
2. given 2 sorted arrays , let n = size of first array , m = size of 2nd array , re arrange the elements in such a way that the elements in array1 are all lesser than elements in array 2 , and both array 1 and array 2 is sorted (Don't use inbuilt sort functions or extra space)(Hard)
   Interviewer asked me to code this on notepad
3. Given a sentence , sort the words in them based on their size and if size is same , sort them based on their lexicographical order.(Easy)
   Interviewer asked me to code this in online compiler

Questions:

1. CAP Theorem
2. How does SQL and Redis follow CAP Theorem
3. Fragmentation in OS and types
4. Design patterns - Singleton , Factory , etc
5. SQL vs No SQL
6. Uber ER Diagram and system design discussion
7. Deep dive in my project, APIs used , authentication method and the interviewer asked me to draw the system architecture of it.
8. SQL Query to print first_name , middle_name , last_name combined as full_name , but middle and lastname may have NULL Values.
9. Discussion on ranks in Coding contests and achievements
10. Stack vs Heap memory in C++
11. Discussion on current internship

Verdict : Selected for Specialist Programmer L2

Some Tips:

• Focus on CP Style / Leetcode Hard for OA Round (DP,Graph,Greedy) - For context I am Guardian in Leetcode & Expert on Codeforces , So I naturally felt more comfortable in OA and interview DSA questions.
• Focus on AI, DSA, System Design, Core CS for Interview Round
• Emphasize more on AI/ML Projects if you have
• Be Confident