Mango Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Evening test around 5
Platform :- SHL
Environment was amazing

Q1. 
Subtree of Another Tree Problem Statement
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Explanation:
...read more
Ans. 
Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.
• Check if the second tree is a subtree of the first tree by comparing their structures and node values.

• Use a recursive approach to traverse both trees and check for equality.

• Handle cases where one tree is null or the values do not match.

• Return true if S is a subtree of T, false otherwise.
Answered by AI
Add your answer
Q2. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N*N matrix, find the position of a target integer X.
• Iterate over each row and column to find the target integer X

• Utilize the sorted nature of the matrix to optimize the search process

• Return the position of X if found, else return -1 -1
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

1 Hour 
Afternoon

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge, return -1 if no merging occurs.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until they meet at the merging point
Answered by AI
Add your answer
Q2. 
Problem: Pair Sum in a Binary Search Tree
Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...read more
Ans. 
Find pairs of nodes in a BST that sum up to a given value 'S'.
• Traverse the BST in-order to get a sorted list of nodes.

• Use two pointers approach to find pairs with sum 'S'.

• Keep track of visited nodes to avoid using the same node twice in a pair.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Online Round held on Chime

Q1. 
Is Binary Heap Tree Problem Statement
You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.
Input:
The first line of input contains an integer ‘T’ denoti...read more
Ans. 
Determine if a given binary tree is a binary heap tree or not based on certain properties.
• Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.

• Ensure that every parent node is greater than all its children nodes, forming a max-heap.

• If any node does not have a left or right child, it should be represented as -1 in
Answered by AI
Add your answer
Q2. 
Edit Distance Problem Statement
Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...read more
Ans. 
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the edit distances between substrings of the two input strings.

• Fill up the array based on the minimum of three possible operations: insert, delete, or replace.

• The final answer will be the value at...read more
Answered by AI
Add your answer