leetcode.com 2026-09-26
🟡1807.evaluate-the-bracket-pairs-of-a-string
🏷️ Tags
#array #hash_table #string
🟡1807.evaluate-the-bracket-pairs-of-a-string
🏷️ Tags
#array #hash_table #string
Telegraph
evaluate-the-bracket-pairs-of-a-string
You are given a string s that contains some bracket pairs, with each pair containing a non-empty key.
leetcode.cn 2026-09-29
🔴2267.check-if-there-is-a-valid-parentheses-string-path
🏷️ Tags
#array #dynamic_programming #matrix #bracket_sequences
🔴2267.check-if-there-is-a-valid-parentheses-string-path
🏷️ Tags
#array #dynamic_programming #matrix #bracket_sequences
Telegraph
check-if-there-is-a-valid-parentheses-string-path
一个括号字符串是一个 非空 且只包含 '(' 和 ')' 的字符串。如果下面 任意 条件为 真 ,那么这个括号字符串就是 合法的 。
leetcode.com 2026-09-29
🔴2267.check-if-there-is-a-valid-parentheses-string-path
🏷️ Tags
#array #dynamic_programming #matrix #bracket_sequences
🔴2267.check-if-there-is-a-valid-parentheses-string-path
🏷️ Tags
#array #dynamic_programming #matrix #bracket_sequences
Telegraph
check-if-there-is-a-valid-parentheses-string-path
A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true:
leetcode.cn 2026-10-10
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
Telegraph
minimum-sum-of-squared-difference
给你两个下标从 0 开始的整数数组 nums1 和 nums2 ,长度为 n 。 数组 nums1 和 nums2 的 差值平方和 定义为所有满足 0 <= i < n 的 (nums1[i] - nums2[i])2 之和。 同时给你两个正整数 k1 和 k2 。你可以将 nums1 中的任意元素 +1 或者 -1 至多 k1 次。类似的,你可以将 nums2 中的任意元素 +1 或者 -1 至多 k2 次。 请你返回修改数组 nums1 至多 k1 次且修改数组 nums2 至多 k2 次后的最小 差值平方和 。…
leetcode.com 2026-10-10
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
🟡2333.minimum-sum-of-squared-difference
🏷️ Tags
#greedy #array #binary_search #sorting #heap_priority_queue
Telegraph
minimum-sum-of-squared-difference
You are given two positive 0-indexed integer arrays nums1 and nums2, both of length n. The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] - nums2[i])2 for each 0 <= i < n. You are also given two positive integers k1…