Mindsarray Network Interview Questions and Answers

Round duration - 75 Minutes
Round difficulty - Medium

The round consisted of 2 Coding based based questions.
These question were easy for as I have already done this while preparing.

Q1. Flip Equivalent Binary Tree
You have been given the root of two binary trees ‘ROOT1’ and ‘ROOT2’. You need to find if the two trees are flip equivalent or not after performing some flip operations on ‘TREE...read more
Ans. 
The problem is to determine if two binary trees are flip equivalent after performing flip operations on one of the trees.
• Perform a depth-first search (DFS) on both trees simultaneously

• At each node, check if the values are equal and the left and right subtrees are either both null or both not null

• If the above conditions are met, recursively check the flip equivalence of the left and right subtrees

• If any of the condition...read more
Answered by AI
View 2 more answers
Q2. Split Array Into Increasing Subsequences
You are given an integer array/list ‘ARR’ of size 'N' that is sorted in ascending order. Your task is to return '1' if and only if you can split it...read more
Ans. 
The task is to determine if an integer array can be split into one or more increasing subsequences with a length of at least 3.
• Check if the array can be split into increasing subsequences by iterating through the array.

• Keep track of the current subsequence and its length while iterating.

• If the difference between the current element and the previous element is not 1, start a new subsequence.

• If the length of any subseque...read more
Answered by AI
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Easy

The interview started a bit late as I it to be at 11:30 am but started at 12:15pm So Had to wait. Apart from these the overall experience was great and the interviewer was also kind and had a smiling face.

Q1. Ninja And Alternating Largest
Ninja is given a few numbers, and he is being asked to rearrange the numbers so that every second element is greater than its left and right element.
Suppose the given array...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Iterate through the array and check if every second element is greater than its left and right element

• If not, swap the current element with its adjacent element to satisfy the condition

• Continue this process until the entire array satisfies the condition

• Return 1 if the array satisfies the condition, else re
Answered by AI
View 2 more answers
Q2. Puzzle
You have measure 4litre using 3 cups of 3,5 and 8 litres.
Ans. 
Tip 1 : Cross quesion the interviewer on whatever doubt You have like asked Is the water infinite.
Tip 2 : Before jumping to a soln always cross verify in your mind once.
Tip 3 : Keep on speaking whatever you think Never be on Doubt make it a healthy conversation.
Answered by CodingNinjas
View 1 more answer

Round duration - 30 Minutes
Round difficulty - Easy

10:30 PM 
Interviewer was Cool.

Q1. Technical Question
This round was completely about my projects and my previous internships. There was lot of drilling on my projects like motive behind doing it.Futher improvement in Your project.
Ans. 
The interview focused on the candidate's projects and previous internships.
• Drilling on the motive behind the projects

• Discussion on further improvements in the projects
Answered by AI
View 1 more answer

Round duration - 5 minutes
Round difficulty - Easy

At 10:00 am

Q1. Basic HR Questions
No problems were asked just said do u want to ask about me or the company. And how was my interview experience.
Ans. 
The interviewer asked if there were any questions about them or the company, and how the interview experience was.
• Express interest in learning more about the interviewer's role and experience.

• Ask about the company culture and values.

• Inquire about the next steps in the interview process.

• Provide positive feedback about the interview experience.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

Q1. Sort 0 1
You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution which scans the array/list only once an...read more
Ans. 
Keep two index variables and traverse from the end.
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

Q1. Valid Perfect Square
You have been given an integer ‘N’. You are supposed to find if the given integer ‘N’ is a perfect square or not. A perfect square is an integer that is the square of an integer.
Inpu...read more
Ans. 
Two nested for loops and check if sum equal to given number
Answered by CodingNinjas
View 2 more answers
Q2. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

Q1. Bottom View Of Binary Tree
Given a binary tree, print its bottom view from left to right. Assume, the left and the right child make a 45-degree angle with the parent.
A binary tree is a tree in which eac...read more
Ans. 
Do a level order traversal and update a hashmap based on horizontal distances from the root.
Answered by CodingNinjas
View 3 more answers

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

Q1. Puzzle Question
It was an android specific question on how to implement multiple recycler views on a magnified screen.
Ans. 
Tip 1 : Have a basic understanding of recycler view
Tip 2 : Recycler with multiple view types
 
Answered by CodingNinjas
Add your answer
Q2. Puzzle Question
Implement various activities with a cart activity in an e-commerce app.
Ans. 
Tip 1 : Basic flow and lifecycle of activities and fragments.
Tip 2 : Knowledge about launch modes and view models.
 
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Q1. Basic HR Questions
Why do you want to join us?
What is your goal?
How are you a good fit?
Ans. 
Tip 1 : Just be honest. 
Tip 2 : Don't try to oversell or fake.
 
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. Automation Testing Question
What’s the difference between manual testing and automated testing?
Add your answer
Q2. Automation Testing Question
What is cross-browser testing?
Add your answer
Q3. Automation Testing Question
What are the different parts of a test automation framework?
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. Selenium Question
What is meant by a locator and name a few different types of locators present in Selenium.
Add your answer
Q2. Selenium Question
What is the difference between the commands "type" and "typeAndWait" in the context of Selenium?

 
Add your answer
Q3. Selenium Question
What is an XPath?
Add your answer
Q4. Selenium Question
Explain the difference between driver.close() and driver.quit() command in Selenium?
Add your answer