题目列表
显示 29 / 646 道可提交题。 当前筛选:标签:Quant Developer,难度:困难
Credit-Based Backpressure — Replay Producer/Consumer Events into a State Trace
Bounded K Transactions: 2D DP for Maximum Profit
DAG Schedule on K Machines with Critical-Path Priority
Weighted Edit Distance with Per-Character Cost Matrices
Fork-Join Segment Stats (Welford Pairwise Merge)
HDR Histogram Recorded-Value Bucket Index and Quantile Estimate
Black-Scholes Implied Volatility on a Strictly Increasing Price Curve via Bisection
Maximum Cumulative Carry Under a Bounded Sign-Flip Budget
Maximum Grid PnL Path With At-Most-K Cell Skips (Right/Down)
Max-Reward Sequence Alignment Across Trade-Action Streams
Minimum Knight Moves — BFS on an Infinite Board
Smallest Router Count under a BFD Load-Cap Assigner via Bisection
Smallest Stress Severity Factor Where a Counterparty First Breaches Its Cap
Next Depth-Jump within a Forward Window: Bounded-Distance Ratio-Threshold Scan over a Best-Bid-Depth Tape
Parallel Pairwise Mean Merge with Kahan Compensation
Cache-Aware Pipeline Replay — Minimum Re-run Set with Input-Hash Chaining
Aggregate Bottleneck Bid-Depth across All Contiguous Price-Band Sweeps (Depth-Uniformity Score)
T-Digest Streaming Percentile Estimator (k_1 Scale Function)
Two-Budget Strike-Premium Knapsack (Delta and Vega Caps)
Watermark-Driven Tumbling Windows with Late-Event Handling
Weighted-Cost Edit Distance Between Trade-Action Paths