Mahindra Coding Questions 2025-2026 | Placement Interview Problems with Solutions

Mahindra’s coding round assesses programming and DSA for technology roles across the group (IT, automotive, etc.). The process usually includes an online test or technical interview with 1–2 coding problems (easy to medium) and often aptitude or technical MCQs. They test arrays, strings, basic data structures, and logic; correctness and clarity are valued. Practice fundamentals and time management.

Mahindra Coding Round at a Glance

Format: OA or technical round with 1–2 coding problems; may include aptitude/MCQs. Difficulty: Easy to medium. Topics: Arrays, strings, basic DSA, logic. Focus: Correctness, clarity, and fundamentals.

Coding Questions - Complete Problem Set

Practice coding interview questions with solutions.

Arrays & Strings

1. Two Sum

def two_sum(nums, target):
    seen = {}
    for i, num in enumerate(nums):
        if target - num in seen:
            return [seen[target - num], i]
        seen[num] = i
    return []

2. Valid Parentheses

def is_valid(s):
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}
    for char in s:
        if char in mapping:
            top = stack.pop() if stack else '#'
            if mapping[char] != top:
                return False
        else:
            stack.append(char)
    return not stack

3. Reverse String

def reverse_string(s):
    return s[::-1]

4. Palindrome Check

def is_palindrome(s):
    s = ''.join(c.lower() for c in s if c.isalnum())
    return s == s[::-1]

5. Merge Intervals

def merge(intervals):
    intervals.sort(key=lambda x: x[0])
    merged = []
    for interval in intervals:
        if not merged or merged[-1][1] < interval[0]:
            merged.append(interval)
        else:
            merged[-1][1] = max(merged[-1][1], interval[1])
    return merged

6. Maximum Subarray

def max_subarray(nums):
    max_sum = current_sum = nums[0]
    for num in nums[1:]:
        current_sum = max(num, current_sum + num)
        max_sum = max(max_sum, current_sum)
    return max_sum

7. LRU Cache

from collections import OrderedDict

class LRUCache:
    def __init__(self, capacity):
        self.cache = OrderedDict()
        self.capacity = capacity

    def get(self, key):
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)
        return self.cache[key]

    def put(self, key, value):
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)

Company-Specific Focus Areas

Mahindra frequently tests arrays (traversal, two sum, subarray), strings (validation, palindrome), hash maps and stacks, and basic logic. Aptitude and technical MCQs are commonly part of the same process. Focus on correctness and edge cases; advanced DS is less common than solid fundamentals.

Related Resources

Interview Experience

Real interview experiences.

Preparation Guide

Complete preparation strategy.

---

Practice these problems with focus on arrays, strings, and basic DSA for Mahindra’s coding round.

Last updated: February 2026