i
Infosys
Work with us
Filter interviews by
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
Compare each pair of adjacent elements in the array and swap them if they are in the wrong order
Repeat this process for each element in the array until no swaps are needed
Time complexity of O(n^2) makes it inefficient for large datasets
Code to return 2nd most value from 2 arrays of strings
Merge both arrays into one
Remove duplicates
Sort the array in descending order and return the second element
The task is to implement a jump game where each element specifies the maximum jump from that index.
Iterate through the array and keep track of the maximum reachable index at each step.
If the current index exceeds the maximum reachable index, return false.
If the loop completes without any issues, return true.
Virtual memory is a memory management technique that allows a computer to use more memory than physically available.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows multiple programs to run simultaneously without running out of memory.
When RAM is full, the operating system moves some data from RAM to the hard disk, freeing up space in RAM.
This process is called paging.
Virtual me...
List and tuple are both used to store collections of data in Python, but have different properties and time complexities.
Lists are mutable, while tuples are immutable
Lists use more memory than tuples
Lists have a variety of built-in methods, while tuples have fewer
Accessing an element in a tuple is faster than in a list
Appending to a list is faster than appending to a tuple
TCP/IP and OSI are two different models used for computer networks.
TCP/IP has 4 layers while OSI has 7 layers.
TCP/IP is used in the internet while OSI is used in academic and research environments.
TCP/IP is more flexible while OSI is more rigid.
TCP/IP is a practical model while OSI is a theoretical model.
Examples of TCP/IP protocols include HTTP, FTP, and SMTP while examples of OSI protocols include X.25 and ISDN.
Block size is the amount of data that can be stored in a single block of memory. Paging is a memory management technique used by the operating system.
Block size determines the amount of data that can be read or written to a storage device at once.
Paging divides memory into fixed-size blocks called pages.
When a program needs to access a page, the operating system loads it into memory.
This allows programs to use mor...
Count the number of islands in a given matrix of 0's and 1's.
Use DFS or BFS to traverse the matrix and mark visited cells.
For each unvisited cell with a value of 1, increment the island count and mark all connected 1's as visited.
Repeat until all cells have been visited.
Time complexity: O(m*n), where m and n are the dimensions of the matrix.
Find the maximum possible average value of sub-sequences of an array.
Calculate the prefix sum of the array.
Iterate through all possible sub-sequences and calculate their average.
Return the maximum average value.
Reverse a linked list in groups of k
Divide the linked list into groups of k nodes
Reverse each group using iterative or recursive approach
Connect the reversed groups to form the final linked list
Handle edge cases like incomplete groups or empty list
Example: Input: 1->2->3->4->5, k=2, Output: 2->1->4->3->5
Medium to hard DA Algo Questions
I applied via Job Portal and was interviewed in Aug 2024. There was 1 interview round.
I appeared for an interview in Jan 2025.
It was straightforward and included questions related to low-level design (LLD).
I applied via Referral and was interviewed in Apr 2024. There were 3 interview rounds.
3 questions easy medium hard you have to do two to clear
2 coding questions you have to compete both to clear easy-medium
I applied via Recruitment Consulltant
Medium to tough level questions of dsa
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
3 DSA medium level questions, have to clear 2+ for next round.
The task is to implement a jump game where each element specifies the maximum jump from that index.
Iterate through the array and keep track of the maximum reachable index at each step.
If the current index exceeds the maximum reachable index, return false.
If the loop completes without any issues, return true.
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Asked coding questions from dynamic programming
Code to return 2nd most value from 2 arrays of strings
Merge both arrays into one
Remove duplicates
Sort the array in descending order and return the second element
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
Compare each pair of adjacent elements in the array and swap them if they are in the wrong order
Repeat this process for each element in the array until no swaps are needed
Time complexity of O(n^2) makes it inefficient for large datasets
HackerRank test where you need to solve problem online full stack developer
What people are saying about Infosys
based on 16 interview experiences
Difficulty level
Duration
based on 23 reviews
Rating in categories
Technology Analyst
54.7k
salaries
| ₹4.8 L/yr - ₹10 L/yr |
Senior Systems Engineer
53.7k
salaries
| ₹2.5 L/yr - ₹6.3 L/yr |
Technical Lead
35k
salaries
| ₹7.3 L/yr - ₹20 L/yr |
System Engineer
32.5k
salaries
| ₹2.4 L/yr - ₹5.3 L/yr |
Senior Associate Consultant
31k
salaries
| ₹8.1 L/yr - ₹14 L/yr |
TCS
Wipro
Cognizant
Accenture