MindTickle Interview Questions and Answers for Freshers

Round duration - 50 minutes
Round difficulty - Medium

First round was a basic javascript problem-solving round. The interviewer judged my grasp on fundamental javascript concepts like objects, closures, polyfills, etc. It was during the afternoon and was conducted on google meet and leetcode playground.
The interviewer was very calm. I was first asked some general questions like why I'm applying for this role and what are the projects I've done.

Q1. 
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. 
This question asks to find the position of a target integer in a row-wise and column-wise sorted matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position as {i, j}

• If the target integer is not found, return {-1, -1}
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

One DSA Question along with some javascript questions were asked like hoisting, difference between JSX and Javascript etc.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water for all bars and return the total amount.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was conducted by the Interview Vector, Usually first two rounds are conducted by Interview vector on behalf of mindtickle, Interviewer joined the call on time. He gave his introduction and asked to introduce me. He asked about some of my projects and internships than directly jumped to DSA questions. He shared me the Leetcode question link and I have to write the code there and have to submit it. After that I have to paste my solution on a Google doc shared by him and have to write my approach, Time complexity and space complexity of the solution. So he asked two questions in this round and I solved first one completely and second one partially, questions were of medium and hard difficulty level respectively.

Q1. 
Is Bipartite Graph Problem
You are provided with an undirected graph having 'N' nodes numbered from 0 to 'N-1'. There is a list 'EDGES' of size 'M', which contains all the edges of this graph. The task is...read more
Ans. 
Determine if a given undirected graph is Bipartite or not.
• Check if the graph can be divided into two sets such that each edge connects nodes from different sets.

• Use BFS or DFS to color nodes alternatively and check for any conflicts.

• If a conflict is found, the graph is not Bipartite.

• If no conflict is found, the graph is Bipartite.
Answered by AI
Add your answer
Q2. 
Topological Sort Problem Statement
You have a directed acyclic graph (DAG). The task is to determine any topological sorting of this graph.
Explanation:
A Directed Acyclic Graph (DAG) is a graph that ha...read more
Ans. 
Implement a function to determine any topological sorting of a directed acyclic graph (DAG).
• Create a graph using the given input of nodes and edges

• Perform a topological sort on the graph to find a valid ordering of vertices

• Output the sorted vertices as a single line for each test case
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was also conducted by the Interview Vector, we started with the Introduction that she told me that their will be no correct or wrong answer for this round they will check by thinking ability and how vast I can think in designing a system. Than she gave me the problem statement in which I have to design an online Transport renter service. she also shared some requirements with me and shared a google doc where I have to write all the things that will come in my mind. So we discussed about the DB and tables that we will be requiring in this service, we also discussed for different enitities that we'll be requiring than our time gets over and we winded up and Thanked each other and dropped the call.

Q1. Can you design an online transport rental service?
Ans. 
An online transport rental service allows users to book vehicles for short-term use.
• Users can search for available vehicles based on location, date, and time.

• The service should include options for different types of vehicles such as cars, bikes, and scooters.

• Users should be able to make reservations, view rental details, and make payments online.

• The platform should have a rating system for both users and vehicles to en...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was taken by the SDE-2 of the MindTickle and it was also a system design round. We both started with the introduction then he gave me the problem statement to design a chess board game. We both started discussing on it, I started writing down the entities and services that we'll be requring. Than he told me to write the methods in each service and implement them, I got confused in them and started messing up the things. we discussed various things related to methods and services implementation and our time got over than he winded up and asked for any questions and we dropped the call.

Q1. Can you design an online Chess Board Game?
Ans. 
Yes, an online Chess Board Game can be designed with features like multiplayer mode, AI opponent, chat functionality, and leaderboard.
• Implement a chess board with 64 squares and pieces (king, queen, rook, etc.)

• Include multiplayer mode for playing against friends or random opponents

• Develop an AI opponent with varying difficulty levels

• Incorporate chat functionality for communication between players

• Include a leaderboard t...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

It was a DSA round where I was asked 2 coding questions and optimised approaches for both.

Q1. 
Ninja and His Meetings Problem Statement
Ninja has started a new startup with a single conference room available for meetings. Given an array/list MEETINGS of consecutive appointment requests, Ninja must ...read more
Ans. 
Find the maximum total booked minutes possible in a conference room for all meetings with a 15-minute break between meetings.
• Iterate through the list of meeting durations and calculate the maximum total booked minutes considering the 15-minute break constraint.

• Keep track of the total booked minutes and skip consecutive meetings that violate the break constraint.

• Return the maximum total booked minutes for each test case...read more
Answered by AI
Add your answer
Q2. 
Trapping Rain Water II Problem Statement
Given an M * N matrix where each cell's value represents its height in a 2-D elevation map, calculate the total volume of water that can be trapped after rainfall.
...read more
Ans. 
Calculate the total volume of water that can be trapped in a 2-D elevation map after rainfall.
• Iterate through each cell in the matrix and calculate the trapped water based on the surrounding heights.

• Use a stack or queue to keep track of the cells to be processed.

• Consider edge cases such as when the matrix is empty or has only one row or column.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

It was more of discussion around my projects and resume. Also asked some questions related to me. What are your hobbies? Willing to relocate?

Q1. 
Smallest Subarray With K Distinct Elements
Given an array A consisting of N integers, your task is to find the smallest subarray of A that contains exactly K distinct integers.
If multiple such subarrays...read more
Ans. 
Find the smallest subarray with exactly K distinct elements in an array.
• Use a sliding window approach to keep track of the subarray with K distinct elements.

• Maintain a hashmap to count the frequency of each element in the window.

• Update the window size based on the number of distinct elements.

• Return the smallest subarray with K distinct elements.
Answered by AI
Add your answer