3112. 访问消失节点的最短时间
Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Path
Posts
3113. 找到边界元素是最大值的子数组数量
Hard | Array, Binary Search, Stack, Monotonic Stack
3114. 替换字符得到的最晚时间
Easy | String, Enumeration
3115. 最大质数差
Medium | Array, Math, Number Theory
3116. 单一面额组合的第K小金额
Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory
3117. 通过划分数组的最小值和
Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue
3120. 统计特殊字符的数量 I
Easy | Hash Table, String
3121. 特殊字符计数 II
Medium | Hash Table, String
3122. 满足条件的最小操作数
Medium | Array, Dynamic Programming, Matrix
3123. 在最短路径中找边
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path