题目列表
显示 10 / 646 道可提交题。 当前筛选：标签：Portfolio，难度：中等，权限：免费
提交状态：未尝试未正确已正确
状态题目难度权限语言
未尝试中等免费版Python / C++ / Rust
coding-bounded-knapsack-multi-share可练习
单笔上限下的多档行权配置（有界背包）Multi-Strike Portfolio with Per-Strike Share Cap (Bounded Knapsack)
未尝试中等免费版Python / C++ / Rust
coding-correlation-cluster-count可练习
因子聚簇计数：阈值化相关性图的连通分量数Factor Cluster Count: Connected Components on a Thresholded Correlation Graph
未尝试中等免费版Python / C++ / Rust
未尝试中等免费版Python / C++ / Rust
coding-knapsack-symbol-selection-budget可练习
预算约束下的标的选择（0/1 背包）Budget-Constrained Ticker Selection (0/1 Knapsack)
未尝试中等免费版Python / C++ / Rust
coding-largest-correlation-cluster-size可练习
最大因子聚簇规模：阈值化相关性图的最大连通分量大小Largest Factor Cluster Size: Maximum Connected Component on a Thresholded Correlation Graph
未尝试中等免费版Python / C++ / Rust
coding-max-reward-disjoint-resource-bitmask-subset可练习
在风险桶预算位掩码下的非交叠对冲合约最大收益选择Disjoint Risk-Bucket Hedge Selection under a Bucket-Budget Bitmask
未尝试中等免费版Python / C++ / Rust
coding-min-hops-to-core-factor-set可练习
到核心因子集合的最少跳数：因子相似图上的多源 BFSMin Hops to Core Factor Set: Multi-Source BFS on a Factor-Similarity Graph
未尝试中等免费版Python / C++ / Rust
coding-min-replenish-keep-inventory-positive可练习
对冲存量补货：保持非负所需的最少补货次数Hedge-Inventory Replenishment: Minimum Top-Ups to Stay Non-Negative
未尝试中等免费版Python / C++ / Rust
coding-portfolio-expected-loss-by-bucket可练习
组合预期损失分桶聚合：PD x LGD x EAD 瀑布Portfolio Expected Loss by Bucket: PD x LGD x EAD Waterfall
未尝试中等免费版Python / C++ / Rust
coding-portfolio-whole-share-knapsack可练习
单名集中度限制下的整股组合分配Whole-Share Portfolio Allocator under a Single-Name Cap