Mphasis-Wyde Associate Software Engineer Interview Questions and Answers

There are 2 sections one is Output guess and Another one is Quantitative

I didn't attend 2nd round..i was eliminated in 1st round

Via placement got this oppurtunity asked base questions
Coding test on java for factorial all ways
Database qstns

English
Critical reasoning and problem solving

Q1. Based on resume oops concepts about your work experience and your projects
Add your answer

Corona Pandemic, digitalization

Qualitative and quantitative questions + gmat

Q1. Dbms, os, programming
Add your answer

Q1. What is your knowledge about Sql ?
Ans. 
I have a good understanding of SQL and its syntax.
• Familiar with creating and modifying tables, inserting and updating data, and querying data using SELECT statements

• Knowledge of SQL functions and operators

• Experience with joins and subqueries

• Understanding of database normalization and data integrity constraints

• Proficient in using SQL in various database management systems such as MySQL, Oracle, and SQL Server
Answered by AI
Add your answer
Q2. What is your project dream
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 10 A.M.

Q1. 
Decode String Problem Statement
Your task is to decode a given encoded string back to its original form.
Explanation:
An encoded string format is <count>[encoded_string], where the 'encoded_string...read more
Ans. Stack Solution
The idea is to maintain two Stacks. One will store the integers i.e. number of times the current string is repeated and the other one will store the strings itself. 
We use a simple idea and always evaluate the innermost brackets first. We traverse through our encoded string
• If we encounter an integer, we push it onto our ‘integerStack’.
• If we encounter a character, then we simply append it to the ‘curr...read more
Answered Anonymously
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer loop.
2. For every node of the outer-loop, start the inner loop from the head and maintain a  prev node to store the previous node of the current outer loop node.
3. If the inner-loop visits the node next to the outer-loop node, then a cycle exist,we will simply set the prev node's nex...read more
Answered Anonymously
Add your answer
Q3. 
Infix to Postfix Conversion
You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
Explanation:
An i...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 2 P.M.

Q1. 
Find First Repeated Character in a String
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
Example:
Input:
STR =...read more
Ans. Brute Force
The basic approach is to check each character in the rest of the string and if it is repeated then simply print it.
 
The steps are as follows:
 
• Start traversing through the string from ‘i’ = 0 to ‘i’ < length of string
  • Start traversing with another variable from ‘j’ = ‘i’ to ‘j’ < length of string
    • Check if the character at ‘i’ is equal to the character at ‘j’
      • If yes then return it.
      • If no, then cont...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Video Call interview where the interview happened for around 45 minutes.

Q1. 
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...read more
Ans. Recursive Solution
First of all, we need to observe that for any simple path in a Binary tree, there is one and only one node at the maximum height. So, the idea is to fix each node as the highest node in a path and then find the maximum sum path having the current node as the highest node. The final answer will be the maximum value among all the path sum values for each node. To find the maximum sum path for a particul...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Video Call interview where the interview happened for around 30 minutes.