mPHATEK Systems Software Engineer Interview Questions and Answers

Q1. MCQ test. 20 questions were asked and attempted in 30 minutes.
Add your answer

1hr duration, test can be attempted in any language. I have attempted in python.

Basic coding question on array and string.

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Ans. 
Find the second maximum number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Ans. 
Maximize profit by buying and selling stocks with at most k transactions.
• Use dynamic programming to track profits for each transaction.

• Maintain an array to store maximum profit for each day.

• Example: For prices [3,2,6,5,0,3] and k=2, max profit is 7.

• Consider edge cases like k=0 or prices being empty.
Answered by AI
Add your answer
Q4. Leetcode Medium
Add your answer

5 coding questions in the first round

Q1. About yourself , about your project explaination.
Ans. Explianation about your project they'll ask fine details also.
Answered Anonymously
Add your answer
Q2. Find prime numbers value.
Ans. 
A prime number is a number greater than 1 that is divisible only by 1 and itself.
• Start with a loop to iterate through numbers

• Check if each number is divisible by any number from 2 to its square root

• If not divisible, add it to the list of prime numbers
Answered by AI
View 1 more answer

Basic Aptitude questions mainly on quantitative

Google docs was shared which has 5 coding questions mainly on array and string.

Q1. Interviewer introduced himself , then told the flow of interview ie. 2 coding question will be asked then he asked to introduce myself
Add your answer
Q2. Occurance of characters in string
View 1 more answer
Q3. Angle between hour and minute hand of clock at a given time
Add your answer
Q4. Both question I was able to solve quickly interview was sheduled for one hour but i solved questions in 23 minutes so interview ended. I was called for second techinal round
Add your answer

Q1. Same format as above introduction and 2 coding questions
Add your answer
Q2. 1 Integer to roman it took me some time to solve the question
Add your answer
Q3. 2 given sum and we have to print all the subsequences in array with given sum
Ans. 
Printing all the subsequences in an array with a given sum.
• Use recursion to generate all possible subsequences.

• Check if the sum of each subsequence is equal to the given sum.

• Print the subsequences that satisfy the condition.

• Time complexity: O(2^n).
Answered by AI
Add your answer
Q4. The interview took almost 45 minutes and i was able to solve both questions so i was selected for third round ie technical + HR
Add your answer

Q1. First introduction then as all rounds 2 coding questions and then HR questions were asked
Add your answer
Q2. 1 print string without taking repeating characters eg helper - helpr
View 1 more answer
Q3. 2 sort array of 0s and 1s in only one loop solution was using two pointers
Ans. 
Sort an array of 0s and 1s in one loop using two pointers.
• Use two pointers, one starting from the beginning and the other from the end.

• Swap the values at the pointers if the value at the beginning pointer is greater than the value at the end pointer.

• Continue until the pointers meet in the middle.

• Time complexity is O(n).
Answered by AI
View 1 more answer
Q4. I solved both the questions then questions were asked on projects
Add your answer
Q5. Difficulties in project how you learn new technology After two days I received mail and I was selected for software developer role
Add your answer

Q1. First non repeating character in a string
Ans. 
Find the first non-repeating character in a string.
• Create a hash table to store character frequency

• Iterate through the string and update the hash table

• Iterate through the string again and return the first character with frequency 1
Answered by AI
Add your answer
Q2. Longest substring pallandrome in a string
Ans. 
Find the longest substring that is a palindrome in a given string.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D boolean array to store the results of subproblems.

• Check for palindromes of length 1 and 2 separately.

• For substrings of length greater than 2, check if the first and last characters are the same and the substring between them is also a palindrome.

• Update the result if a longer palindrome ...read more
Answered by AI
Add your answer

DSA questions such as Map, linked list