Infosys Digital Specialist Interview Questions, Process, and Tips

Q1. Maximum sum in a circular Array such that no two elements are adjacents to each other.
Ans. 
Find maximum sum in a circular array with non-adjacent elements.
• Use dynamic programming approach.

• Calculate maximum sum with first element and without first element.

• Compare the two sums to get the maximum sum.
Answered by AI
Add your answer
Q2. Given a circular array containing of positive integers value. your task is to find the maximum sum of a elements such that no numbers are adjacent to each other in the array.
Ans. 
Find maximum sum of non-adjacent elements in a circular array of positive integers.
• Create two arrays, one with the maximum sum ending at each index and another with the maximum sum not including the previous element.

• Use dynamic programming to fill the arrays.

• Return the maximum value between the last element of the first array and the second to last element of the second array.

• Example: [1, 2, 3, 4, 5] returns 9 (sum of
Answered by AI
Add your answer

Basic oops concepts os, DBMS, and data structure algorithm

Tough 3 questions profile is given on the bases of perform if 3 solved get ctc of 9.5, for 2 questions 6.25 else 3.5

3 questions easy medium hard. You need to solve only 1 to get shortlisted

Q1. I joined as fresher so they asked about my project and my core questions
Add your answer

Coding test was 3hrs on hacker earth platform

Q1. Tell me about your self
Add your answer
Q2. Some basic oops concepts and projects that I did during my course
Add your answer

Three coding question.
Easy,medium,hard

Q1. Design ER model for railway reservation system.And questions on them.
Add your answer
Q2. Basic data structure questions on queue,stack,array,linkedlist ,oops.
Add your answer