Infosys OnCampus Interview Experience for DSE/SP role

infosys logo
infosys
· DSE/SP
September 9, 2026 · 2 reads

Summary

I interviewed for a DSE/SP role at Infosys, solved multiple coding and SQL problems, but struggled with a few string tasks and was advised to improve my problem‑solving skills.

Full Experience

Before the interview there was an OA which was held in my clg campus itself. There were 4 problems, out of which we should solve 3. They shortlisted everyone who solved atleast 1 problem fully. They didn't seperate SP/DSE based on this OA, jst shortlisted for interview.

My Interview Experience

  1. First they gave me a laptop where I was given 2 problems and I should solve any 1 within 30 mins. The problems were pretty easy and basic array, sliding window and hashmap kinda problems.I solved 1 and half problem within 20 mins and my coding round was done. These were the problems : Assign Cookies but the parity of cookie and children greed should be same and I couldn't find the other problem but something like count of unordered pairs where i < j and code[i] = code[j] and j-i <= k

  2. Now the interview started properly. He first asked self intro where I mentioned I solved some X problems in DSA and this was also in my resume, so he gave me a problem on paper and asked to write pseudo code and solve it. This was the problem : given a string S = "absdsdf" and S1 = "fab", check if S1 exists in any of the rotated variations of S. Though it was a pretty easy problem, in the interview I fumbled and couldn't come up with the logic. I was thinking of DP and sliding window and overengineering. He was very disappointed at this point. Then he gave me another problem : given a string S = "abc", find the subset of all the subsequences of the S. He asked to code the brute approach with $$O(2^n)$$ and I fumbled again. I immediately wrote a for loop and then realised recursion might be better and in the process took some time to think and the interviewer asked to leave the problem.

  3. Now he asked me to write an sql query for the following : there is products table with productId, deptId, price and then there is transaction table with productId, deptId, transactionDate, price, status. Now I need to find, for every day, for each department, the count of successful transactions.. Now I wrote some query with left join which was good enough, it might not be perfect but seemed good enough and he was okay with it.

  4. Now he started questioning about the skills I mentioned in my resume, projects and grilled me on every word that I mentioned like basic definitions of AWS, Docker, RAG, Vector databases, javascript specific questions, etc all from my resume only. He asked some scenario based questions like how would you troubleshoot server connection issues, how would you handle concurrency in javascript, how would you ensure human in the loop for agents, etc. I answered all of the decently.

  5. Now he asked me 2 more dsa problems - Product of array except self and Longest subtring without repeating character. I solved both of them.

This concluded the interview. His feedback for me was to improve my problem solving skills.

I was not even asked one questions about CS fundamentals, work experience, LLD, HLD or behavioural hr things.

This was just my experience, not what others might've went through. The excessive DSA questions is purely because of me mentioning I solved some X problems and couldn't solve a basic problem he first asked. If I would've solved that problem, maybe there wouldn't have been so many other probelms asked.

Interview Questions (7)

1.

Assign Cookies with parity constraint

Data Structures & Algorithms·Easy

Given an array of cookie sizes and an array of children's greed factors, assign cookies to children such that the parity (even/odd) of the cookie size matches the parity of the child's greed. Maximize the number of satisfied children.

2.

Count unordered pairs within distance k

Data Structures & Algorithms

Given an array code[] and an integer k, count the number of unordered pairs (i, j) such that i < j, code[i] = code[j] and j - i ≤ k.

3.

Check rotated variation substring

Data Structures & Algorithms

Given a string S and a pattern string S1, determine whether S1 appears as a substring in any rotation of S.

4.

Generate subset of all subsequences of a string

Data Structures & Algorithms

Given a string S, generate the set containing every possible subsequence of S (the power set of subsequences). Implement the brute‑force approach with O(2^n) complexity.

5.

Daily successful transaction count per department

Other

Write an SQL query to return, for each day and each department, the count of successful transactions. The schema includes a products(productId, deptId, price) table and a transaction(productId, deptId, transactionDate, price, status) table where status indicates success.

6.

Product of array except self

Data Structures & Algorithms·Medium

Given an integer array nums, return an array output where output[i] is the product of all elements of nums except nums[i] without using division and in O(n) time.

7.

Longest substring without repeating characters

Data Structures & Algorithms·Medium

Given a string s, find the length of the longest substring without repeating characters.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!