CODING CHALLENGES

代码题库

用接近 LeetCode 的题表进入训练:先筛选题目,再进入双栏题面和编辑器。每道题只展示它实际声明支持的语言。

继续刷题

题目列表

显示 33 / 646 道可提交题。 当前筛选:标签:Graph,权限:免费

提交状态:未尝试未正确已正确
未尝试
coding-binary-tree-backward-induction可练习
通用二叉树上的逆向归纳

Backward Induction on a Generic Binary Tree

简单免费版Python / C++ / Rust
未尝试
coding-binary-tree-invert-mirror可练习
翻转二叉树(镜像)

Invert Binary Tree (Mirror)

简单免费版Python / C++ / Rust
未尝试
coding-binary-tree-max-depth-recursive可练习
二叉树的最大深度(递归)

Maximum Depth of a Binary Tree (Recursive)

简单免费版Python / C++ / Rust
未尝试
coding-binary-tree-symmetric-check可练习
对称二叉树判定

Symmetric Binary Tree Check

简单免费版Python / C++ / Rust
未尝试
coding-binomial-tree-american-put可练习
CRR 二叉树美式看跌期权定价

American Put Pricing on a CRR Binomial Tree

中等免费版Python / C++ / Rust
未尝试
coding-cluster-correlated-tickers可练习
强相关标的聚类

Cluster Correlated Tickers

中等免费版Python / C++ / Rust
未尝试
coding-correlation-cluster-count可练习
因子聚簇计数:阈值化相关性图的连通分量数

Factor Cluster Count: Connected Components on a Thresholded Correlation Graph

中等免费版Python / C++ / Rust
未尝试
coding-count-leaves-cumret-above-threshold可练习
远期情景树上累计 PnL 越过门槛的叶节点计数

Win-Count Leaves on a Forward Scenario Tree

中等免费版Python / C++ / Rust
未尝试
coding-count-regime-paths-panic-calm可练习
市场状态路径计数:恐慌须由平静隔开

Count Regime Paths Satisfying Constraint

困难免费版Python / C++ / Rust
未尝试
coding-currency-arbitrage-cycle-detection可练习
货币套利环检测(对数汇率上的 Bellman-Ford)

Currency Arbitrage Cycle Detection (Bellman-Ford on Log Rates)

中等免费版Python / C++ / Rust
未尝试
coding-decision-tree-evaluator可练习
Recursive Binary Decision-Tree Evaluator

Recursive 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
未尝试
coding-enumerate-hedge-decompositions可练习
对冲分解组合枚举

Enumerate Hedge Decompositions

中等免费版Python / C++ / Rust
未尝试
coding-factor-dependency-topo-order可练习
因子依赖拓扑序:夜间重建的确定性 min-heap Kahn 调度

Factor Dependency Topo Order: Deterministic Min-Heap Kahn for Nightly Rebuild

中等免费版Python / C++ / Rust
未尝试
coding-graph-count-connected-components-bfs可练习
Count Connected Components in an Undirected Graph

Count Connected Components in an Undirected Graph

简单免费版Python / C++ / Rust
未尝试
coding-graph-cycle-detect-undirected可练习
判断无向图是否存在环

Detect a Cycle in an Undirected Graph

简单免费版Python / C++ / Rust
未尝试
coding-incremental-largest-component-size可练习
增量最大聚簇规模:因子对边事件流上的流式并查集

Incremental Largest Cluster Size: Streaming Union-Find on a Factor-Pair Edge Tape

中等免费版Python / C++ / Rust
未尝试
coding-largest-correlation-cluster-size可练习
最大因子聚簇规模:阈值化相关性图的最大连通分量大小

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

中等免费版Python / C++ / Rust
未尝试
coding-min-hops-to-core-factor-set可练习
到核心因子集合的最少跳数:因子相似图上的多源 BFS

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

中等免费版Python / C++ / Rust
未尝试
coding-min-knight-moves-bfs-grid可练习
马的最少步数 — 无限棋盘上的 BFS

Minimum Knight Moves — BFS on an Infinite Board

困难免费版Python / C++ / Rust
未尝试
coding-min-max-drawdown-root-to-leaf-path可练习
情景树上根到叶路径中最小的最大回撤

Minimum Max-Drawdown Across Root-to-Leaf Paths

中等免费版Python / C++ / Rust
未尝试
coding-portfolio-tree-aggregate-pnl可练习
沿组合层级树向上聚合 P&L

Aggregate P&L Up a Portfolio Hierarchy Tree

简单免费版Python / C++ / Rust
未尝试
coding-prob-of-reaching-target-leaves可练习
二叉情景树上击中目标叶集合的概率

Probability of Reaching a Target Leaf Set on a Binary Scenario Tree

中等免费版Python / C++ / Rust
未尝试
coding-recursive-rebate-tier-walk可练习
Recursive Walk Down a Hierarchical Rebate-Tier Tree

Recursive 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
未尝试
coding-regime-transition-path-count可练习
状态机转移路径计数:可分辨催化剂下的 DAG 取模游走枚举

Regime Transition Path Count: Modular DAG Walk Enumeration with Distinguishable Catalysts

中等免费版Python / C++ / Rust
未尝试
coding-rotting-oranges-bfs可练习
烂橘子蔓延 — 多源 BFS

Rotting Oranges — Multi-Source BFS

简单免费版Python / C++ / Rust
未尝试
coding-scenario-tree-expected-pnl可练习
风险情景树的期望 PnL

Expected PnL on a Risk-Officer Scenario Tree

中等免费版Python / C++ / Rust
未尝试
coding-scenario-tree-worst-leaf-pnl可练习
风险情景树的最差叶 PnL

Worst-Case Leaf PnL on a Risk-Officer Scenario Tree

中等免费版Python / C++ / Rust
未尝试
coding-shortest-fee-path-routing-graph可练习
路由图上的最短跳数路径

Shortest Hop Path on a Routing Graph

简单免费版Python / C++ / Rust
未尝试
coding-trade-graph-connected-components可练习
共同成交图:基于成交对的连通分量

Co-Trading Graph — Connected Components of Session Trade Pairs

中等免费版Python / C++ / Rust
未尝试
coding-tree-search-bst-target可练习
在二叉搜索树中查找目标值

Search a Binary Search Tree for a Target

简单免费版Python / C++ / Rust
未尝试
coding-validate-bst-recursive可练习
校验二叉搜索树(递归区间)

Validate Binary Search Tree (Recursive Bounds)

简单免费版Python / C++ / Rust