JP Morgan Coding Questions - DSA Problems & Solutions

Company Overview

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

Coding Focus

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

JP Morgan Coding Questions Overview

JP Morgan OA Coding Section:

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

Coding Problems

Question 1: Two Sum

Q1: Find indices of two numbers that add up to target.

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int complement = target - nums[i];
        if (map.containsKey(complement)) {
            return new int[]{map.get(complement), i};
        }
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)

Related Resources

JP Morgan 2024 Papers

Previous year papers with coding questions

View 2024 Papers →

JP Morgan Main Page

Complete JP Morgan placement guide

View Main Page →

---

Practice JP Morgan coding questions regularly!