i
Infosys
Filter interviews by
I applied via Campus Placement and was interviewed in May 2021. There were 3 interview rounds.
Find the first occurrence of target value in a sorted array with duplicates.
Use binary search to find the target value.
If found, check if the previous element is also the target value.
If not, return the index of the target value.
If yes, continue binary search on the left subarray.
Find the maximum subarray sum in an array with positive and negative integers.
Use Kadane's algorithm to find the maximum subarray sum.
Initialize two variables, one for current maximum and one for global maximum.
Iterate through the array and update the variables accordingly.
Return the global maximum.
Example: [-2, 1, -3, 4, -1, 2, 1, -5, 4] returns 6 (subarray [4, -1, 2, 1])
Coding test will be pretty hard. 2 questions will be giv
Coding test will be pretty hard. Have to choose any one of 2 questions given and solve it in 45 mins.
Atleast 70-80% test case needs to be cleared to pass
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.
I was provided with 2 DSA questions, and was given an option to pick one and solve in 45 mins duration. Since there were some problems in opening my coding assessment link, interviewer provided both questions in virtual meet chat.
Question1 - you are given N(len of arrays), X(int), Y(int), Z(int), A(int[]), B(int[]), sum = 0 and 3 arithmetic operations that can be performed using A, B, X, Y, Z upon sum. Any operations including X, Y, Z is possible only when their values are greater than 0. After N iterations you have to obtain the maximum sum value that can be obtained.
Question2 - Find K-most frequent element in an array
Design a promise wrapper with timeout for resolving or rejecting a promise function.
Create a function that takes a promise function and timeout value as parameters.
Inside the function, create a new Promise that wraps the original promise function.
Use Promise.race to race between the original promise and a timeout promise.
If the original promise resolves before timeout, resolve the wrapper promise with the result.
If the...
Monolith vs microservice architecture pros and cons
Monolith: easier to develop and test, simpler deployment process
Monolith: can be harder to scale and maintain as it grows
Microservices: scalable and flexible, easier to update and maintain
Microservices: complex to develop and deploy, requires more monitoring and management
Example: Monolith - traditional web applications, Example: Microservices - Netflix, Amazon
I applied via Company Website and was interviewed in May 2024. There were 2 interview rounds.
Infosys conducts coding assessment on the HackWithInfy platform. The assessment includes a medium-level problem & the rest are hard-level similar to LeetCode's. The total duration of the test is 3 hours.
Deadlock in OS occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource.
Deadlock happens when processes have acquired resources but are waiting for additional resources that are held by other processes.
Four conditions must hold for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait.
Deadlock can be prevented by using techniques ...
Process scheduling algorithms determine the order in which processes are executed by the CPU.
First Come First Serve (FCFS) - Processes are executed in the order they arrive.
Shortest Job Next (SJN) - Process with the shortest burst time is executed next.
Round Robin (RR) - Each process is assigned a fixed time slice for execution.
Priority Scheduling - Processes are executed based on priority levels assigned to them.
Multi...
Joins in DBMS are used to combine rows from two or more tables based on a related column between them.
Inner Join: Returns rows when there is at least one match in both tables.
Left Join: Returns all rows from the left table and the matched rows from the right table.
Right Join: Returns all rows from the right table and the matched rows from the left table.
Full Outer Join: Returns rows when there is a match in one of the ...
SQL query to retrieve the n'th highest salary with full details
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to retrieve the n'th highest salary
Join with the employee table to get full details
Late binding and early binding are concepts in programming related to when the binding of a method to its implementation occurs.
Early binding refers to the process of linking a method call to the method implementation at compile time.
Late binding refers to the process of linking a method call to the method implementation at runtime.
Early binding is also known as static binding, while late binding is also known as dynam...
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
Types of inheritance: single inheritance, multiple inheritance, multilevel inheritance, hierarchical inheritance, hybrid inheritance
Single inheritance: a class inherits from only one base class
Multiple inheritance: a class inherits from multiple base classes
Multilevel inheritance: a class inherits ...
Infosys interview questions for designations
I applied via campus placement at STES Smt Kashibai Navale College of Engineering, Pune and was interviewed in Jul 2024. There were 2 interview rounds.
Array, Binary Search Tree, Graph
Deadlock in OS is a situation where two or more processes are unable to proceed because each is waiting for the other to release a resource.
Deadlock occurs when processes compete for resources and each process holds a resource while waiting for another resource.
Four necessary conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.
Example: Process A holds Resource 1 and waits for R...
Reverse a linked list by changing the next pointers of each node to point to the previous node.
Start by initializing three pointers: current, previous, and next.
Iterate through the linked list, updating the next pointer of each node to point to the previous node.
Update the previous, current, and next pointers accordingly in each iteration.
Return the new head of the reversed linked list.
Swapping numbers without using a third variable
Use bitwise XOR operation to swap two numbers without using a third variable
Example: a = 5, b = 10. a = a XOR b, b = a XOR b, a = a XOR b. Now a = 10, b = 5
Get interview-ready with Top Infosys Interview Questions
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
Three questions categorized by difficulty: Easy, Medium, and Hard, covering topics such as trees, graphs, and backtracking.
I am a dedicated and experienced specialist programmer with a passion for creating efficient and innovative solutions.
Over 5 years of experience in programming languages such as Java, Python, and C++
Strong background in developing web applications and software solutions
Experience working on large-scale projects and collaborating with cross-functional teams
Certified in Agile methodologies and continuous integration/cont
I have worked on various projects including developing web applications, creating mobile apps, and implementing data analytics solutions.
Developed a web application for a retail company to manage inventory and sales data
Created a mobile app for a fitness tracking platform to track user activity and provide personalized recommendations
Implemented a data analytics solution for a financial institution to analyze customer
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
We had 3 questions easy medium and hard Which we have to complete in 3 hours.
An anagram is a word or phrase formed by rearranging the letters of a different word or phrase.
Create a function that takes in an array of strings as input
For each string, sort the characters alphabetically
Check if the sorted strings are equal, if so, they are anagrams
It was a test comprises three ques
Use Floyd's Tortoise and Hare algorithm to detect and remove loop in linked list.
Use two pointers, slow and fast, to detect a loop in the linked list.
If there is a loop, move slow pointer to the head and then move both pointers one step at a time until they meet at the loop start.
Set the next pointer of the node where they meet to null to remove the loop.
Iterative traversal of binary tree involves visiting each node in a systematic way without using recursion.
Use a stack to keep track of nodes to visit
Start with the root node and push it onto the stack
While the stack is not empty, pop a node, visit it, and push its children onto the stack
I applied via Job Portal and was interviewed in Sep 2024. There were 2 interview rounds.
3hr coding test, 3 questions total - hard, hard and medium.
BSTs are binary trees where each node has a value greater than all nodes in its left subtree and less than all nodes in its right subtree.
BSTs are binary trees where each node has a value greater than all nodes in its left subtree and less than all nodes in its right subtree.
BSTs allow for efficient searching, insertion, and deletion of elements compared to normal binary trees.
Example: In a BST, the left subtree of a n...
It is has 3 questions with easy, medium and hard .
What people are saying about Infosys
3 Interview rounds
based on 387 reviews
Rating in categories
Bangalore / Bengaluru
3-8 Yrs
Not Disclosed
Bangalore / Bengaluru
3-8 Yrs
Not Disclosed
Technology Analyst
56.3k
salaries
| ₹3 L/yr - ₹11 L/yr |
Senior Systems Engineer
50k
salaries
| ₹2.8 L/yr - ₹8 L/yr |
System Engineer
39.2k
salaries
| ₹2.5 L/yr - ₹5.5 L/yr |
Technical Lead
30.6k
salaries
| ₹5.2 L/yr - ₹19.5 L/yr |
Senior Associate Consultant
27.4k
salaries
| ₹6.2 L/yr - ₹15 L/yr |
TCS
Wipro
Cognizant
Accenture