MTX Group Full Stack Developer Interview Questions and Answers

Delete nodes from linkedList if their value matches a certain condition

Q1. Js advanced concepts
Add your answer
Q2. Java concurrency
Add your answer
Q3. Design patterns
Add your answer

Q1. Implement few design patterns
Ans. 
Implementing design patterns in software development
• Singleton pattern ensures a class has only one instance and provides a global point of access to it

• Factory pattern creates objects without specifying the exact class of object that will be created

• Observer pattern defines a one-to-many dependency between objects so that when one object changes state, all its dependents are notified and updated
Answered by AI
Add your answer
Q2. Questions of microservice architecture
Add your answer
Q3. Java 8 tricky coding questions
Add your answer

Q1. Java related questions
Add your answer

It was easy to crack ill rate 2/5

It was a short coding round pretty easy

It was a long coding round i couldn't crack it

Q1. Introduce yourself
Add your answer
Q2. Tell me what you know about zoho
Add your answer

Amazon pay customer service cnt number

Customer care number..

Q1. Calling" Amazon 091-53-56-47-89- Customer Care number to receive email from trustpilot about your reviews, inspection, tips about businesses and product, ...Calling" Amazon 09153.564.789 .Customer Care num...read more
Add your answer
Q2. Amazon pay customer care number
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

Q1. 
Matrix Rank Calculation
Given a matrix ARR of dimensions N * M, your task is to determine the rank of the matrix ARR.
Explanation:
The rank of a matrix is defined as:
(a) The maximum number of linearly...read more
Ans. Row Echelon Form
Approach:
• The idea is based on converting the given input matrix ARR into row echelon form.
• Since we know that the rank of the matrix can not be greater than min(N, M). So we will check if N > M then we will transpose the input matrix ARR since we are using row echelon form so the matrix has to be transformed in such a way that in each row all the elements to the left of the diagonal element must be ze...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This is an elimination round. The interviewer will ask some technical questions and ask to solve some coding questions.
The interview was on Microsoft teams and coding was on codility.

Q1. 
Check Permutation Problem Statement
Determine if two given strings, 'str1' and 'str2', are permutations of each other.
Explanation:
Two strings are permutations of each other if one string's characters ...read more
Ans. Frequency Array Approach
• The first and the foremost condition for two strings to be the permutations of each other is that the frequency of each element in both of them should be the same.
• It can be proven by a very simple argument that we are only rearranging the letters, and not adding or deleting any character.
• So we allocate an array of size 256 (that is the number of distinct ASCIIacharactersterst to store the freque...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Interviewers asked some questions regarding System design and then asked me to perform the task

Q1. Design a vending machine.
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

There were 2 interviewers. This round was basically Distributed systems.

Q1. 
Alternating Largest Problem Statement
Given a list of numbers, rearrange them such that every second element is greater than its adjacent elements. Implement a function to achieve this rearrangement.
Inp...read more
Ans. Brute forceSpace Complexity: O(1)Explanation: Time Complexity: O(n)Explanation:
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Round duration - 50 Minutes
Round difficulty - Medium

It was the screening round he asked me 2 questions 
First one is easy and other one is medium type

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Add your answer
Q2. 
Root to Leaf Path Problem Statement
Given a binary tree with 'N' nodes numbered from 1 to 'N', your task is to print all the root-to-leaf paths of the binary tree.
Input:
The first line of the input con...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

This is the first round in the loop interviews. Are you familiar with Javascript. Why do we use js. How do you use js to change the value of a textbox.

Q1. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Add your answer
Q2. 
Construct Tree from Preorder Traversal
Given a list of integers pre[] of size n, representing the preorder traversal of a special binary tree where each node has 0 or 2 children, and a boolean array isLea...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was the team fit round

Round duration - 45 Minutes
Round difficulty - Medium

4tn round in the loop, he asked me to design a game. He focused both on backend and frontend.
..

Q1. 
Bursting Balloons Problem
Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Another problem solving round

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Add your answer

Q1. Oops concepts and streams
Add your answer
Q2. Microservices spring boot
Add your answer