CODING CHALLENGES

代码题库

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

继续刷题

题目列表

显示 6 / 646 道可提交题。 当前筛选：标签：Greedy，难度：困难

难度
全部简单中等困难
权限
全部免费订阅
语言
全部PythonC++Rust
常用标签
全部Numerical Methods326Quant Developer298Array226Statistics205Risk173Risk Quant152Microstructure129Time series113Pricing99Sorting96Sell Side Quant89Buy Side Quant Researcher77Backtesting73Execution70Factor69Dynamic Programming67
提交状态：未尝试未正确已正确
未尝试
coding-dag-schedule-with-machine-cap订阅锁定
DAG Schedule on K Machines with Critical-Path Priority

DAG Schedule on K Machines with Critical-Path Priority

ConcurrencyGraphGreedyGeneral CodingQuant Developer
困难面试准备Python / C++ / Rust
未尝试
coding-max-diversification-portfolio订阅锁定
最大分散化组合 (Choueifaty-Coignard)

Maximum-Diversification Portfolio (Choueifaty-Coignard)

GreedyNumerical MethodsOptimizationPortfolioBuy Side Quant Researcher
困难面试准备Python / C++ / Rust
未尝试
coding-mean-variance-frontier-long-only订阅锁定
Long-Only Mean-Variance Efficient Frontier

Long-Only Mean-Variance Efficient Frontier

GreedyNumerical MethodsOptimizationPortfolioBuy Side Quant Researcher
困难面试准备Python / C++ / Rust
未尝试
coding-min-replenishments-to-avoid-stockout可练习
最少补货次数避免缺货

Min Replenishments to Avoid Stockout

ArrayGreedyHeapRiskTime series
困难免费版Python / C++ / Rust
未尝试
coding-sor-with-fillrate-priors订阅锁定
Smart-Order Routing With Bayesian Fill-Rate Priors and UCB Exploration

Smart-Order Routing With Bayesian Fill-Rate Priors and UCB Exploration

GreedyHeapSortingExecutionMicrostructure
困难面试准备Python / C++ / Rust
未尝试
coding-twap-with-no-go-windows订阅锁定
带禁止窗口的 TWAP 调度

TWAP Scheduling Through Forbidden No-Go Windows

ArrayGreedyExecutionMicrostructureTrader Market Maker
困难面试准备Python / C++ / Rust
难度分布：简单 0中等 0困难 6清除全部筛选