I appeared for the Infosys Specialist Programmer (SP) / Digital Specialist Engineer (DSE) interview at KIET College on 20th November.
1. Online Assessment
Before the in-person rounds, there was an online assessment consisting of around 3–4 coding questions (I don't remember the exact number since it was conducted months ago).
I managed to solve approximately 1.5 questions.
2. In-person Coding Round
The in-person coding round was conducted at KIET College. We were given 4 questions of varying difficulty levels: Easy, Medium, Hard and Hard, according to my assessment.
These are the questions I can remember. The actual statements might vary slightly because I don't remember their exact wording.
Q1. (Easy-Medium)
We were given N chairs and an array chair, where chair[i] represents the colour of a chair.
We had to arrange these chairs into stacks under the following conditions:
A stack can contain chairs of only one colour.
Chairs of colour 0 can be stacked on top of chairs of any other colour.
Each stack can contain at most H chairs.
We had to find the minimum number of stacks required to arrange all the chairs.
Q2. (Medium)
A variation of LeetCode 452 – Minimum Number of Arrows to Burst Balloons.
Q3. (Hard)
A lengthy Dynamic Programming problem. Unfortunately, I cannot recall the exact statement.
Q4. (Hard)
I don't think I even opened this question.
My coding round results:
| Question | Test cases passed |
|---|
| Q1 | 10/12 |
| Q2 | 11/12 |
| Q3 | 6/12 |
| Q4 | 0/12 |
| Total | 27/48 |
3. Technical Interview Experience
One thing I want to mention is that my interviewer was extremely friendly and cooperative. This helped me overcome my nervousness, and I was able to think and explain my approaches more clearly.
Initially, I was given two coding questions, and I had to solve one within approximately 25–30 minutes.
The description of the first question was quite lengthy, and honestly, I got intimidated just by looking at it. So I skipped it and moved to the second question.
Q1. (Easy-Medium)
We were given an array, and we had to construct the longest possible increasing sequence by picking elements only from the leftmost or rightmost end of the array.
Every new element we picked had to be greater than the previously selected element.
We had to return the maximum length of such a sequence.
I managed to solve this question in around 10–15 minutes.
After that, the interviewer went for a coffee break, I guess, and returned after approximately 10 minutes.
He first took a selfie with me and my laptop screen, showing my code and the test cases passed window.
Then he took my resume, went through it for around 10–20 seconds, and here's where things took an unexpected turn.
Most candidates who appeared before me told me that they were asked questions from their resumes and core CS subjects.
However, instead of asking questions from my resume, the interviewer put my resume aside and took a sheet of paper and wrote down three DSA problems.
Q2. Merge Two BSTs
He drew two Binary Search Trees and asked me to explain my approach to merging them.
I explained my approach, but when he asked a follow-up question, I struggled to come up with a working solution.
Q3. Sliding Window
He gave me a Sliding Window problem and asked me to write the pseudocode and identify the subarrays satisfying the given condition.
I explained the total number of subarrays, but my answer was incorrect. He then explained the correct answer and asked me to write down all the valid subarrays.
Q4. Implement Queue Using Two Stacks
I was able to explain the correct approach and write the pseudocode for implementing a queue using two stacks.
Q5. Another Sliding Window Problem
He then gave me another Sliding Window problem and asked me to write its optimal code.
I managed to implement it correctly, and the interviewer seemed satisfied with my solution.
After that, he told me that my interview was over and I could leave.
He didn't ask the usual "Do you have any questions for me?" Instead, he gave me some feedback himself.
He advised me to focus more on SQL because he had asked me an SQL question at the beginning of the interview, which I couldn't solve. I hadn't even mentioned SQL as a skill on my resume, so I wasn't expecting it.
4. Questions Asked to Other Candidates
I also collected some questions that were asked to other candidates:
SQL: Find the Nth highest salary in each department using window functions. This question was asked to me and around four other candidates. Some additional SQL questions involving window functions were also asked.
Sorting algorithms: Logic and working of Quick Sort and Merge Sort.
AI-related questions: Candidates who mentioned AI-related projects or skills on their resumes were asked questions related to them.
5. My Questions
Considering my overall performance, I'm not sure what to expect.
Coding assessment: 27/48 test cases passed.
Interview coding question: Solved successfully.
BST follow-up: Explain the correct approach for the first one but struggled on follow-up.
Sliding Window: Made mistakes in one question but solved the next one optimally.
Queue using two stacks: Explained the correct approach.
SQL: Couldn't solve the question as I don't know it much and also I told the interviewer it is not mention on my resume.
What do you guys think? Do I still have a chance of getting selected ?