Leetcode Daily Question
@leetcodeDailyQuestionChannel
2.41K
subscribers
517
files
2.48K
links
Why are you asking me to do Leetcode for this CSS job?
Download Telegram
Join
Leetcode Daily Question
2.41K subscribers
Leetcode Daily Question
leetcode.cn
2026-05-14
🟢
2784.check-if-
array
-is-good
🏷️
Tags
#array
#hash_table
#sorting
Telegraph
check-if-
array
-is-good
给你一个整数数组 nums ,如果它是数组 base[n] 的一个排列,我们称它是个 好 数组。 base[n] = [1, 2, ..., n - 1, n, n] (换句话说,它是一个长度为 n + 1 且包含 1 到 n - 1 恰好各一次,包含 n 两次的一个数组)。比方说,base[1] = [1, 1] ,base[3] = [1, 2, 3, 3] 。 如果数组是一个好数组,请你返回 true ,否则返回 false 。 注意:数组的排列是这些数字按任意顺序排布后重新得到的数组。 示例…
来源
答案
Leetcode Daily Question
leetcode.com
2026-05-14
🟢
2784.check-if-
array
-is-good
🏷️
Tags
#array
#hash_table
#sorting
Telegraph
check-if-
array
-is-good
You are given an integer
array
nums. We consider an
array
good if it is a permutation of an
array
base[n]. base[n] = [1, 2, ..., n - 1, n, n] (in other words, it is an
array
of length n + 1 which contains 1 to n - 1 exactly once, plus two occurrences of n).…
Source
Solution
Leetcode Daily Question
leetcode.cn
2026-05-15
🟡
153.find-minimum-in-rotated-sorted-
array
🏷️
Tags
#array
#binary_search
Telegraph
find-minimum-in-rotated-sorted-
array
若旋转 4 次,则可以得到 [4,5,6,7,0,1,2]
来源
答案
Leetcode Daily Question
leetcode.com
2026-05-15
🟡
153.find-minimum-in-rotated-sorted-
array
🏷️
Tags
#array
#binary_search
Telegraph
find-minimum-in-rotated-sorted-
array
Suppose an
array
of length n sorted in ascending order is rotated between 1 and n times. For example, the
array
nums = [0,1,2,4,5,6,7] might become:
Source
Solution
Leetcode Daily Question
leetcode.cn
2026-05-16
🔴
154.find-minimum-in-rotated-sorted-
array
-ii
🏷️
Tags
#array
#binary_search
Telegraph
find-minimum-in-rotated-sorted-
array
-ii
若旋转 4 次,则可以得到 [4,5,6,7,0,1,4]
来源
答案
Leetcode Daily Question
leetcode.com
2026-05-16
🔴
154.find-minimum-in-rotated-sorted-
array
-ii
🏷️
Tags
#array
#binary_search
Telegraph
find-minimum-in-rotated-sorted-
array
-ii
Suppose an
array
of length n sorted in ascending order is rotated between 1 and n times. For example, the
array
nums = [0,1,4,4,5,6,7] might become:
Source
Solution
Leetcode Daily Question
leetcode.cn
2026-05-17
🟡
1306.jump-game-iii
🏷️
Tags
#depth_first_search
#breadth_first_search
#array
Telegraph
jump-game-iii
这里有一个非负整数数组 arr,你最开始位于该数组的起始下标 start 处。当你位于下标 i 处时,你可以跳到 i + arr[i] 或者 i - arr[i]。 请你判断自己是否能够跳到对应元素值为 0 的 任一 下标处。 注意,不管是什么情况下,你都无法跳到数组之外。 示例 1: 输入:arr = [4,2,3,0,3,1,2], start = 5 输出:true 解释: 到达值为 0 的下标 3 有以下可能方案: 下标 5 -> 下标 4 -> 下标 1 -> 下标 3 下标 5 -> 下标…
来源
答案
Leetcode Daily Question
leetcode.com
2026-05-17
🟡
1306.jump-game-iii
🏷️
Tags
#depth_first_search
#breadth_first_search
#array
Telegraph
jump-game-iii
Given an
array
of non-negative integers arr, you are initially positioned at start index of the
array
. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach any index with value 0. Notice that you can not jump outside of…
Source
Solution
Leetcode Daily Question
leetcode.cn
2026-05-18
🔴
1345.jump-game-iv
🏷️
Tags
#breadth_first_search
#array
#hash_table
Telegraph
jump-game-iv
给你一个整数数组 arr ,你一开始在数组的第一个元素处(下标为 0)。 每一步,你可以从下标 i 跳到下标 i + 1 、i - 1 或者 j :
来源
答案
Leetcode Daily Question
leetcode.com
2026-05-18
🔴
1345.jump-game-iv
🏷️
Tags
#breadth_first_search
#array
#hash_table
Telegraph
jump-game-iv
Given an
array
of integers arr, you are initially positioned at the first index of the
array
. In one step you can jump from index i to index:
Source
Solution