Infosys System Engineer Specialist Interview Questions, Process, and Tips

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Space Survival Game Challenge
Ninja is in space with unlimited fuel in his super spaceship. He starts with a health level H and his spaceship has an armour A. Ninja can be on only one of the three planets...read more
Ans. 
Determine the maximum time Ninja can survive in a space survival game challenge.
• Create a function that takes initial health and armour as input for each test case

• Simulate Ninja's movement between planets and update health and armour accordingly

• Keep track of the maximum time Ninja can survive before health or armour reaches 0
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to finish.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid loops.

• Return all valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
M-Coloring Problem Statement
Given an undirected graph as an adjacency matrix and an integer M, determine whether you can color the vertices of the graph using at most M colors such that no two adjacent v...read more
Ans. 
The M-Coloring problem involves coloring the vertices of a graph using at most M colors such that no two adjacent vertices share the same color.
• Check if the graph can be colored using at most M colors without adjacent vertices sharing the same color.

• Use backtracking or graph coloring algorithms to solve the problem efficiently.

• Ensure that the number of colors used is less than or equal to M.

• Consider constraints such as...read more
Answered by AI
Add your answer
Q2. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Ans. 
The task is to find the shortest path from a starting house to a destination house in an unweighted graph representing a city.
• Implement a function to find the shortest path from house 'S' to house 'T' in an unweighted graph.

• Use a graph traversal algorithm like Breadth First Search (BFS) to find the shortest path.

• Return a list of house numbers indicating the shortest path from 'S' to 'T'.

• Check if the output path is vali...read more
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Medium

Round 1 - Coding Contest on HackerEarth (Elimination round)
Number of questions - 3 ( Level - leetcode Medium)

Q1. 
Palindrome Partitioning Problem Statement
You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...read more
Ans. 
Partition a string into palindromes
• Use backtracking to generate all possible palindrome partitions

• Check if each substring is a palindrome before adding to the partition

• Return all valid partitions as an array of strings
Answered by AI
Add your answer
Q2. 
Rearrange the Array Problem Statement
You are given an array/list NUM of integers. Your task is to rearrange the elements of NUM such that no two adjacent elements are the same, or determine if it is not ...read more
Ans. 
The task is to rearrange an array such that no two adjacent elements are the same.
• Iterate through the array and check if any adjacent elements are the same

• If adjacent elements are the same, swap one of them with a different element

• Repeat the process until all adjacent elements are different
Answered by AI
Add your answer
Q3. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to determine the total number of ways to make change for a specified value using given denominations of coins.
• Create a dynamic programming table to store the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the table accordingly based on the current denomination.

• The final value in the table will represent the total number of ways to make change...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

first round was mcq based on aptitude,dbms and output based questions

Q1. DBMS
theory questions and SQL
Ans. 
DBMS theory questions and SQL
• DBMS stands for Database Management System

• SQL is a standard language for accessing and manipulating databases

• Normalization is the process of organizing data in a database

• Primary keys uniquely identify each record in a table

• Foreign keys establish relationships between tables
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

it was coding as well as mcq round

Q1. 
Reset Matrix Problem Statement
Given a 2D array ARR with 'N' rows and 'M' columns, where each element is either 0 or 1, your task is to transform this matrix into a 'Good' matrix. A 'Good' matrix is one i...read more
Ans. 
Transform a 2D array into a 'Good' matrix by setting rows and columns to 0 if a 0 is found.
• Iterate through the matrix to find 0s

• For each 0 found, set all elements in its row and column to 0

• Update the input matrix accordingly
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Round duration - 180 minutes
Round difficulty - Easy

Q1. 
Print Diagonal Elements of a 2D Matrix
Given a 2D matrix, your task is to create and return a 2D vector that contains all elements of the matrix arranged in a diagonal fashion.
Input:
The first line con...read more
Ans. 
The task is to create and return a 2D vector containing diagonal elements of a given 2D matrix.
• Iterate through the matrix diagonally to extract elements

• Store the elements in a 2D vector in the required order

• Handle cases where the matrix is not square by adjusting the diagonal traversal
Answered by AI
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

It was in the late afternoon since it was virtual location and environment didn't affected that much, interviewer was very friendly he asked how my day went and then went on starting with my introduction.

Round duration - 180 Minutes
Round difficulty - Medium

This round consists of objective and hands-on questions that are needed to be answered within 3 hours. You have to score 65% or above in this round to be eligible for a job interview at Infosys.

Q1. 
Distinct Strings With Odd and Even Swapping Allowed Problem Statement
You are provided with an array of strings, and your objective is to determine the number of unique strings within it.
A string is deeme...read more
Ans. 
Given an array of strings, determine the number of unique strings that cannot be transformed into another string by swapping characters at odd or even indices.
• Iterate through each string in the array and check if it can be transformed into another string by swapping characters at odd or even indices.

• Keep track of unique strings that cannot be transformed and return the count.

• Example: For array = ["abcd", "cbad", "bdac"...read more
Answered by AI
Add your answer
Q2. 
Ninja Technique Problem Statement
Implement a function that determines whether a given numeric string contains any substring whose integer value equals the product of two consecutive integers. The functio...read more
Ans. 
Implement a function to determine if a numeric string contains a substring whose value equals the product of two consecutive integers.
• Iterate through all possible substrings of the input string.

• Calculate the integer value of each substring and check if it equals the product of two consecutive integers.

• Return 'True' if such a substring is found, otherwise return 'False'.
Answered by AI
Add your answer

Round duration - 180 Minutes
Round difficulty - Hard

This exam has 3 coding Questions – Easy( 50 points), Medium (75 points), Hard (100 points), total 225 points, and the points are assigned according to the number of test cases you pass

Q1. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s seen so far.

• If the current element is 0, consider flipping the sub-array from the previous 1 to the current 0.

• Update the maximum count of 1s if flipping the sub-array results in a higher count.

• Return the maximum count of 1s obtained after considering all poss
Answered by AI
Add your answer
Q2. 
Glowing Bulbs Problem Statement
You have an infinite number of electric bulbs, each assigned a unique integer starting from 1. There are 'N' switches, each labeled with a unique prime number. When a switc...read more
Ans. 
Given an array of prime numbers representing switches and an integer K, find the Kth glowing bulb when all switches are turned on.
• Iterate through each prime number in the array and calculate the number of bulbs that will glow for each prime number.

• Keep track of the total number of glowing bulbs as you iterate through the array.

• Once the total number of glowing bulbs exceeds or equals K, calculate the Kth glowing bulb ba...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Basic Introduction and detailed discussion on the projects, after that i was given some basic coding problems and after that some discussion on Oops and detailed discussion on Database,
Interviewer was cool and being supportive so overall it was a good experience.