leetcode.cn 2026-10-28
🟡3882.minimum-xor-path-in-a-grid
🏷️ Tags
#bit_manipulation #array #dynamic_programming #matrix
🟡3882.minimum-xor-path-in-a-grid
🏷️ Tags
#bit_manipulation #array #dynamic_programming #matrix
Telegraph
minimum-xor-path-in-a-grid
给你一个大小为 m * n 的二维整数数组 grid。
leetcode.com 2026-10-28
🟡3882.minimum-xor-path-in-a-grid
🏷️ Tags
#bit_manipulation #array #dynamic_programming #matrix
🟡3882.minimum-xor-path-in-a-grid
🏷️ Tags
#bit_manipulation #array #dynamic_programming #matrix
Telegraph
minimum-xor-path-in-a-grid
You are given a 2D integer array grid of size m * n. You start at the top-left cell (0, 0) and want to reach the bottom-right cell (m - 1, n - 1). At each step, you may move either right or down. The cost of a path is defined as the bitwise XOR of all the…
leetcode.cn 2026-10-29
🔴3841.palindromic-path-queries-in-a-tree
🏷️ Tags
#bit_manipulation #tree #depth_first_search #binary_indexed_tree #segment_tree #array #string #divide_and_conquer
🔴3841.palindromic-path-queries-in-a-tree
🏷️ Tags
#bit_manipulation #tree #depth_first_search #binary_indexed_tree #segment_tree #array #string #divide_and_conquer
Telegraph
palindromic-path-queries-in-a-tree
给你一棵包含 n 个节点的无向树,节点编号从 0 到 n - 1。树由一个长度为 n - 1 的二维数组 edges 表示,其中 edges[i] = [ui, vi] 表示节点 ui 和 vi 之间存在一条无向边。
leetcode.com 2026-10-29
🔴3841.palindromic-path-queries-in-a-tree
🏷️ Tags
#bit_manipulation #tree #depth_first_search #binary_indexed_tree #segment_tree #array #string #divide_and_conquer
🔴3841.palindromic-path-queries-in-a-tree
🏷️ Tags
#bit_manipulation #tree #depth_first_search #binary_indexed_tree #segment_tree #array #string #divide_and_conquer
Telegraph
palindromic-path-queries-in-a-tree
You are given an undirected tree with n nodes labeled 0 to n - 1. This is represented by a 2D array edges of length n - 1, where edges[i] = [ui, vi] indicates an undirected edge between nodes ui and vi. You are also given a string s of length n consisting…
leetcode.cn 2026-10-30
🟡3970.shortest-path-with-at-most-k-consecutive-identical-characters
🏷️ Tags
#graph #string #shortest_path #heap_priority_queue
🟡3970.shortest-path-with-at-most-k-consecutive-identical-characters
🏷️ Tags
#graph #string #shortest_path #heap_priority_queue
Telegraph
shortest-path-with-at-most-k-consecutive-identical-characters
给你一个整数 n,表示一个 有向加权 图中的节点数量,节点编号从 0 到 n - 1。该图由二维数组 edges 表示,其中 edges[i] = [ui, vi, wi] 表示一条从节点 ui 指向节点 vi、权重为 wi 的有向边。
leetcode.com 2026-10-30
🟡3970.shortest-path-with-at-most-k-consecutive-identical-characters
🏷️ Tags
#graph #string #shortest_path #heap_priority_queue
🟡3970.shortest-path-with-at-most-k-consecutive-identical-characters
🏷️ Tags
#graph #string #shortest_path #heap_priority_queue
Telegraph
shortest-path-with-at-most-k-consecutive-identical-characters
You are given an integer n representing the number of nodes in a directed weighted graph, numbered from 0 to n - 1. This is represented by a 2D integer array edges, where edges[i] = [ui, vi, wi] represents a directed edge from node ui to node vi with weight…
leetcode.cn 2026-11-04
🔴3505.minimum-operations-to-make-elements-within-k-subarrays-equal
🏷️ Tags
#array #hash_table #math #dynamic_programming #sliding_window #heap_priority_queue
🔴3505.minimum-operations-to-make-elements-within-k-subarrays-equal
🏷️ Tags
#array #hash_table #math #dynamic_programming #sliding_window #heap_priority_queue
Telegraph
minimum-operations-to-make-elements-within-k-subarrays-equal
给你一个整数数组 nums 和两个整数 x 和 k。你可以执行以下操作任意次(包括零次):
leetcode.com 2026-11-04
🔴3505.minimum-operations-to-make-elements-within-k-subarrays-equal
🏷️ Tags
#array #hash_table #math #dynamic_programming #sliding_window #heap_priority_queue
🔴3505.minimum-operations-to-make-elements-within-k-subarrays-equal
🏷️ Tags
#array #hash_table #math #dynamic_programming #sliding_window #heap_priority_queue
Telegraph
minimum-operations-to-make-elements-within-k-subarrays-equal
You are given an integer array nums and two integers, x and k. You can perform the following operation any number of times (including zero):
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…