Mphasis Angular Frontend Developer Interview Questions and Answers

Round duration - 100 Minutes
Round difficulty - Medium

Q1. 
Change Start Node Problem Statement
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.
...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Q1. 
Alien Dictionary Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Chocolate Distribution Problem
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'...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Q1. 
Inplace Rotate Matrix 90 Degrees Anti-Clockwise
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Flip The Bits Problem Statement
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...read more
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Q1. 
Next Greater Element Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

In this round, there were 2 sections one for aptitude another for coding. The coding section consists of 2 questions and one has to attempt any one of them. And webcam will be active through all the assessment process.

Q1. 
Sum of Squares of First N Natural Numbers Problem Statement
You are tasked with finding the sum of squares of the first N natural numbers for given test cases.
Input:
The first line contains an integer ...read more
Ans. 
Calculate the sum of squares of the first N natural numbers for given test cases.
• Read the number of test cases 'T'

• For each test case, read the value of 'N'

• Calculate the sum of squares of the first 'N' natural numbers

• Output the result for each test case
Answered by AI
View 2 more answers

Round duration - 45 minutes
Round difficulty - Medium

2 questions were asked in this section out of which we have to answer anyone

Q1. 
Sum of Squares of First N Natural Numbers Problem Statement
You are tasked with finding the sum of squares of the first N natural numbers for given test cases.
Input:
The first line contains an integer ...read more
Ans. 
Calculate the sum of squares of the first N natural numbers for given test cases.
• Read the number of test cases 'T'

• For each test case, read the value of 'N'

• Calculate the sum of squares of the first 'N' natural numbers

• Output the result for each test case
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a problem solving round and only one coding question was asked

Q1. 
Reverse a String Problem Statement
Given a string STR containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
Input:
The input starts with a single i...read more
Ans. 
Reverse a given string containing characters from [a-z], [A-Z], [0-9], and special characters.
• Iterate through the characters of the string from end to start and append them to a new string to get the reversed string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Ensure to handle special characters and numbers while reversing the string.

• Consider edge cases ...read more
Answered by AI
View 1 more answer

It was from college placement, basic question such as relative velocity, ratio and proportion, unitary method and 2 programmin question

Don't remember it was 2 years ago

Q1. Tell me about yourself.
Add your answer
Q2. Brief description of myself and then the minor and major projects I worked upon.
Add your answer
Q3. Pattern question in any language
Add your answer
Q4. Provided the answer in python language
Add your answer
Q5. Basics of DAA, Os, DBMS
Add your answer
Q6. Don't remember the exact questions but answers were 3 out 5 correct and program was also correct
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

It happens in very friendly manner.

Q1. 
Paths in a Matrix Problem Statement
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...read more
Ans. 
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
• Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.

• At each cell, recursively explore moving right and down until reaching the bottom-right corner.

• Keep track of the current path and add it to the result when reaching the destination.
Answered by AI
Add your answer
Q2. Can you create 2 tables in SQL and perform different operations on them?
Ans. 
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
• Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));

• Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));

• Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);

• Select Data: SELECT * FROM employees WHERE salary > 40000;

• Update Data: UPDATE employees SET...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

No problem occur very friendly environment.

Round duration - 90 minutes
Round difficulty - Hard

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• If the destination is reached, add the path to the list of valid paths.
Answered by AI
Add your answer