practice a little every day, paws crossed ♡
Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 4321–4350 of 9403 results
- J.P. MorganMediumQuantitative ResearcherExplain Daily Signal Construction and a Prediction Workflow
Explain daily quantitative signal construction and prediction at an appropriate level of disclosure, with point-in-time inputs, workflow validation, ownership, and confidentiality boundaries.
Machine LearningTechnical Screen - J.P. MorganMediumData ScientistExplain Overfitting and Transformer Basics
This question tests your conceptual understanding of model generalization, the mechanics of the Transformer architecture, and the trade-offs involved in sequence modeling.
Machine LearningTechnical ScreenDeep LearningTransformersBias-Variance Tradeoff - J.P. MorganMediumSoftware EngineerExplain Polymorphism and Binary Trees, and How You Use AI Tools as an Engineer
A software engineering fundamentals discussion with no coding problem: explain polymorphism with examples, describe binary trees and binary search trees with their traversals and costs, and explain how you use AI tools responsibly. It tests precise definitions, complexity reasoning and engineering judgment.
Software Engineering FundamentalsTechnical Screen - J.P. MorganMediumSoftware Engineer IIExplain Python Concurrency, HTTP Update Semantics, Garbage Collection, and Deadlocks
Assess core backend engineering fundamentals including Python concurrency tradeoffs, RESTful update semantics, runtime garbage collection mechanisms, and deadlock prevention strategies.
Software Engineering FundamentalsOnsitepythonconcurrencyrest-api - J.P. MorganMediumSoftware Engineer IIExplain Stack Use Cases and Mutability in Python Containers
This problem tests the understanding of LIFO data structure applications, the implications of object mutability in Python, and the technical constraints imposed by hashability in container types.
Software Engineering FundamentalsOnsitePythonData StructuresMemory Management - J.P. MorganMediumSoftware Engineer IIExplain Why You Are Changing Jobs and How You Communicated the Decision
This question assesses the candidate's ability to articulate professional motivations for moving roles while maintaining a positive narrative about their current employer and handling transitions with professional integrity.
Behavioral & LeadershipOnsiteCommunicationCareer GrowthProfessionalism - J.P. MorganMediumSoftware Engineer IIExplain a Project Architecture End to End
Tests your ability to present a production system architecture end-to-end, detailing data flow, ownership boundaries, database indexing and partitioning strategies, resilience patterns, and concrete architectural trade-offs.
System DesignOnsiteDatabase OptimizationArchitectureData Modeling - J.P. MorganMediumSoftware Engineer IIFind the Maximum-Sum Contiguous Subarray
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.
Coding & AlgorithmsOnsitedynamic-programmingarrayskadanes-algorithm - J.P. MorganMediumSoftware EngineerGroup anagrams and count string in grid
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.
Coding & AlgorithmsOnline Assessment - J.P. MorganEasySoftware EngineerGroup strings that are anagrams
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.
Coding & AlgorithmsOnsiteHash MapString ManipulationAlgorithms - J.P. MorganMediumData ScientistImplement Integer Square Root
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.
Coding & AlgorithmsTechnical Screen - J.P. MorganMediumData ScientistImplement KNN from Scratch
This problem tests your ability to implement the K-Nearest Neighbors (KNN) algorithm from scratch, focusing on distance computation, sorting, and majority voting logic.
Coding & AlgorithmsTechnical ScreenKNNSupervised LearningAlgorithms - J.P. MorganMediumSoftware Engineer IIImplement Merge Sort
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.
Coding & AlgorithmsOnsiteSortingDivide and ConquerRecursion - J.P. MorganEasySoftware EngineerImplement an O(1) LRU Cache
This problem tests your ability to combine a hash map with a doubly linked list to achieve O(1) time complexity for cache operations.
Coding & AlgorithmsTechnical ScreenData StructuresHash MapLinked List - J.P. MorganEasySoftware EngineerImprove shopping cart latency and stock notifications
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).
System DesignOnline Assessment - J.P. MorganMediumData ScientistInterpret Model Metrics, Regularization, and Resampling Fundamentals
This problem tests your understanding of foundational machine learning metrics for imbalanced classification and the theoretical utility of regularization and resampling techniques.
Statistics & MathHR ScreenStatisticsMachine LearningRegularization - J.P. MorganMediumSoftware EngineerJava Core Deep Dive: Concurrent Collections and Java 8 Features
This question tests your understanding of thread-safety in Java collections and your ability to refactor imperative code into functional Java 8 style streams.
Software Engineering FundamentalsOnsiteJavaConcurrencyCollections - J.P. MorganMediumSoftware EngineerMerge Overlapping Intervals
This problem tests your ability to manipulate array-based data by identifying and merging intersecting ranges using a greedy sorting strategy.
Coding & AlgorithmsTechnical ScreenArraysSortingGreedy - J.P. MorganMediumSoftware EngineerMinimize Operations to Balance Shipments
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.
Coding & AlgorithmsOnline Assessment - J.P. MorganMediumSoftware Engineer IIOptimize User-and-Region Queries on a Million-Row Table
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.
System DesignOnsiteDatabase OptimizationIndexingPartitioning - J.P. MorganMediumSoftware Engineer IIReason About Concurrency, CAP Trade-Offs, and Kubernetes Scaling
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.
Software Engineering FundamentalsOnsiteConcurrencyCAP TheoremKubernetes - J.P. MorganMediumSoftware EngineerReason About Top K Frequent Values at Scale
Tests understanding of single-machine bounded-heap top-k frequency counting and how to scale the design to distributed, partitioned data pipelines.
Software Engineering FundamentalsTechnical ScreenHeapHash MapDistributed Systems - J.P. MorganMediumMachine Learning EngineerReturn Every Index Pair Whose Values Sum to a Target
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.
Coding & AlgorithmsTechnical ScreenHash MapArraysAlgorithms - J.P. MorganMediumSoftware Engineer IIReturn the K Largest Integers
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.
Coding & AlgorithmsOnsiteHeapSortingAlgorithms - J.P. MorganMediumSoftware EngineerReview a PR for thread-safe request handling
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.
Software Engineering FundamentalsTechnical ScreenConcurrencyThread-SafetyDesign Patterns - J.P. MorganMediumSoftware EngineerReview concurrent code quality
This question tests your ability to identify thread-safety issues, improper synchronization, and architectural code smells within a multi-threaded data processing class.
Software Engineering FundamentalsTechnical ScreenConcurrencyJavaThread-Safety - J.P. MorganMediumData ScientistSolve tiling, probability, and nested-radical puzzles
This problem tests your ability to derive recurrence relations for combinatorial tiling, solve infinite series limits, and calculate exact probabilities using combinations.
Coding & AlgorithmsOnsiteCombinatoricsDynamic ProgrammingProbability - J.P. MorganMediumSoftware EngineerSplit Modules Across Three Servers to Maximize the Minimum Deployment Difficulty
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.
Coding & AlgorithmsOnline Assessment - J.P. MorganMediumData ScientistTest whether samples follow a binomial distribution
This problem tests the application of goodness-of-fit testing to verify if a set of discrete observations conforms to a binomial distribution.
Machine LearningOnsiteStatisticsHypothesis TestingProbability - J.P. MorganMediumSoftware EngineerTwo Sum — Indices Summing to a Target
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.
Coding & AlgorithmsOnsiteArraysHash MapsAlgorithms
J.P. Morgan