Flipkart Coding Questions - DSA Problems & Solutions

Company Overview

This page contains Flipkart coding questions from Flipkart OA placement papers with detailed solutions.

Coding Focus

Flipkart OA coding section includes 2-3 problems focusing on DSA. Master arrays, trees, graphs, and dynamic programming to succeed.

Flipkart Coding Questions Overview

Flipkart OA Coding Section:

• Problems: 2-3 coding problems
• Time: 60 minutes
• Languages: Java, C++, Python, Go

Coding Problems

Question 1: Maximum Subarray Sum (Kadane’s Algorithm)

Q1: Find the contiguous subarray with the largest sum.

Solution (Java):

public int maxSubArray(int[] nums) {
    int maxSoFar = nums[0];
    int maxEndingHere = nums[0];

    for (int i = 1; i < nums.length; i++) {
        maxEndingHere = Math.max(nums[i], maxEndingHere + nums[i]);
        maxSoFar = Math.max(maxSoFar, maxEndingHere);
    }

    return maxSoFar;
}

Time Complexity: O(n)

Related Resources

Flipkart 2024 Papers

Previous year papers with coding questions

View 2024 Papers →

Flipkart Main Page

Complete Flipkart placement guide

View Main Page →

---

Practice Flipkart coding questions regularly!