CODING CHALLENGES

代码题库

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

继续刷题

题目列表

显示 8 / 646 道可提交题。 当前筛选：标签：Greedy，难度：简单，语言：Rust

难度
全部简单中等困难
权限
全部免费订阅
语言
全部PythonC++Rust
常用标签
全部Numerical Methods326Quant Developer298Array226Statistics205Risk173Risk Quant152Microstructure129Time series113Pricing99Sorting96Sell Side Quant89Buy Side Quant Researcher77Backtesting73Execution70Factor69Dynamic Programming67
提交状态：未尝试未正确已正确
未尝试
coding-greedy-coin-change-canonical-set可练习
规范币集上的贪心找零

Greedy Coin Change on a Canonical Denomination Set

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-greedy-min-platforms-railway可练习
铁路时刻表所需的最少站台数

Minimum Platforms for a Railway Schedule

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-jump-game-can-reach可练习
跳跃游戏 — 能否到达终点

Jump Game — Can You Reach the Last Index

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-max-non-overlap-trade-windows可练习
最多不重叠交易时间窗

Max Non-Overlapping Trade Windows

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-min-rooms-for-streaming-jobs可练习
并发流式执行机的最小数量

Minimum Concurrent Streaming Jobs for Execution Windows

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-non-overlap-rebalance-windows可练习
最少需移除的再平衡时间窗

Min Rebalance Windows To Remove

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-non-overlapping-intervals-greedy可练习
使区间互不相交的最少移除数

Min Intervals To Remove For Non-Overlap

GreedySortingExecutionQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-target-vol-scale订阅锁定
目标波动率杠杆缩放

Target-Volatility Scaling with Leverage Cap

GreedyNumerical MethodsOptimizationPortfolioBuy Side Quant Researcher
简单面试准备Python / C++ / Rust
难度分布：简单 8中等 0困难 0清除全部筛选