Leetcode Daily Question
@leetcodeDailyQuestionChannel
2.37K
subscribers
517
files
2.74K
links
Why are you asking me to do Leetcode for this CSS job?
Download Telegram
Join
Leetcode Daily Question
2.37K subscribers
Leetcode Daily Question
leetcode.cn
2026-09-05
🟡
3904.smallest-stable-index-ii
🏷️
Tags
#array
#prefix_sum
Telegraph
smallest-stable-index-ii
给你一个长度为 n 的整数数组 nums 和一个整数 k。
来源
答案
Leetcode Daily Question
leetcode.com
2026-09-05
🟡
3904.smallest-stable-index-ii
🏷️
Tags
#array
#prefix_sum
Telegraph
smallest-stable-index-ii
You are given an integer
array
nums of length n and an integer k. For each index i, define its instability score as max(nums[0..i]) - min(nums[i..n - 1]). In other words:
Source
Solution
