J.P. Morgan interview questions

Showing 31–53 of 53 results

• Find the Maximum-Sum Contiguous SubarrayMedium

  Implement Kadane's algorithm to find the maximum sum of a non-empty contiguous subarray in linear time and constant auxiliary space, with proper handling for all-negative inputs and potential 64-bit integer overflow.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Group anagrams and count string in gridMedium

  This question evaluates algorithmic problem-solving skills in string processing, hashing/grouping and grid traversal/backtracking, along with the ability to analyze time and space complexity and trade-offs.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Group strings that are anagramsEasy

  This problem tests your ability to efficiently group strings based on their character counts and your knowledge of hash maps to solve anagram-related categorization problems.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnsite
• Implement Integer Square RootMedium

  This question evaluates numerical algorithm design and integer arithmetic competence, including robustness for edge cases and overflow handling, and is categorized in the Coding & Algorithms domain.

  J.P. MorganData ScientistCoding & AlgorithmsTechnical Screen
• Implement KNN from ScratchMedium

  This problem tests your ability to implement the K-Nearest Neighbors (KNN) algorithm from scratch, focusing on distance computation, sorting, and majority voting logic.

  J.P. MorganData ScientistCoding & AlgorithmsTechnical Screen
• Implement Merge SortMedium

  This problem tests your ability to implement the Divide and Conquer paradigm, specifically the recursive merge sort algorithm, while maintaining stability and managing auxiliary space.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Implement an O(1) LRU CacheEasy

  This problem tests your ability to combine a hash map with a doubly linked list to achieve O(1) time complexity for cache operations.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Improve shopping cart latency and stock notificationsEasy

  This question evaluates a candidate's ability to design scalable, low-latency e-commerce architectures and real-time notification mechanisms while reasoning about data consistency, concurrency control, and correctness under high traffic (including concerns like avoiding oversells).

  J.P. MorganSoftware EngineerSystem DesignOnline Assessment
• Interpret Model Metrics, Regularization, and Resampling FundamentalsMedium

  This problem tests your understanding of foundational machine learning metrics for imbalanced classification and the theoretical utility of regularization and resampling techniques.

  J.P. MorganData ScientistStatistics & MathHR Screen
• Java Core Deep Dive: Concurrent Collections and Java 8 FeaturesMedium

  This question tests your understanding of thread-safety in Java collections and your ability to refactor imperative code into functional Java 8 style streams.

  J.P. MorganSoftware EngineerSoftware Engineering FundamentalsOnsite
• Merge Overlapping IntervalsMedium

  This problem tests your ability to manipulate array-based data by identifying and merging intersecting ranges using a greedy sorting strategy.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize Operations to Balance ShipmentsMedium

  This question evaluates algorithmic optimization and array partitioning skills, focusing on modeling minimal integer adjustments to equalize partition sums and demonstrating numerical reasoning under constraints.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Optimize User-and-Region Queries on a Million-Row TableMedium

  Evaluate and design database access patterns, indexing strategies, and scaling techniques (partitioning, sharding, replication) for a financial user-profile system with high regional skew and frequent lookups.

  J.P. MorganSoftware Engineer IISystem DesignOnsite
• Reason About Concurrency, CAP Trade-Offs, and Kubernetes ScalingMedium

  This problem tests your understanding of fundamental concurrency concepts, distributed systems trade-offs under partition, and the practical application of Kubernetes scaling mechanisms in a high-throughput environment.

  J.P. MorganSoftware Engineer IISoftware Engineering FundamentalsOnsite
• Reason About Top K Frequent Values at ScaleMedium

  Tests understanding of single-machine bounded-heap top-k frequency counting and how to scale the design to distributed, partitioned data pipelines.

  J.P. MorganSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Return Every Index Pair Whose Values Sum to a TargetMedium

  This problem tests your ability to handle frequency counts and index tracking using hash maps to identify all possible index pairs that sum to a specific target, particularly in the presence of duplicate values.

  J.P. MorganMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Return the K Largest IntegersMedium

  This problem tests the ability to efficiently find the k largest elements in an unsorted array using heap-based data structures to optimize for cases where k is significantly smaller than the input size.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Review a PR for thread-safe request handlingMedium

  This problem tests your ability to identify race conditions and thread-safety issues in a concurrent service and suggests robust design patterns for handling shared resources.

  J.P. MorganSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Review concurrent code qualityMedium

  This question tests your ability to identify thread-safety issues, improper synchronization, and architectural code smells within a multi-threaded data processing class.

  J.P. MorganSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Solve tiling, probability, and nested-radical puzzlesMedium

  This problem tests your ability to derive recurrence relations for combinatorial tiling, solve infinite series limits, and calculate exact probabilities using combinations.

  J.P. MorganData ScientistCoding & AlgorithmsOnsite
• Split Modules Across Three Servers to Maximize the Minimum Deployment DifficultyMedium

  Assign modules with given difficulty values to three non-empty servers so that the smallest value of |d1 - d2| + |d2 - d3|, over one module picked from each server, is as large as possible. Tests max-min reasoning over partitions, the role of the middle server, and handling of duplicates and large values.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Test whether samples follow a binomial distributionMedium

  This problem tests the application of goodness-of-fit testing to verify if a set of discrete observations conforms to a binomial distribution.

  J.P. MorganData ScientistMachine LearningOnsite
• Two Sum — Indices Summing to a TargetMedium

  This question tests the ability to trade space for time by using a hash map to achieve linear time complexity when finding a pair of elements that satisfy a target sum.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnsite