CODING CHALLENGES

代码题库

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

继续刷题

题目列表

显示 14 / 646 道可提交题。 当前筛选：标签：Graph，难度：简单

难度
全部简单中等困难
权限
全部免费订阅
语言
全部PythonC++Rust
常用标签
全部Numerical Methods326Quant Developer298Array226Statistics205Risk173Risk Quant152Microstructure129Time series113Pricing99Sorting96Sell Side Quant89Buy Side Quant Researcher77Backtesting73Execution70Factor69Dynamic Programming67
提交状态：未尝试未正确已正确
未尝试
coding-binary-tree-backward-induction可练习
通用二叉树上的逆向归纳

Backward Induction on a Generic Binary Tree

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

Invert Binary Tree (Mirror)

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

Maximum Depth of a Binary Tree (Recursive)

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

Symmetric Binary Tree Check

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

Recursive Binary Decision-Tree Evaluator

GraphTreePricingStatisticsQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-expected-value-scenario-tree订阅锁定
情景树根节点期望值

Expected Value at Root of Scenario Tree

GraphTreePricingStatisticsSell Side Quant
简单面试准备Python / C++ / Rust
未尝试
coding-graph-count-connected-components-bfs可练习
Count Connected Components in an Undirected Graph

Count Connected Components in an Undirected Graph

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

Detect a Cycle in an Undirected Graph

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

Aggregate P&L Up a Portfolio Hierarchy Tree

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

Recursive Walk Down a Hierarchical Rebate-Tier Tree

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

Rotting Oranges — Multi-Source BFS

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

Shortest Hop Path on a Routing Graph

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

Search a Binary Search Tree for a Target

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

Validate Binary Search Tree (Recursive Bounds)

GraphTreePricingStatisticsQuant Developer
简单免费版Python / C++ / Rust
难度分布：简单 14中等 0困难 0清除全部筛选