代码题库

Bounded K Transactions: 2D DP for Maximum Profit

Multi-Strike Portfolio with Per-Strike Share Cap (Bounded Knapsack)

Factor Cluster Count: Connected Components on a Thresholded Correlation Graph

Edit Distance for Ticker-Symbol Mapping

Minimum Cost Path Through a Grid

Maximum P&L Path Through a Grid

Budget-Constrained Ticker Selection (0/1 Knapsack)

Largest Factor Cluster Size: Maximum Connected Component on a Thresholded Correlation Graph

Maximum Grid PnL Path With At-Most-K Cell Skips (Right/Down)

Disjoint Risk-Bucket Hedge Selection under a Bucket-Budget Bitmask

Max-Reward Sequence Alignment Across Trade-Action Streams

Min Hops to Core Factor Set: Multi-Source BFS on a Factor-Similarity Graph

Hedge-Inventory Replenishment: Minimum Top-Ups to Stay Non-Negative

Portfolio Expected Loss by Bucket: PD x LGD x EAD Waterfall

Whole-Share Portfolio Allocator under a Single-Name Cap

Two-Budget Strike-Premium Knapsack (Delta and Vega Caps)

Unique Paths with Obstacles

Weighted-Cost Edit Distance Between Trade-Action Paths