Infosys private limited interview experience Real time questions & tips from candidates to crack your interview

Specialist Programmer

Infosys private limited

3 rounds | 4 Coding problems

Aakash Kumar Chaudhary

Experienced | Feb 2022

Selected

Interview preparation journey

Journey

I graduated from LNCT, Bhopal in 2023 with multiple technical internship experiences with startups. I worked on my DSA as well as development skills including Node.js, JS, React, and Flutter.

Application story

Applied through HackwithInfy by Infosys in January 2022. The Advanced coding round was in March, the Interview was in April 2022 and the results were in July 2022.

Why selected/rejected for the role?

I was selected due to my consistent performance in DSA rounds and interviews. Being Strong in data structures and algorithms is a must for being selected as Specialist Programmer at Infosys. Additionally, knowledge of your previous internship experiences adds to the impression of being a good Software Engineer.

Preparation

Duration: 4 months

Topics: Data Structures, OOPS, Dynamic Programming, Graphs, C++, Trees, Linked List

Tip

Tip 1: Having good Projects or Internships is a must for fresher
Tip 2: Maintain a strong grip over medium-level problems in coding websites across all topics
Tip 3: Practice communicating your thoughts and solutions in technical terms

Application process

Where: Campus

Eligibility: Prefinal year students

Resume tip

Tip 1: Have Projects and Internships
Tip 2: Write things you perfectly know

Interview rounds

Round

Easy

Online Coding Interview

Duration90 minutes

Interview date20 Feb 2022

Coding problem0

There were easy MCQ questions based on computer science fundamentals and 2 simple coding problems to be solved using Java/C++.

Round

Hard

Online Coding Test

Duration180 minutes

Interview date10 Mar 2022

Coding problem2

This Round had a collection of 3 problems which were Medium, Medium-Hard and Hard problems.

1. Prefix sum and Sliding window

Moderate

20m average time

80% success

0/80

Asked in companies

The Problem was based on Prefix sum and Sliding window

Problem approach

I was able to understand the problem in 10 minutes and then code and submit it in the next 5 minutes. I had a strong grip on problems related to Sliding windows which helped in solving this problem.

Try solving now

2. Longest Increasing Subsequence

Moderate

0/80

Asked in companies

The Problem was based on Dynamic Programming. It was a harder version of the Longest Increasing Subsequence problem.

Problem approach

This was an unseen type of problem and hard to solve. I tried multiple approaches with the greedy method which max reached to 15% of test cases passed. The intuition of DP was due to its similarities with the LIS problem. It took me 1 hour to solve the problem.

Try solving now

Round

Medium

Face to Face

Duration90 minutes

Interview date30 Apr 2022

Coding problem2

The interview started with my introduction and some questions related to my previous experiences. He asked some questions related to DBMS, OS, and OOP. He then moved to a DSA question which was similar to a Leetcode medium problem and took me 20 minutes to solve. He asked about the internal workings of Binary Search and then asked for a dry run of the Dijkstra algorithm

1. Lexicographically Smallest Non-Palindromic String

Easy

20m average time

80% success

0/40

Asked in companies

Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string is not a palindrome and that it is the lexicographically smallest one possible. Return the resulting string. If there is no way to replace a character to make it not a palindrome, return an empty string.

Problem approach

I solved similar problems alot in contests, so I was able to understand the crux of problem and proposed a greedy solution to the interviewer. Then I wrote the code in notepad.

Try solving now