leetcode.cn 2026-07-10
🔴3534.path-existence-queries-in-a-graph-ii
🏷️ Tags
#greedy #bit_manipulation #graph #array #two_pointers #binary_search #dynamic_programming #sorting
🔴3534.path-existence-queries-in-a-graph-ii
🏷️ Tags
#greedy #bit_manipulation #graph #array #two_pointers #binary_search #dynamic_programming #sorting
Telegraph
path-existence-queries-in-a-graph-ii
给你一个整数 n,表示图中的节点数量,这些节点按从 0 到 n - 1 编号。 同时给你一个长度为 n 的整数数组 nums,以及一个整数 maxDiff。 如果满足 |nums[i] - nums[j]| <= maxDiff(即 nums[i] 和 nums[j] 的 绝对差 至多为 maxDiff),则节点 i 和节点 j 之间存在一条 无向边 。 此外,给你一个二维整数数组 queries。对于每个 queries[i] = [ui, vi],找到节点 ui 和节点 vi 之间的 最短距离 。如果两节点之间不存在路径,则返回…
leetcode.com 2026-07-10
🔴3534.path-existence-queries-in-a-graph-ii
🏷️ Tags
#greedy #bit_manipulation #graph #array #two_pointers #binary_search #dynamic_programming #sorting
🔴3534.path-existence-queries-in-a-graph-ii
🏷️ Tags
#greedy #bit_manipulation #graph #array #two_pointers #binary_search #dynamic_programming #sorting
Telegraph
path-existence-queries-in-a-graph-ii
You are given an integer n representing the number of nodes in a graph, labeled from 0 to n - 1. You are also given an integer array nums of length n and an integer maxDiff. An undirected edge exists between nodes i and j if the absolute difference between…
leetcode.cn 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
给你一个长度为 n 的整数数组 nums。
leetcode.com 2026-07-16
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
🟡3867.sum-of-gcd-of-formed-pairs
🏷️ Tags
#array #math #two_pointers #number_theory #sorting #simulation
Telegraph
sum-of-gcd-of-formed-pairs
You are given an integer array nums of length n. Construct an array prefixGcd where for each index i:
leetcode.cn 2026-08-08
🟡3302.find-the-lexicographically-smallest-valid-sequence
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
🟡3302.find-the-lexicographically-smallest-valid-sequence
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
Telegraph
find-the-lexicographically-smallest-valid-sequence
给你两个字符串 word1 和 word2 。 如果一个字符串 x 修改 至多 一个字符会变成 y ,那么我们称它与 y 几乎相等 。 如果一个下标序列 seq 满足以下条件,我们称它是 合法的 :
leetcode.com 2026-08-08
🟡3302.find-the-lexicographically-smallest-valid-sequence
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
🟡3302.find-the-lexicographically-smallest-valid-sequence
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
Telegraph
find-the-lexicographically-smallest-valid-sequence
You are given two strings word1 and word2. A string x is called almost equal to y if you can change at most one character in x to make it identical to y. A sequence of indices seq is called valid if:
leetcode.cn 2026-08-28
🔴3734.lexicographically-smallest-palindromic-permutation-greater-than-target
🏷️ Tags
#two_pointers #string #enumeration
🔴3734.lexicographically-smallest-palindromic-permutation-greater-than-target
🏷️ Tags
#two_pointers #string #enumeration
Telegraph
lexicographically-smallest-palindromic-permutation-greater-than-target
给你两个长度均为 n 的字符串 s 和目标字符串 target,它们都由小写英文字母组成。
leetcode.com 2026-08-28
🔴3734.lexicographically-smallest-palindromic-permutation-greater-than-target
🏷️ Tags
#two_pointers #string #enumeration
🔴3734.lexicographically-smallest-palindromic-permutation-greater-than-target
🏷️ Tags
#two_pointers #string #enumeration
Telegraph
lexicographically-smallest-palindromic-permutation-greater-than-target
You are given two strings s and target, each of length n, consisting of lowercase English letters. Return the lexicographically smallest string that is both a palindromic permutation of s and strictly greater than target. If no such permutation exists, return…
leetcode.cn 2026-09-15
🔴2472.maximum-number-of-non-overlapping-palindrome-substrings
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
🔴2472.maximum-number-of-non-overlapping-palindrome-substrings
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
Telegraph
maximum-number-of-non-overlapping-palindrome-substrings
给你一个字符串 s 和一个 正 整数 k 。 从字符串 s 中选出一组满足下述条件且 不重叠 的子字符串:
leetcode.com 2026-09-15
🔴2472.maximum-number-of-non-overlapping-palindrome-substrings
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
🔴2472.maximum-number-of-non-overlapping-palindrome-substrings
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming
Telegraph
maximum-number-of-non-overlapping-palindrome-substrings
You are given a string s and a positive integer k. Select a set of non-overlapping substrings from the string s that satisfy the following conditions:
leetcode.cn 2026-11-05
🟢1385.find-the-distance-value-between-two-arrays
🏷️ Tags
#array #two_pointers #binary_search #sorting
🟢1385.find-the-distance-value-between-two-arrays
🏷️ Tags
#array #two_pointers #binary_search #sorting
Telegraph
find-the-distance-value-between-two-arrays
给你两个整数数组 arr1 , arr2 和一个整数 d ,请你返回两个数组之间的 距离值 。 「距离值」 定义为符合此距离要求的元素数目:对于元素 arr1[i] ,不存在任何元素 arr2[j] 满足 |arr1[i]-arr2[j]| <= d 。 示例 1: 输入:arr1 = [4,5,8], arr2 = [10,9,1,8], d = 2 输出:2 解释: 对于 arr1[0]=4 我们有: |4-10|=6 > d=2 |4-9|=5 > d=2 |4-1|=3 > d=2 |4-8|=4…
leetcode.com 2026-11-05
🟢1385.find-the-distance-value-between-two-arrays
🏷️ Tags
#array #two_pointers #binary_search #sorting
🟢1385.find-the-distance-value-between-two-arrays
🏷️ Tags
#array #two_pointers #binary_search #sorting
Telegraph
find-the-distance-value-between-two-arrays
Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the number of elements arr1[i] such that there is not any element arr2[j] where |arr1[i]-arr2[j]| <= d. Example…
leetcode.cn 2026-11-17
🔴2911.minimum-changes-to-make-k-semi-palindromes
🏷️ Tags
#two_pointers #string #dynamic_programming
🔴2911.minimum-changes-to-make-k-semi-palindromes
🏷️ Tags
#two_pointers #string #dynamic_programming
Telegraph
minimum-changes-to-make-k-semi-palindromes
给你一个字符串 s 和一个整数 k,请将 s 划分为 k 个 非空子串 ,使得将每个子串变为 半回文串 所需的字符修改次数之和最小。 返回所需的 最少 字符修改次数。 半回文串 是一类特殊的字符串:它可以按照某种重复模式拆分后,使每一组都成为 回文串 。判断一个字符串是否为半回文串的方法如下:
leetcode.com 2026-11-17
🔴2911.minimum-changes-to-make-k-semi-palindromes
🏷️ Tags
#two_pointers #string #dynamic_programming
🔴2911.minimum-changes-to-make-k-semi-palindromes
🏷️ Tags
#two_pointers #string #dynamic_programming
Telegraph
minimum-changes-to-make-k-semi-palindromes
Given a string s and an integer k, partition s into k substrings such that the letter changes needed to make each substring a semi-palindrome are minimized. Return the minimum number of letter changes required. A semi-palindrome is a special type of string…