Solitaire Infosys Java Developer Interview Questions and Answers

Aptitude test

Current affairs

Q1. Puzzle , sql related questions
Add your answer

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Ans. 
Maximize profit by buying and selling stocks with at most k transactions.
• Use dynamic programming to track profits for each transaction.

• Maintain an array to store maximum profit for each day.

• Example: For prices [3,2,6,5,0,3] and k=2, max profit is 7.

• Consider edge cases like k=0 or prices being empty.
Answered by AI
Add your answer
Q4. Leetcode Medium
Add your answer

DSA questions such as Map, linked list

Three were basic questions around strings and arrays

Q1. Detailed discussion on data structures and algorithms
Add your answer

Basic coding question on array and string.

Good question with nice logic

5 question in 1 hour so it's kinda difficult to manage time

Medium level question based on quantitative aptitude

Medium level leetcode questions

Questions based on data structure

Questions based on Data structure