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

Software Engineer

Infosys private limited

2 rounds | 4 Coding problems

KARAN SINGH

Experienced | Jan 2022

Rejected

Interview preparation journey

Preparation

Duration: 6 Months

Topics: Data Structures, Algorithms, OOPS, DBMS, OS

Tip

Tip 1 : Practice more in competitive programming
Tip 2 : build your portfolio on any coding platform like LeetCode or CodeChef because it will attract recruiter's.
Tip 3 : choose only one Programming language for coding and start practicing in solving competitive programming questions.

Application process

Where: Company Website

Eligibility: 7 CGPA, good in programming/DSA

Resume tip

Tip 1 : Add some working and impactful projects in your resume.
Tip 2 : Do not put false things and over skills in your resume.
Tip 3 : Either you are fresher or experienced still don't make resume more than 2 pages.

Interview rounds

Round

Medium

Online Coding Interview

Duration180 minutes

Interview date20 Jan 2022

Coding problem2

Timing-180 minutes is the Duration Of Assessment
you need to give the test within 5 days of getting the test mail.

Test is conducted virtually through Infosys platform. Test covers DSA, OOPS concept, DBMS, SQL, Programming and some general question related to Leadership Principles and workstyles.

1. Next Permutation

Moderate

15m average time

85% success

0/80

Asked in companies

You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N’ exactly once. Your task is to rearrange the numbers and generate the lexicographically next greater permutation.

To determine which of the two permutations is lexicographically smaller, we compare their first elements of both permutations. If they are equal — compare the second, and so on. If we have two permutations X and Y, then X is lexicographically smaller if X[i] < Y[i], where ‘i’ is the first index in which the permutations X and Y differ.

For example, [2, 1, 3, 4] is lexicographically smaller than [2, 1, 4, 3].

Problem approach

1. Need to find pivot no while traversing right to left, where nums[i-1] < nums[i]
2. Pick greater no than pivot no from descending order block(while traversing right to left) then swap
3. Sort out descending order block in ascending order.

Try solving now

2. Basic HR Questions

Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.

Round

Hard

Face to Face

Duration90 minutes

Interview date28 Jan 2022

Coding problem2

We need to solve 1 or 2(based on interviewer) coding question within 1 hour in which we need to explain our approach before writing the code and we need to give optimal solution of the approach.

Interviewer also ask some other question related to DBMS, SQL, OOPS concept and etc.

1. Spiral Order Traversal of a Binary Tree

Easy

20m average time

75% success

0/40

Asked in companies

You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.

For example

For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
    1
   / \
  2   3
     / \
    4   5

Output: 1 3 2 4 5

Problem approach

I don't know the right approach to solve this question at that time.

Solution in Python:-

# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
if root is None:
return []
s1=[root]
s2=[]
level=[]
res=[]
while s1 != [] or s2 !=[]:
while s1:
root=s1.pop()
level.append(root.val)
if root.left is not None:
s2.append(root.left)
if root.right is not None:
s2.append(root.right)
res.append(level)
level=[]

while s2:
root=s2.pop()
level.append(root.val)
if root.right is not None:
s1.append(root.right)
if root.left is not None:
s1.append(root.left)
if level != []:
res.append(level)
level=[]
return res

Try solving now

2. Questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.

Difference between relational and non relational database?
What is foreign key in SQL queries?
What is the output of given program?
What is OPPS concept and its types?
Difference between function overloading and function overriding?
Write a query to find out second highest salary of an employee.
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.

Problem approach

Tip 1: Need to answer question as per your knowledge and experience.