leetcode.com 2026-06-02
🟢3633.earliest-finish-time-for-land-and-water-rides-i
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
🟢3633.earliest-finish-time-for-land-and-water-rides-i
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
Telegraph
earliest-finish-time-for-land-and-water-rides-i
You are given two categories of theme park attractions: land rides and water rides.
leetcode.cn 2026-06-03
🟡3635.earliest-finish-time-for-land-and-water-rides-ii
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
🟡3635.earliest-finish-time-for-land-and-water-rides-ii
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
Telegraph
earliest-finish-time-for-land-and-water-rides-ii
给你两种类别的游乐园项目:陆地游乐设施 和 水上游乐设施。
leetcode.com 2026-06-03
🟡3635.earliest-finish-time-for-land-and-water-rides-ii
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
🟡3635.earliest-finish-time-for-land-and-water-rides-ii
🏷️ Tags
#greedy #array #two_pointers #binary_search #sorting
Telegraph
earliest-finish-time-for-land-and-water-rides-ii
You are given two categories of theme park attractions: land rides and water rides.
leetcode.cn 2026-06-04
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
Telegraph
total-waviness-of-numbers-in-range-i
给你两个整数 num1 和 num2,表示一个 闭 区间 [num1, num2]。
leetcode.com 2026-06-04
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
🟡3751.total-waviness-of-numbers-in-range-i
🏷️ Tags
#math #dynamic_programming #enumeration
Telegraph
total-waviness-of-numbers-in-range-i
You are given two integers num1 and num2 representing an inclusive range [num1, num2]. The waviness of a number is defined as the total count of its peaks and valleys:
leetcode.cn 2026-06-07
🟡2196.create-binary-tree-from-descriptions
🏷️ Tags
#tree #array #hash_table #binary_tree
🟡2196.create-binary-tree-from-descriptions
🏷️ Tags
#tree #array #hash_table #binary_tree
Telegraph
create-binary-tree-from-descriptions
给你一个二维整数数组 descriptions ,其中 descriptions[i] = [parenti, childi, isLefti] 表示 parenti 是 childi 在 二叉树 中的 父节点,二叉树中各节点的值 互不相同 。此外: