Infosys SDE Interview Questions, Process, and Tips

July online coding test consists of 3 question pretty medium level

July -economics ,good commumication skill checks

Q1. Tell me about your self
Ans. 
I am a software engineer with 5 years of experience in developing web applications using Java, Spring Boot, and Angular.
• 5 years of experience in software development

• Proficient in Java, Spring Boot, and Angular

• Strong problem-solving skills

• Experience working in Agile development environment
Answered by AI
Add your answer
Q2. What is annotation in spring boot
Ans. 
Annotations in Spring Boot are used to provide metadata about the application's components, helping Spring to understand how to manage them.
• Annotations are used to configure Spring Boot components such as controllers, services, repositories, etc.

• Annotations help Spring Boot to automatically detect and configure beans based on the annotations used.

• Examples of annotations in Spring Boot include @RestController, @Service,
Answered by AI
Add your answer

Round duration - 180 minutes
Round difficulty - Hard

There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree

Q1. Longest Increasing Subsequence
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly ...read more
Ans. 
As there are many subproblems in the recursive solution which are solved again and again. So this problem has Overlapping Substructure property and re-computation of same subproblems can be avoided by either using Memoization or Tabulation.

The simulation of approach will make things clear: 

Input : arr[] = {3, 10, 2, 11}
LIS[] = {1, 1, 1, 1} (initially)

Iteration-wise simulation : 

arr[2] > arr[1] {LIS[2] = ma...read more
Answered by CodingNinjas
View 4 more answers
Q2. Bipartite Graph
Given a graph, check whether the graph is bipartite or not. Your function should return true if the given graph's vertices can be divided into two independent sets, ‘U’ and ‘V’ such tha...read more
Ans. 
Following is a simple algorithm to find out whether a given graph is Bipartite or not using Breadth First Search (BFS). 
1. Assign RED colour to the source vertex (putting into set U). 
2. Colour all the neighbours with BLUE colour (putting into set V). 
3. Colour all neighbour’s neighbour with RED colour (putting into set U). 
4. This way, assign colour to all vertices such that it satisfies all the co...read more
Answered by CodingNinjas
View 1 more answer
Q3. Count Inversions
For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.
An inversion is defined fo...read more
Ans. 
The idea is to use a method similar to the merge sort algorithm. Like merge sort, divide the given array into two parts. For each left and right half, count the inversions, and at the end, sum up the inversions from both halves to get the resultant inversions.

Approach ; -

Suppose the number of inversions in the left half and right half of the array (let be inv1 and inv2); what kinds of inversions are not accounted for i...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 50 minutes
Round difficulty - Medium

In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.

Q1. Return Subsets Sum to K
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Subset of an array 'ARR&...read more
Ans. 
Recursively generate all the subsets and keep track of the sum of the elements in the current subset.

Subsets can be generated in the following way. For every element of the array, there are 2 options: 

Include the element in the current subset : If we include the element in the current subset, then we decrease the value of ‘K’ by the value of the element.
Do not include the element in the current subset : There is n...read more
Answered by CodingNinjas
View 2 more answers
Q2. Boundary Traversal
You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.
NOTE:
The boundary...read more
Ans. 
I was not able to solve this question but the approach is given below.

The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-



The root node - The root node will always be our first node in the whole boundary traversal.

The left boundary - The left most nodes of the left subtree are also included in the boundary traversal, so we...read more
Answered by CodingNinjas
View 1 more answer