i
Infosys
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in Aug 2023. There was 1 interview round.
I applied via Company Website and was interviewed before Aug 2023. There were 2 interview rounds.
3 coding question was asked based on graph tree and Arrays.
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
3 hours, online exam questions asked on data structures,c, python,
A tree diagram is a data structure that represents a hierarchical structure.
Nodes represent elements of the structure
Edges represent relationships between elements
Root node is the topmost node
Leaf nodes have no children
Examples include binary trees, AVL trees, and B-trees
Python is a high-level, interpreted programming language known for its simplicity and ease of use.
Python has a large standard library with built-in modules for various tasks
It supports multiple programming paradigms including object-oriented, functional and procedural programming
Python is dynamically typed and garbage-collected
It has a simple and easy-to-learn syntax, making it a popular choice for beginners
Python is w...
I applied via Campus Placement and was interviewed in Nov 2022. There were 2 interview rounds.
Contains 3 question, 1 was easy, rest 2 were dificult
Infosys interview questions for designations
I applied via Company Website and was interviewed in Feb 2022. There were 2 interview rounds.
It includes 3 coding question,one easy one medium and one difficult.
In order to clear this round we have to solve atleast 2 questions completely.
Get interview-ready with Top Infosys Interview Questions
I applied via Job Fair and was interviewed before Feb 2023. There were 2 interview rounds.
There were 3 questions Easy Medium and Hard
I cracked the easy and the Hard one
3 coding questions
I applied via Prepinsta and was interviewed in Sep 2021. There were 2 interview rounds.
There are 2 stages in the HackwithInfy exam. In the first round there is a coding competition. They give 3 questions and the best performers from this round can then go to the next round, and they are also
offered the role of power programmer if they have performed well.
The second round is a 48 hour hackathon. I did not qualify for this round, but I got shortlisted for the power programmer profile.
Greedy algorithm is a technique to make locally optimal choices at each step to find a global optimum.
Greedy algorithm is used in optimization problems where the goal is to find the best solution among many possible solutions.
It works by making the best possible choice at each step, without considering the future consequences.
Examples include finding the shortest path in a graph, scheduling tasks to minimize completion...
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
Round duration - 45-50 minutes
Round difficulty - null
I was able to solve 2 questions completely while the 3rd one I solved partially. But I was shortlisted for the Power Programmer profile and set to appear for the Interview. There was only one Interview where both Technical and HR type questions were asked.
A lot of the Interview was centered around my projects.
I am a software engineer with 5 years of experience in developing web applications using Java and JavaScript.
I have a Bachelor's degree in Computer Science from XYZ University.
I have worked on projects using Spring Boot, React, and Angular frameworks.
I am familiar with Agile methodologies and have experience working in Scrum teams.
I enjoy learning new technologies and keeping up with industry trends.
In my free time, I ...
My project is a web-based inventory management system for a retail store.
Allows store employees to manage inventory levels and track sales
Generates reports on sales trends and popular products
Integrates with barcode scanners and POS systems
Requires login authentication for security
Built using HTML, CSS, JavaScript, and PHP
Given a sequence of N integers, find the maximum sum of any contiguous subarray.
Use Kadane's algorithm to find the maximum sum subarray in O(n) time complexity.
Initialize two variables, max_so_far and max_ending_here, to track the maximum sum.
Traverse the array and update max_ending_here and max_so_far accordingly.
Return max_so_far as the answer.
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.
Incremental model is a software development model where the product is developed in small parts and each part is delivered incrementally.
The product is divided into small parts or modules.
Each module is developed and delivered incrementally.
Each increment adds new functionality to the product.
Testing is done after each increment is delivered.
Examples include Agile and Scrum methodologies.
Yes, I am comfortable working on multiple projects simultaneously.
I prioritize tasks and manage time efficiently
I communicate effectively with team members and stakeholders
I ensure that each project receives the necessary attention and meets deadlines
Examples: I have worked on multiple software development projects simultaneously, managing tasks and deadlines effectively.
I have also managed multiple research projects s...
Infosys is a leading global consulting and IT services company.
Infosys has a strong reputation for delivering high-quality services to clients worldwide.
The company has a diverse portfolio of services, including digital transformation, cloud computing, and data analytics.
Infosys is committed to sustainability and social responsibility, with initiatives focused on education, healthcare, and the environment.
The company h...
I applied via PrepInsta and was interviewed in Sep 2021. There were 2 interview rounds.
There are 2 rounds in the HackwithInfy exam.
In the first round there is a coding competition. They give 3 questions and those the best performers from this round can then go to the next round, and they are also offered the role of power programmer, digital system engineer and system engineer post pre interview opportunity if they have performed well.
The second round is a 48 hour hackathon. I did not qualify for this round, but I got shortlisted for the power programmer profile.
Finding maximum XOR subset
Use Trie data structure to store binary representation of numbers
For each number, traverse the Trie and find the maximum XOR value
Repeat the above step for all numbers and return the maximum XOR value
Sliding Window Algorithm is used to solve problems where we need to find a substring or subarray of fixed size in a larger string or array.
The window size should be fixed and not change during the algorithm
The window should slide through the larger string or array one element at a time
The algorithm should keep track of the maximum or minimum value in the current window
Examples: Maximum Sum Subarray of Size K, Smallest
Round duration - 60-80 minutes
Round difficulty - null
I was able to solve 2 questions completely while the 3rd one I solved partially. But I was shortlisted for the Power Programmer profile and set to appear for the Interview.
There was only one Interview where both Technical and HR type questions were asked.
A lot of the Interview was centered around my projects
I am a software engineer with 5 years of experience in developing web applications using Java and JavaScript.
I have a Bachelor's degree in Computer Science from XYZ University.
I have worked on projects using Spring Boot, AngularJS, and ReactJS.
I am passionate about learning new technologies and keeping up with industry trends.
In my free time, I enjoy hiking and playing video games.
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.
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 memory ...
Normalization in DBMS is important to reduce data redundancy and improve data integrity.
Normalization helps in organizing data in a structured manner.
It reduces data redundancy and improves data integrity.
It helps in efficient storage and retrieval of data.
Normalization can also help in avoiding update anomalies.
However, over-normalization can lead to complex queries and slower performance.
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 more mem...
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.
TCP is a connection-oriented protocol while UDP is connectionless. Both have their own advantages and disadvantages.
TCP provides reliable, ordered, and error-checked delivery of data while UDP does not guarantee any of these.
TCP is slower but more reliable while UDP is faster but less reliable.
TCP is used for applications that require high reliability and accuracy while UDP is used for applications that require speed a...
Method overloading and overriding are two concepts in object-oriented programming that allow for the creation of multiple methods with the same name.
Method overloading is when multiple methods have the same name but different parameters.
Method overriding is when a subclass provides a specific implementation of a method that is already defined in its superclass.
Overloading is resolved at compile-time while overriding is...
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
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
What people are saying about Infosys
based on 16 interviews
3 Interview rounds
based on 23 reviews
Rating in categories
Technology Analyst
55.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Systems Engineer
50.7k
salaries
| ₹0 L/yr - ₹0 L/yr |
System Engineer
39.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
30.7k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate Consultant
28.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Wipro
Cognizant
Accenture