i
Mphasis
Filter interviews by
I applied via Approached by Company and was interviewed in Sep 2023. There was 1 interview round.
Top trending discussions
posted on 2 Jun 2022
I appeared for an interview before Jun 2021.
Had DSA and aptitude questions
posted on 16 Sep 2021
I appeared for an interview in Oct 2020.
Round duration - 75 min
Round difficulty - Medium
This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1
and day2
.
For each task i, day1[i]
represents the earliest...
Find the minimum number of days required to complete all tasks given specific completion days for each task.
Sort the tasks based on day1 in ascending order.
For each task, choose the minimum of day1 and day2 as the completion day.
Keep track of the maximum completion day for each task.
The final answer is the maximum completion day of all tasks.
Round duration - 30 min
Round difficulty - Easy
This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
The first line contains an integer 'T' r...
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
Implement the Bubble Sort algorithm to sort the array in place.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat this process until the array is sorted.
Time complexity of Bubble Sort is O(n^2) in the worst case.
Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Tip 1 : Be confident!
Tip 2 : Maintain high Cgpa
Tip 3 : Do your best
Tip 1 : Mention clear points
Tip 2 : Atleast 3 projects and never put anything you have not revised
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 75 minutes
Round difficulty - Medium
It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.
Given a structured list of books and their authors, format the information as specified.
The first line of input contains an integer ‘T' representing the number of tes...
The task is to format a list of authors and their books in a specific way as per the given input format.
Parse the input to extract the number of test cases, number of authors, author names, and their respective books.
Format the output by printing the author names and their books in the specified format.
Ensure correct sequence and labeling of authors and books as per the example provided.
Handle multiple test cases and a...
Round duration - 15 minutes
Round difficulty - Medium
It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
The first line co...
Implement a function to delete a node from a linked list at a specified position.
Traverse the linked list to find the node at the specified position.
Update the pointers of the previous and next nodes to skip the node to be deleted.
Handle edge cases such as deleting the head or tail of the linked list.
Ensure to free the memory of the deleted node to avoid memory leaks.
Round duration - 15 minutes
Round difficulty - Easy
A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.
Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.
If the graph has connected components, color each co...
Tip 1 : Projects do not matter much for this company.
Tip 2 : I did almost all the puzzles from Interviewbit.
Tip 3 : DBMS is really important. Practice queries in SQL thoroughly. You should know the use of limit and top also. It may be asked to write the same query in more than 1 form.
Tip 4 : Practice all the data structures. Questions were simple and you should know the basics of every data structure.
Tip 1 : Don't write anything just for the sake of it.
Tip 2 : If you are writing some project then be thorough with all the details. If you are not much confident, then simply remove it and focus on other subjects.
posted on 12 Jun 2021
posted on 16 Sep 2021
I appeared for an interview in Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
BJTs are three-terminal semiconductor devices used for amplification and switching of electronic signals.
BJTs have three regions - emitter, base, and collector.
They can be NPN or PNP type, depending on the arrangement of semiconductor materials.
BJTs are current-controlled devices, where a small current at the base terminal controls a much larger current between the collector and emitter.
Common BJT examples include 2N22...
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...
Graph coloring problem where vertices need to be colored with two colors such that no adjacent vertices share the same color.
Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.
Use graph coloring algorithms like Greedy Coloring or Backtracking to solve the problem.
If there are odd-length cycles in the graph, it is not possible to color the graph with two colors.
If the...
Round duration - 30 minutes
Round difficulty - Easy
Stacks are data structures that follow the Last In First Out (LIFO) principle, while Graphs are data structures that consist of nodes and edges to represent relationships.
Stacks are used for implementing functions, backtracking, and expression evaluation.
Graphs are used for representing networks, social connections, and shortest path algorithms.
Stacks can be implemented using arrays or linked lists.
Graphs can be direct...
You are provided with an N * N
maze where a rat is positioned at starting cell MAZE[0][0]
. The goal is to determine and print all possible paths that the rat can take to r...
Find all possible paths for a rat in a maze from start to finish.
Use backtracking to explore all possible paths in the maze.
At each cell, check if it is a valid move and mark it as part of the path.
Explore all four directions (up, down, left, right) recursively.
When reaching the destination cell, add the path to the result.
Return all valid paths found in the maze.
Tip 1 : Do learn EDC.
Tip 2 : Should know about Multivibrators and electronics basics.
Tip 3 : Do learn some extra technologies eg. ML/AI.
Tip 1: Do not lie at all
Tip 2: Write every project/internship
posted on 18 Oct 2021
I appeared for an interview in Dec 2020.
Round duration - 50 Minutes
Round difficulty - Medium
first round was aptitude round + coding round.
Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...
Given an integer N, determine if two teams with equal members can be formed based on the divisors of N.
Iterate through all divisors of N and assign members to two teams based on whether the divisor is even or odd.
Keep track of the number of members in each team and check if they are equal at the end.
Return true if the number of members in both teams is equal, false otherwise.
Tip 1 : Practice more coding problem
Tip 2 : Brush Data structure thoroughly
Tip 3 : Be confident in interview and be clear while explaining solution to interviewer.
Tip 1 : Try to make it more concise
Tip 2 : Try to add more projects as well as about hackathon.
Computer networking is the practice of connecting devices together to share resources and communicate with each other.
Computer networking involves the use of hardware and software to connect devices together, such as computers, printers, and servers.
Networking protocols, such as TCP/IP, are used to facilitate communication between devices.
Examples of computer networks include local area networks (LANs), wide area netwo...
I appeared for an interview before Oct 2020.
Round duration - 30 Minutes
Round difficulty - Medium
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Consider using modulo operation to avoid overflow for large values of N.
Round duration - 15 Minutes
Round difficulty - Easy
Tip 1 : learn oops concept on tips
Tip 2 : try to do fixing questions in any language
Tip 3 : try to practice for aptitude very well practice 50-100 questions daily
Tip 1 : must have 2 projects
Tip 2 : only write those things in your resume you are sure about them and have a very great knowledge about them
based on 1 interview experience
Difficulty level
Duration
based on 22 reviews
Rating in categories
Software Engineer
6.7k
salaries
| ₹4 L/yr - ₹8.4 L/yr |
Senior Software Engineer
6k
salaries
| ₹6.6 L/yr - ₹20 L/yr |
Associate Software Engineer
4.9k
salaries
| ₹2 L/yr - ₹5.6 L/yr |
Module Lead
2.5k
salaries
| ₹15.8 L/yr - ₹27 L/yr |
Transaction Processing Officer
2.3k
salaries
| ₹1.4 L/yr - ₹4.7 L/yr |
Cognizant
Wipro
Accenture
TCS