CODING CHALLENGES

代码题库

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

继续刷题

题目列表

显示 11 / 646 道可提交题。 当前筛选：标签：Optimization，难度：简单，语言：C++

难度
全部简单中等困难
权限
全部免费订阅
语言
全部PythonC++Rust
常用标签
全部Numerical Methods326Quant Developer298Array226Statistics205Risk173Risk Quant152Microstructure129Time series113Pricing99Sorting96Sell Side Quant89Buy Side Quant Researcher77Backtesting73Execution70Factor69Dynamic Programming67
提交状态：未尝试未正确已正确
未尝试
coding-binary-search-target-leftmost-bisect可练习
二分查找：目标值的最左下标 (bisect_left)

Leftmost Index via Binary Search (bisect_left)

Binary searchOptimizationPricingQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-grid-min-path-sum可练习
网格最小代价路径

Minimum Cost Path Through a Grid

Dynamic ProgrammingOptimizationPortfolioQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-grid-pnl-path-max可练习
网格盈亏的最大累积路径

Maximum P&L Path Through a Grid

Dynamic ProgrammingOptimizationPortfolioQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-koko-eating-bananas可练习
最小吃香蕉速度（在答案上二分）

Minimum Eating Speed (Binary Search on the Answer)

Binary searchOptimizationPricingQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-min-cash-buffer-to-survive可练习
最小生存现金缓冲

Min Cash Buffer to Survive

Binary searchOptimizationPricingQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-min-flips-monotone-pnl可练习
最少翻转使涨跌序列单调

Minimum Flips for Monotone Up-Day Pattern

ArrayDynamic ProgrammingOptimizationQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-min-tickers-for-coverage可练习
Minimum Tickers for Liquidity Coverage

Minimum Tickers for Liquidity Coverage

Binary searchOptimizationPricingQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-pascals-triangle-row可练习
杨辉三角第 k 行的 O(k) 空间解

Pascal's Triangle Row in O(k) Space

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

Target-Volatility Scaling with Leverage Cap

GreedyNumerical MethodsOptimizationPortfolioBuy Side Quant Researcher
简单面试准备Python / C++ / Rust
未尝试
coding-tribonacci-iterative可练习
迭代法求 Tribonacci 数

Iterative Tribonacci Number

ArrayDynamic ProgrammingOptimizationQuant Developer
简单免费版Python / C++ / Rust
未尝试
coding-unique-paths-with-obstacles可练习
带障碍的不同路径数

Unique Paths with Obstacles

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