SDE intern Mindtickle
- Result
- Withdrew
- Location
- Pune
- Posted
- 30 Aug 2025
Summary
I interviewed for an SDE Intern role at Mindtickle in Pune, which involved a single technical round with two coding problems. Although I cleared the interview, I ultimately declined the offer after securing a better opportunity.
How it went
I had a single technical interview for the SDE Intern role at Mindtickle in Pune. The interview lasted approximately one hour and consisted of two coding problems.
Technical Interview
During the interview, I was presented with two distinct coding challenges:
Problem 1: Maximum Performance of a Team - This problem involved optimizing team performance based on individual speeds and efficiencies, with a constraint on team size. I approached this by sorting employees by efficiency and utilizing a min-heap to manage speeds.
Problem 2: Longest Increasing Subsequence (LIS) - This was a standard dynamic programming problem, for which I provided a common DP solution.
Outcome
A week after my interview, Mindtickle extended an offer. However, by that time, I had already accepted an offer from BrowserStack, which I believed offered a superior work culture and reputation. Consequently, I politely declined Mindtickle's offer.
Questions asked (2)
- 01
Maximum Performance of a Team
Data Structures & Algorithms · Hard
Given an array of
speed[]and an array ofefficiency[], and an integerKrepresenting the maximum team size.The performance of a team is calculated as:
(sum of speeds in the team) × (minimum efficiency in the team).Examples:
- Example 1:
speed = [2, 3, 4]efficiency = [1, 2, 2]K = 2
Output:14 - Example 2:
speed = [5, 8, 2, 9]efficiency = [1, 9, 2, 4]K = 2
Output:68 - Example 3:
speed = [1, 2, 3, 4, 5]efficiency = [5, 4, 3, 2, 1]K = 3
Output:18
- Example 1:
- 02
Longest Increasing Subsequence
Data Structures & Algorithms · Medium
Open the problemFind the length of the longest strictly increasing subsequence of a given integer array
nums.