MindTickle Interview Questions, Process, and Tips

Q1. 1. Regarding Past Experience 2. Fit with Mindtickle's Product
Add your answer
Q2. 1. Give an example of when you iterated on your product.
Ans. 
Iterated on a product to improve user experience
• Identified pain points through user feedback

• Conducted user research to understand user needs

• Implemented changes based on feedback and research

• Tested new features with a subset of users

• Analyzed data and user feedback to further refine the product
Answered by AI
Add your answer

Q1. Resume review and Guesstimate
Add your answer

Product design case study

Q1. Hiring manager round
Add your answer

Q1. CPO round on culture fitment
Add your answer

I had given interview 5 years ago but now the pattern has change, a code assignment is given to fetch data

Q1. Array, object based problem , UI based questions
Add your answer

Coding test was held on Hackerrank primarily focussing on Dynamic Programming (DP)problems.

Q1. Discussion of approaches used to solve the previous coding test questions.
Add your answer

Q1. Alien Dictionary Problem
Ans. 
The Alien Dictionary Problem is a question that involves sorting words based on a given alien language's alphabetical order.
• The problem can be solved using topological sorting.

• Create a graph where each character is a node and each word is an edge.

• Perform a topological sort on the graph to get the correct order of characters.

• If there is a cycle in the graph, it means the alien language is invalid.
Answered by AI
Add your answer
Q2. Design E-commerce application database (primarily asked to check SQL concepts)
Add your answer

Q1. One-on-one with VP of Engineering mostly focussed on projects
Add your answer
Q2. OS concepts like pre-emption
Add your answer

Q1. General discussion
Add your answer

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
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'. Find t...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
View 3 more answers

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
You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denotes the elevation of the 'ith' bar. Pri...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
View 3 more answers

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
Ninja has recently started a startup. In his startup, there is only one conference room for a meeting. Ninja receives an array/list ‘MEETINGS’ of back-to-back appointment requests an...read more
Ans. Recursion
As we know if Ninja skips the previous meeting, then he has two choices for the current meeting, that is he can either schedule this meeting or he can skip this meeting.
If Ninja schedules the previous meeting, then he has only one choice that is he has to skip the current meeting.
 
Here is the algorithm:
1. Base case: If the current meeting number is greater than the number of meetings:
   • Return 0.
2. Now Ninja has t...read more
Answered by CodingNinjas
View 3 more answers
Q2. Trapping Rain Water ll
Given an M * N matrix, where the value at any cell denotes the height of that cell in a 2-D elevation map. You need to find the volume of water that can be trapped within it.
For a ...read more
Ans. Priority Queue Implementation.
Approach: The border cells can never hold water as water will always flow out from there. So we will assume all the border cells as our boundary.
 
Now the water that can behold at least inside the cells will be equal to the minimum height of the boundary.
 
For eg if matrix = [ 8, 8, 8, 8 ]
               &nbs...read more
Answered by CodingNinjas
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, find the smallest subarray of 'A' containing exactly 'K' distinct integers.
Note :
...read more
Ans. Brute Force Approach
Algorithm
 
• Pick each element from the array as the starting element(i) of the subarray,
  • Initialize an empty set to store distinct elements in the subarray.
  • Pick each remaining element(i, i+1,..n - 1) from the array as the last element(jth).
    • Add the current element to the set.
    • If the set size equals k then update the results and break from the inner loop(we have already found k distinct elements incr...read more
Answered by CodingNinjas
View 1 more answer