Jump Trading Interview Questions 2026

100 Questions Unlock all questions ↓
Filter
Topic area
Difficulty

Filters apply to the free questions below.

Practice Bank

Jump Trading Quant Interview Practice

↗

Four framed prints are labelled with their measured widths: 18 cm, 21 cm, 24 cm and 15 cm. A conservator wants them side by side on an exactly 80 cm shelf, with no gaps or overlaps. Each label was produced by rounding the true width to the nearest whole centimetre; an exact half-centimetre is rounded up.

The labels add to 78 cm, but none of the original measurements survives. Can the conservator guarantee that all four prints will fit? Would the same guarantee hold if the shelf were only 79 cm long? Justify both answers without assuming the rounding errors cancel.

Hint 1

Every labelled width permits a range of true widths, not just its printed integer.

With half-centimetres rounded up, a label \(k\) means a true width in \([k-0.5,k+0.5)\). Add all four intervals and check whether the upper endpoint is included.

A width labelled \(k\) cm can be any value in the half-open interval \([k-0.5,k+0.5)\) cm: for instance, a width of exactly 18.5 cm would be labelled 19, not 18. The four true widths therefore lie respectively in
\[ [17.5,18.5),\quad [20.5,21.5),\quad [23.5,24.5),\quad [14.5,15.5). \]
Their total \(T\) lies in \([76,80)\) cm. All four rounding errors can point in the same direction, so adding only the displayed widths would not give a guarantee. Nevertheless, the upper endpoint 80 is excluded by the stated tie rule. Thus \(T<80\) for every admissible set of widths, and the 80 cm shelf is guaranteed to work.

The shorter 79 cm shelf is not guaranteed: widths 18.4, 21.4, 24.4 and 15.4 cm all round to their respective labels, yet total \(79.6\) cm. Conversely, the labels themselves could be exact true widths, totalling 78 cm, which would fit. Hence the 79 cm fit is genuinely undetermined by the measurements. The tie rule determines whether the total can equal 80 cm; either way, the 80 cm shelf fits the frames.

Assumptions

  • The shelf length is exact, and the frames need no gaps.

  • Only the four printed widths are known; an exact half-centimetre rounds up.

Final Answer

All four prints are guaranteed to fit on the 80 cm shelf, but not on a 79 cm shelf. Their possible combined width is in \([76, 80)\) cm.

Numerical reasoning and estimation
↗

Twelve guests take seats uniformly at random around a circular table. Among them is Noor, and four of the other eleven guests know how to operate the venue's emergency exit. Noor wants at least one of those four seated immediately beside her.

What is the probability that at least one of Noor's two neighbours knows the exit procedure? Each guest occupies one seat, and the two seats next to Noor contain different people.

Hint 1

It is easier to calculate the probability that neither neighbour is one of the four trained guests.

Conditional on Noor's seat, her two neighbours are a uniformly chosen pair from the other eleven people, without replacement.

Fix Noor's location; rotational symmetry means this does not change the probability. The unordered set of her two neighbours is uniformly distributed among \(\binom{11}{2}=55\) possible pairs. Of the other eleven guests, seven are not trained. Both neighbours are untrained in \(\binom{7}{2}=21\) pairs. Hence
\[ \Pr(\text{at least one trained neighbour}) =1-\frac{\binom72}{\binom{11}2} =1-\frac{21}{55}=\boxed{\frac{34}{55}}. \]
An ordered cross-check gives \(1-(7/11)(6/10)=34/55\). Multiplying \((7/11)^2\) would be wrong: after one untrained neighbour is seated, only six untrained people remain among ten available guests for the second adjacent seat.

Assumptions

  • All circular seatings are equally likely, with no reserved seats or group restrictions.

  • Exactly four of Noor's eleven possible neighbours are marked trained; trained status is fixed.

  • The two adjacent positions contain distinct guests, so the draws are without replacement.

Final Answer

\(\frac{34}{55}\), or about 61.8%.

Probability foundations
↗

Two delivery vans arrive independently. Van A's arrival time is uniform over the first two hours after opening, and van B's is uniform over the first three hours. The venue accepts the pair for one shared unloading slot only if their arrival times differ by at most one hour; otherwise they are assigned separate crews.

Given that the pair is accepted for the shared slot, what is the probability A arrived before B? Arrival times are measured continuously from opening, so exact ties have probability zero.

Hint 1

The point (A,B) is uniform on a 2-by-3 rectangle. Restrict attention to the strip \(\lvert A-B\rvert\le1\).

For \(A=x\) in \([0,2]\), measure the allowed B-interval above the diagonal \(B=x\) and the allowed interval below it. Integrate the two widths separately.

Write \(X\) for A's arrival time and \(Y\) for B's. Their joint density is constant, \(\frac1{2\times3}=\frac16\), on \(0\le x\le2\) and \(0\le y\le3\). Let \(C\) be \(\lvert X-Y\rvert\le1\). Conditional probabilities are ratios of the corresponding areas, since the density cancels.

For A to be first, we need \(x<y\le x+1\). For every \(x\in[0,2]\), the allowed Y-interval \((x,x+1]\) has width 1 and stays inside [0,3]. Its area is therefore \(\int_{0}^{2}1\,dx=2\).

For B to be first, the allowed Y-interval is \([\max(0,x-1),x)\), with width \(x\) for \(0\le x\le1\) and width 1 for \(1\le x\le2\). Its area is \(\int_0^1x\,dx+\int_1^2 1\,dx=\frac12+1=\frac32\).

These disjoint ordered regions partition \(C\) apart from a zero-area diagonal. Hence \(\operatorname{area}(C)=2+\frac32=\frac72\) and \(\Pr(X<Y\mid C)=\frac{2}{7/2}=\frac47\). As a cross-check, \(\Pr(C)=\frac{7/2}{6}=\frac7{12}\) and \(\Pr(X<Y\text{ and }C)=\frac26=\frac13\); \(\frac{1/3}{7/12}=\frac47\).

Assumptions

  • The two arrival times are independent continuous uniforms with windows [0,2] and [0,3] hours.

  • Acceptance is determined only by the absolute time difference, including boundary equality.

Final Answer

\(\frac47\). The longer possible arrival window for B makes A more likely to be first even after conditioning on being within one hour.

Conditional probability
↗

Six parcels are waiting in a depot, each meant for a different destination. Someone has randomly reassigned the six destination tags, with every one-to-one assignment equally likely. A worker must restore the correct labels.

Following a chain of wrong tags eventually returns to its starting parcel: that chain is a cycle. One sorting tray, costing $12 to prepare, lets the worker correct an entire cycle of length two or more, however long it is. A parcel already carrying its correct tag is a one-parcel cycle and needs no tray. There are no other correction costs.

Before seeing the assignment, how many trays does the depot expect to need, and what is its expected setup bill? Derive the result rather than counting only the number of wrong tags.

Hint 1

A permutation splits uniquely into disjoint cycles. Count all cycles first, then subtract the fixed points (already correct parcels).

Construct a uniform permutation of \(n\) labels from one on \(n-1\) labels: either make \(n\) a new singleton cycle (probability \(1/n\)), or insert it after one of the other \(n-1\) labels in an existing cycle. What recurrence follows?

Let \(C_n\) be the number of cycles, including singletons, in a uniformly random permutation of \(n\) labels. Starting from a uniform permutation on \(n-1\) labels, insert label \(n\) at one of \(n\) equally likely cycle slots. One slot forms a new one-element cycle; each of the other \(n-1\) inserts \(n\) into an existing cycle. This construction yields a uniform permutation on \(n\) labels, and therefore

\(\mathbb E[C_n]=\mathbb E[C_{n-1}]+1/n\), with \(\mathbb E[C_1]=1\).

Induction gives \(\mathbb E[C_6]=H_6=1+1/2+1/3+1/4+1/5+1/6=49/20\). But a fixed point needs no tray. For each parcel \(i\), the probability that its tag remains correct is exactly \(1/6\); summing the six indicators yields an expected one fixed point, irrespective of dependence between them. Therefore the number of trays \(T\) equals \(C_6\) minus the number of fixed points, and

\(\mathbb E[T]=49/20-1=29/20\).

Since a tray costs \(12\), the expected bill is \(12(29/20)=\boxed{\$17.40}\). For a check, the same construction for \(n=3\) gives one identity permutation with zero trays, three transpositions with one tray, and two 3-cycles with one tray. The average is \(5/6=H_3-1\), as predicted. A long cycle is still only one tray, while a fixed point costs nothing: counting misplaced parcels would charge for the wrong object.

Assumptions

  • Each of the \(6!\) tag permutations is equally likely.

  • A cycle of length at least two costs exactly one $12 tray; a fixed point incurs no setup cost.

  • There are no variable per-parcel costs.

Final Answer

Expected trays: \(\frac{29}{20}=1.45\); expected cost: $17.40.

Expectation and expected value
↗

Two siblings, Ada and Ben, are dividing the $100 proceeds of a market stall. The money is locked into ten $10 vouchers, and every proposed split must allocate whole vouchers; neither sibling can make side payments.

Ada proposes a split now (round 0), Ben may propose one in round 1 if the first is rejected or Ada passes, and Ada has a final turn in round 2. Rejection or passing advances one round. If the round-2 offer fails, an automatic settlement gives each sibling five vouchers in round 3. A successful proposal is paid immediately in its round. Ada does not discount later receipts; Ben values each voucher received one round later at 80% of its present value. Both maximize their own discounted receipts, responders accept if indifferent, and a proposer who is indifferent between securing an acceptable offer and passing chooses to pass.

Work backward to find the best immediately acceptable opening split and what actually happens. Would the outcome change if the $100 could instead be split into individual dollars?

Hint 1

Start at the last proposal. Ben compares a round-2 offer with the value, one round earlier, of his five-voucher fallback. Round up any required transfer to whole vouchers.

In round 2 Ben needs at least \(0.8\times5=4\) vouchers. Use that continuation split to find Ada's round-1 minimum, then Ben's round-0 minimum; check the proposer's own payoff from passing at every step.

All values below are measured in vouchers at the round in question. Only Ben discounts, by \(\delta_B=0.8\); Ada's factor is \(\delta_A=1\).

Round 2 (Ada proposes). If Ben rejects, his round-3 fallback is five vouchers, worth \(0.8(5)=4\) in round 2. The least acceptable whole-voucher offer gives Ben four and Ada six. Ben accepts on equality. Ada prefers six now to her fallback of five, so this offer is made.

Round 1 (Ben proposes). If Ada rejects, she receives six vouchers in round 2 and, with no discounting, values that at six in round 1. Ben must therefore give Ada at least six. He keeps four, strictly better than waiting to receive four in round 2, which is worth \(0.8(4)=3.2\) in round 1. Thus Ben offers \((\text{Ada},\text{Ben})=(6,4)\), accepted by Ada on indifference.

Round 0 (Ada proposes). Ben can get four in round 1, worth \(0.8(4)=3.2\) now. Because transfers are indivisible, the smallest acceptable current transfer is \(\lceil3.2\rceil=4\) vouchers. That leaves Ada six. Passing also gives Ada six in round 1, with no discount, so she is indifferent. Under the specified proposer tie rule she passes, and Ben's round-1 offer of \((6,4)\) is accepted. An accepted opening offer was possible; delay is selected by the tie rule, not forced by rejection.

With dollar-level rather than $10-voucher indivisibility, the round-2 split is $60/$40, and the round-1 split is again $60/$40. At round 0, Ben needs only \(0.8(\$40)=\$32\); Ada can keep $68, which strictly beats the $60 she gets from passing. She offers $68/$32 and Ben accepts. The coarse transfer unit removes Ada's strict gain from an immediate agreement. In general, for a continuation split of \(a+b=N\) indivisible units, the minimum acceptable current offer to a responder discounted by \(\delta_B\) is \(\lceil\delta_B b\rceil\); compare the proposer's \(N-\lceil\delta_B b\rceil\) with their own discounted continuation \(\delta_A a\). When \(\delta_A=1\) and \(\lceil\delta_B b\rceil=b\), those payoffs tie, permitting delay under the stated tie rule.

Assumptions

  • Exactly ten vouchers must be allocated on every accepted proposal.

  • Only Ben discounts: a voucher paid one round later is worth 0.8 voucher to him.

  • Fallback occurs in round 3 if no proposal is accepted; acceptance on equality and proposer passing on indifference are binding tie rules.

  • For the follow-up, fractional $10 vouchers are not permitted in the base game; whole-dollar splits are permitted instead.

Final Answer

With $10 vouchers, Ada's best acceptable round-0 split is 6 vouchers for Ada and 4 for Ben, but Ada is indifferent to passing and therefore passes. In round 1, Ben offers Ada 6 and Ben 4; Ada accepts. With $1 divisibility, Ada instead offers $68 to herself and $32 to Ben in round 0, and Ben accepts immediately.

Game theory and strategic decisions
↗

A festival kiosk has promised to deliver two portable radios tomorrow but owns only one today. It may make at most one additional one-radio trade before delivery: either buy a radio from a visitor at its bid price, sell its existing radio at its ask price, or make no trade. The money already collected for the two promises is the same in every case and can be ignored.

Any radio missing tomorrow must be replaced for $110. The first missing radio also incurs a $30 urgent-delivery charge; if both radios are missing, the second adds a further $70 urgent charge. A radio left over after fulfilling promises can instead be sold for $90. What are the highest bid and lowest ask that do not make the kiosk worse off than doing nothing, starting from its current inventory? For comparison, what would those thresholds be if it already owned both promised radios?

Hint 1

First compare tomorrow's shortage bill in the no-trade, one-buy and one-sell outcomes. Reservation prices are marginal changes in that bill.

With one radio held, shortage costs are $140 with no trade, $0 after buying one, and $320 after selling one. With two radios held, a bought surplus is worth $90; selling one creates a $140 shortage.

Let \(C(s)\) be the cash cost of covering \(s\) missing radios. By the rules, \(C(0)=0\), \(C(1)=110+30=140\), and \(C(2)=220+30+70=320\). With one owned radio, doing nothing incurs $140.

If the kiosk buys one at price \(b\), it has two radios and incurs no shortage bill. Relative to no trade, the improvement is \(140-b\). Buying is therefore non-worsening exactly for \(b\le140\).

If it sells its radio at price \(a\), it has none, receives \(a\), but now owes a $320 shortage bill. The relative improvement is \(a-(320-140)=a-180\). Selling is non-worsening exactly for \(a\ge180\). At equality the kiosk is indifferent; strict inequalities make the trade profitable.

If instead it begins fully stocked, no trade has zero shortage cost. Buying one extra radio creates a surplus whose terminal value is $90, so the maximum bid is $90. Selling one creates a $140 shortage, so the minimum ask is $140. Thus the marginal inventory value changes with holdings. In particular, the second missing radio is more costly than the first; using the $140 first-shortage charge for every marginal trade would misprice the sale.

Assumptions

  • Two pre-existing radio promises must be fulfilled and their revenue is fixed across actions.

  • Only one one-unit trade can occur; quoted prices are cash paid to buy or received on sale.

  • Tomorrow’s unit replacement, urgent fees and residual resale values are deterministic and as stated.

Final Answer

Starting one radio short: \(\mathrm{bid}\le\$140\); \(\mathrm{ask}\ge\$180\). Starting fully stocked: \(\mathrm{bid}\le\$90\); \(\mathrm{ask}\ge\$140\).

Market making and microstructure
↗

A traveling exhibition begins the month with £200 available to cover a potential theft loss. The loss is £0 with probability 0.5, £40 with probability 0.3, or £100 with probability 0.2. The owner must choose one of two policies, each charging a £20 premium upfront:

  • Deductible: the insurer reimburses any loss above £30; the owner pays at most the first £30.
  • Proportional: the insurer reimburses \(\frac{17}{32}\) of every loss.

The owner evaluates end-of-month wealth using \(u(w)=\sqrt w\) and prefers the policy with higher expected utility. The quoted loss distribution is the only uncertainty, and neither policy has exclusions or payout caps.

Both contracts have equal expected insurer payouts. Which should the owner buy? Calculate expected utility under each and explain why equal average compensation need not imply equal desirability.

Hint 1

Make a three-row table of final wealth under each policy; premiums are paid even if nothing is stolen.

Compare the £40 and £100 loss states. With the deductible, wealth is the same in both. Under proportional insurance, check that their probability-weighted mean remains £150 and apply concavity.

Expected loss before insurance is \(0.3\times40+0.2\times100\) = £32. The deductible pays £0, £10, £70 in the three states, so its expected reimbursement is \(0.3\times10+0.2\times70\) = £17. The proportional policy pays \(\frac{17}{32}L\); its expected reimbursement is \(\frac{17}{32}\times32\) = £17. Equal payouts and equal £20 premiums imply the same expected final wealth, but not the same distribution.

After the premium, wealth before theft is £180. With the deductible the owner bears \(\min(L,30)\), giving final wealth \((180,150,150)\) at losses \((0,40,100)\). Under proportional coverage the owner bears \(\frac{15}{32}L\), giving \((180,161.25,133.125)\). Both expected wealth values are £165: for the deductible, \(0.5\times180+0.5\times150=165\); for proportional, \(0.5\times180+0.3\times161.25+0.2\times133.125=165\).

Expected square-root utilities are therefore

\[\begin{aligned}U_d&=0.5\sqrt{180}+0.3\sqrt{150}+0.2\sqrt{150}\approx12.8319283,\\U_p&=0.5\sqrt{180}+0.3\sqrt{161.25}+0.2\sqrt{133.125}\approx12.8253276\end{aligned}\].

The deductible is preferred by approximately 0.0066007 utility units. There is also a structural proof. Conditional on a positive loss (probability 0.5), deductible wealth is £150 for certain. Proportional wealth is £161.25 with conditional probability \(\frac{0.3}{0.5}=0.6\) and £133.125 with probability 0.4, with the same conditional mean £150. Strict concavity of \(\sqrt{w}\) makes the certain £150 strictly preferable to that spread. The deductible allocates more protection to the severe, low-wealth state. Equal insurer payouts alone miss this risk-distribution effect.

Assumptions

  • Loss outcomes are mutually exclusive and exhaust all possibilities.

  • Final wealth is initial wealth minus premium minus uncovered theft loss; sqrt utility is defined at every listed wealth level.

Final Answer

Choose the £30-deductible policy: \(\mathbb{E}[u(W_d)]\approx12.83193\) versus \(\mathbb{E}[u(W_p)]\approx12.82533\), a utility advantage of about 0.00660.

Risk, covariance and diversification
8

Two audio recorders were set to show exactly the same time at the start of a rehearsal. Neither display was necessarily correct. Recorder A…

Unlock the rest

Keep practising with 93 more questions, available hints and full worked solutions.

Explore Premium

Join our Newsletter and Receive the Latest Updates!

Main Links

Trade Courses Assessments Interview Prep Contact Us

Social Media

Facebook Instagram YouTube

Legal

Terms and Conditions Privacy Policy Privacy settings

Talent Acquisition

Looking to hire exceptional quant talent?
See how we can help.

© 2026 EverythingQuant. All Rights Reserved.