i
Infosys
Work with us
Filter interviews by
Yes, I consistently maintained my schedule through effective planning and prioritization of tasks.
I used digital tools like Google Calendar to set reminders for important deadlines.
I prioritized tasks based on urgency and importance, ensuring critical projects were completed on time.
I regularly reviewed my schedule at the beginning of each week to adjust for any changes or new priorities.
For example, during a recent ca...
What people are saying about Infosys
I applied via Recruitment Consulltant
In 5 years, I see myself as a senior marketing manager leading a team of talented professionals and driving successful campaigns for a reputable company.
Advancing to a senior marketing manager role
Leading a team of talented professionals
Driving successful marketing campaigns
Working for a reputable company
Utilize a multi-channel approach for product launch, including social media, influencer partnerships, and targeted advertising.
Create a buzz through teaser campaigns on social media platforms
Collaborate with influencers to reach a wider audience
Utilize targeted advertising on platforms like Google Ads and Facebook Ads
Host a launch event to generate excitement and media coverage
How much expecting your package
I appeared for an interview in Apr 2025, where I was asked the following questions.
I applied via Internshala and was interviewed in May 2021. There were 3 interview rounds.
Discussing my resume highlights my skills, experiences, and projects relevant to the software engineering role.
Experience with Java and Python in developing web applications.
Led a team project that improved application performance by 30%.
Contributed to open-source projects, enhancing my coding skills and collaboration.
Completed an internship at XYZ Corp, where I developed a feature that increased user engagement.
I appeared for an interview before Dec 2020.
Round duration - 100 Minutes
Round difficulty - Medium
You are provided with a singly linked list and an integer K
. The objective is to make the Kth
node from the end of the linked list the starting node of the linked list.
Given a singly linked list and an integer K, rearrange the list such that the Kth node from the end becomes the starting node.
Traverse the linked list to find the length and the Kth node from the end.
Update the pointers to rearrange the list accordingly.
Handle edge cases like K being equal to 1 or the length of the list.
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
Check if given strings containing parentheses are balanced or not.
Use a stack to keep track of opening parentheses
Iterate through the string and push opening parentheses onto the stack
When a closing parentheses is encountered, pop from the stack and check if it matches the corresponding opening parentheses
If stack is empty at the end and all parentheses are matched, the string is balanced
Round duration - 120 Minutes
Round difficulty - Medium
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...
Given a sorted alien dictionary in an array of strings, determine the character order of the alien language.
Iterate through the dictionary to build a graph of character dependencies based on adjacent words.
Perform a topological sort on the graph to determine the character order.
Return the character array representing the order of characters in the alien language.
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
Sort the array of chocolates in ascending order.
Iterate through the array and find the minimum difference between the elements by considering 'M' elements at a time.
Return the minimum difference found as the result.
Round duration - 120 Minutes
Round difficulty - Medium
You are provided with a square matrix of non-negative integers of size 'N x N'
. The task is to rotate this matrix by 90 degrees in an anti-clockwise directi...
Rotate a square matrix by 90 degrees anti-clockwise without using extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate them in place
Handle odd-sized matrices separately by adjusting the loop boundaries
Given a binary string S
of length N
where initially all characters are '1', perform exactly M
operations, choosing from four specific operations, and determine how many dis...
Count the number of distinct final strings possible after performing a given number of operations on a binary string.
Iterate through all possible combinations of operations to determine the final string after each operation.
Use bitwise operations to efficiently flip the bits based on the chosen operation.
Keep track of distinct final strings using a set data structure.
Return the size of the set as the number of distinct...
Round duration - 120 Minutes
Round difficulty - Medium
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Tip 1 : Practice Medium level question.
Tip 2 : Do atleast 2 projects
Tip 3 : More Focus on your Communication skill
Tip 1 : Full Command on your resume and make short atleast 1 page with normal color and font.
Tip 2 : Have mentioned some good projects on resume.
I appeared for an interview in Dec 2020.
Round duration - 40 minutes
Round difficulty - Easy
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
Count the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).
Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Tip 1 : Do practice as much as you can
Tip 2 : Coding is key to crack
Tip 1 : It should look nice
Tip 2 : Skills should be mentioned properly
I applied via Campus Placement and was interviewed in Sep 2021. There was 1 interview round.
To debug a particular program without affecting others, use breakpoints and step through the code.
Set a breakpoint in the program you want to debug
Step through the code using a debugger to identify the issue
Use logging statements to track the flow of the program
Check the call stack to see which functions are being called
Use conditional breakpoints to stop the program at specific points
based on 1 review
Rating in categories
Technology Analyst
54.7k
salaries
| ₹4.8 L/yr - ₹10 L/yr |
Senior Systems Engineer
53.8k
salaries
| ₹2.5 L/yr - ₹6.3 L/yr |
Technical Lead
35.1k
salaries
| ₹9.4 L/yr - ₹16.4 L/yr |
System Engineer
32.5k
salaries
| ₹2.4 L/yr - ₹5.3 L/yr |
Senior Associate Consultant
31.2k
salaries
| ₹8.2 L/yr - ₹15 L/yr |
TCS
Wipro
Cognizant
Accenture