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

Adani’s coding round assesses problem-solving and DSA fundamentals for technology roles in the conglomerate (ports, energy, digital). The online test or technical round typically includes 1–2 coding problems (easy to medium) with emphasis on arrays, strings, and basic data structures. They look for clear logic, correct code, and time management. Strengthen basics and practice output-based and implementation-style problems.

Adani Coding Round at a Glance

Format: Online test or technical interview with 1–2 coding problems. Difficulty: Easy to medium. Topics: Arrays, strings, basic DSA, simple algorithms. Focus: Correctness, clarity, and time management.

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

Adani often emphasizes arrays (traversal, two pointers, subarray problems), strings (validation, parsing, palindrome), basic data structures (hash map, stack), and simple algorithms (sorting, greedy). Focus on clean implementation and handling edge cases rather than advanced DS; aptitude and technical MCQs may also appear in the same process.

Related Resources

Interview Experience

Real interview experiences.

Preparation Guide

Complete preparation strategy.

---

Practice these problems with a focus on arrays, strings, and basic DSA to align with Adani’s coding round.

Last updated: February 2026