← Back to Directory

Jump Trading

Large Enterprises

Screna has 7 Jump Trading interview write-ups. The most reported round is the technical phone screen (6).

7 interview notes · updated Jun 2026

Jump Trading·Software Engineer·Technical Phone Screen

May 2026
Interviewed at Jump Trading for a software engineer role. One coding question, fairly algorithmic, nothing crazy in terms of setup but the details matter more than they look at first glance.
  • Given two arrays of equal length where each index pair represents a fraction, find which fraction (in its simplest form) appears most often and return its count.

“Looks straightforward until you realize you need to handle sign normalization and not just GCD reduction.”

View Post

Jump Trading·Software Engineer·Technical Phone Screen

May 2026
Jump Trading coding screen, stack-based interpreter problem. Felt pretty mechanical at first but the edge cases sneak up on you fast.
  • Implement a stack-based interpreter that processes a string of whitespace-separated tokens. Tokens can be non-negative integers, '+', '-', 'DUP', or 'POP'. Integers get pushed; '+' and '-' pop two values and push the result; 'DUP' copies the top; 'POP' removes the top. Return an error for any illegal operation or if the stack is empty at the end, otherwise return the top value.

“Started off thinking it was trivial, just a stack with a switch statement.”

View Post

Jump Trading·Software Engineer·Onsite - Coding / Algorithms

May 2026
Coding round at Jump Trading for a software engineering role. One problem, file permissions, filtering for read-only files from a batch of queries. Pretty focused and not too long.
  • You're given a list of file access queries, each containing an owner, a permission type, and a filename. Which files are read-only, meaning no query ever grants write or any other non-read permission to them?

“Basically a grouping problem.”

View Post

Jump Trading·Software Engineer·Technical Phone Screen

May 2026
Interviewed for a software engineering role at Jump Trading and got a bit-manipulation problem that sounds trivial once you see the solution, but I spent way too long overcomplicating it before the obvious approach clicked.
  • Given an array of positive integers, find the size of the largest subset where the bitwise AND of all elements is greater than zero.

“I went down a subset enumeration rabbit hole for a couple minutes before realizing that's completely the wrong direction.”

View Post

Jump Trading·Software Engineer·Technical Phone Screen

May 2026
Jump Trading system design question focused on file comparison utilities. Pretty niche but actually a fun problem if you've worked with data pipelines before. The depth they expected was more than I anticipated going in.
  • Given a source file and a destination file, compare their contents and report whether and how they differ. Walk through line-based vs byte-based comparison, how you'd handle large files without loading both into memory, and how you'd extend the solution to work across a directory of files.

“I started with the naive approach, load both files, diff them line by line, which they immediately pushed back on for large files.”

View Post

Jump Trading·Software Engineer·Technical Phone Screen

Apr 2026
Jump Trading had me debug a workflow management system that handled nested sub-workflows. The whole session was basically: here's broken code, find out why deeply nested steps fall apart, fix it, then write tests for the ugly edge cases.
  • Given a buggy workflow engine that processes nested sub-workflows, identify and fix the issues causing incorrect behavior when steps are deeply nested.
  • How would you ensure errors from nested workflow failures propagate correctly to the parent level without silently swallowing exceptions?
  • Write tests that cover deeply nested workflow cases and failure paths in the implementation you just fixed.

“The recursion bug was subtle.”

View Post

Jump Trading·Software Engineer·Technical Phone Screen

Apr 2026
Jump Trading coding screen for a software engineer role. One question, pretty focused on array manipulation and carry propagation. Nothing too wild but you need to get the edge cases right or it falls apart.
  • Given an array of digits representing a non-negative integer (most significant digit first), increment the integer by one and return the resulting digit array.

“The base case is easy but carries are where people slip up.”

View Post