题目列表
显示 25 / 646 道可提交题。 当前筛选:标签:Tree,语言:Python
提交状态:未尝试未正确已正确
状态题目难度权限语言
未尝试困难面试准备Python / C++ / Rust
coding-bermudan-option-binomial-recursive订阅锁定
百慕大看跌期权的 CRR 二叉树定价(按行权日选择性早期行权)Bermudan Put on a CRR Tree with Selective Early-Exercise
未尝试简单免费版Python / C++ / Rust
未尝试简单免费版Python / C++ / Rust
未尝试中等免费版Python / C++ / Rust
未尝试中等免费版Python / C++ / Rust
coding-count-leaves-cumret-above-threshold可练习
远期情景树上累计 PnL 越过门槛的叶节点计数Win-Count Leaves on a Forward Scenario Tree
未尝试困难免费版Python / C++ / Rust
未尝试简单免费版Python / C++ / Rust
coding-decision-tree-evaluator可练习
Recursive Binary Decision-Tree EvaluatorRecursive Binary Decision-Tree Evaluator
未尝试中等免费版Python / C++ / Rust
coding-deepest-no-drawdown-leaf-depth可练习
远期情景树上无中间回撤的最深叶深度Deepest No-Drawdown Leaf on a Forward Scenario Tree
未尝试中等免费版Python / C++ / Rust
未尝试简单面试准备Python / C++ / Rust
未尝试中等面试准备Python / C++ / Rust
未尝试中等面试准备Python / C++ / Rust
coding-leisen-reimer-tree订阅锁定
欧式期权的 Leisen-Reimer 二叉树定价Leisen-Reimer Binomial Tree for European Options
未尝试中等免费版Python / C++ / Rust
coding-min-max-drawdown-root-to-leaf-path可练习
情景树上根到叶路径中最小的最大回撤Minimum Max-Drawdown Across Root-to-Leaf Paths
未尝试简单免费版Python / C++ / Rust
未尝试中等免费版Python / C++ / Rust
coding-prob-of-reaching-target-leaves可练习
二叉情景树上击中目标叶集合的概率Probability of Reaching a Target Leaf Set on a Binary Scenario Tree
未尝试中等面试准备Python / C++ / Rust
未尝试简单免费版Python / C++ / Rust
coding-recursive-rebate-tier-walk可练习
Recursive Walk Down a Hierarchical Rebate-Tier TreeRecursive Walk Down a Hierarchical Rebate-Tier Tree
未尝试中等免费版Python / C++ / Rust
coding-recursive-subtree-leaf-payoff-sum可练习
情景树上每节点的条件期望叶节点收益Per-Node Conditional Expected Leaf Payoff on a Scenario Tree
未尝试中等免费版Python / C++ / Rust
未尝试中等免费版Python / C++ / Rust
coding-scenario-tree-worst-leaf-pnl可练习
风险情景树的最差叶 PnLWorst-Case Leaf PnL on a Risk-Officer Scenario Tree
未尝试简单免费版Python / C++ / Rust
未尝试中等面试准备Python / C++ / Rust
未尝试简单免费版Python / C++ / Rust