Minda Corporation Limited interview experience Real time questions & tips from candidates to crack your interview

IT Intern

Minda Corporation Limited
upvote
share-icon
1 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
The interview began with a self-introduction, followed by a discussion on technical concepts related to trees, graphs, and their real-life applications. Topics such as the role of trees in file systems and databases, and graphs in networking and dependency resolution, were covered. Overall, the interview emphasized conceptual clarity and practical applications.
Application story
After applying, an invitation for the first technical interview was received via email. The interview was conducted on Google Meet and focused mainly on data structures, graphs, operating systems, and backend concepts.
Why selected/rejected for the role?
The selection was based on strong problem-solving skills, clear understanding of graphs and trees, and good knowledge of operating system concepts. The interviewer appreciated the ability to explain real-world applications of graphs and trees, as well as providing structured answers for kernel vs. user space and OS architecture. Additionally, the ability to write optimized solutions and showcase practical experience through projects involving backend technologies and system design contributed to the success. Strong communication skills and confidence in explaining technical concepts also played a key role in securing the offer.
Preparation
Duration: 6 months
Topics: DSA, Graphs, Trees, OS, System Design
Tip
Tip

Tip 1: Solve at least 100+ problems on graphs and trees to build a strong foundation.
Tip 2: Focus on real-world applications of OS concepts like scheduling, memory management, and kernel vs. user space.
Tip 3: Work on projects involving graph-based algorithms to understand practical implementations.

Application process
Where: Referral
Eligibility: NA, (Unpaid Internship)
Resume Tip
Resume tip

Tip 1: Include at least two strong projects demonstrating practical application of data structures and algorithms.
Tip 2: Highlight problem-solving skills with certifications and competitive coding achievements.

Interview rounds

01
Round
Medium
Video Call
Duration40 minutes
Interview date10 Feb 2025
Coding problem3

1. Data Structure Applications

Explain real-world applications of Trees (Learn) and Graphs (Learn).

2. Operating System

Explain Kernel Space vs User Space. (Learn)

3. Longest Substring Without Repeating Characters

Moderate
20m average time
80% success
0/80
Asked in companies
Morgan StanleyAmazonWalmart

Find Longest substring with no repeating character.

Problem approach

Use Sliding Window: Expand right, store characters in a set, shrink left on duplicates, update max length, repeat until end.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6451 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes