leetcode.com 2026-06-27
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
🟡3020.find-the-maximum-number-of-elements-in-subset
🏷️ Tags
#array #hash_table #enumeration
Telegraph
find-the-maximum-number-of-elements-in-subset
You are given an array of positive integers nums. You need to select a subset of nums which satisfies the following condition:
leetcode.cn 2026-06-28
🟡1846.maximum-element-after-decreasing-and-rearranging
🏷️ Tags
#greedy #array #sorting
🟡1846.maximum-element-after-decreasing-and-rearranging
🏷️ Tags
#greedy #array #sorting
Telegraph
maximum-element-after-decreasing-and-rearranging
给你一个正整数数组 arr 。请你对 arr 执行一些操作(也可以不进行任何操作),使得数组满足以下条件:
leetcode.com 2026-06-28
🟡1846.maximum-element-after-decreasing-and-rearranging
🏷️ Tags
#greedy #array #sorting
🟡1846.maximum-element-after-decreasing-and-rearranging
🏷️ Tags
#greedy #array #sorting
Telegraph
maximum-element-after-decreasing-and-rearranging
You are given an array of positive integers arr. Perform some operations (possibly none) on arr so that it satisfies these conditions:
leetcode.cn 2026-06-29
🟢1967.number-of-strings-that-appear-as-substrings-in-word
🏷️ Tags
#array #string
🟢1967.number-of-strings-that-appear-as-substrings-in-word
🏷️ Tags
#array #string
Telegraph
number-of-strings-that-appear-as-substrings-in-word
给你一个字符串数组 patterns 和一个字符串 word ,统计 patterns 中有多少个字符串是 word 的子字符串。返回字符串数目。 子字符串 是字符串中的一个连续字符序列。 示例 1: 输入:patterns = ["a","abc","bc","d"], word = "abc" 输出:3 解释: - "a" 是 "abc" 的子字符串。 - "abc" 是 "abc" 的子字符串。 - "bc" 是 "abc" 的子字符串。 - "d" 不是 "abc" 的子字符串。 patterns…
leetcode.com 2026-06-29
🟢1967.number-of-strings-that-appear-as-substrings-in-word
🏷️ Tags
#array #string
🟢1967.number-of-strings-that-appear-as-substrings-in-word
🏷️ Tags
#array #string
Telegraph
number-of-strings-that-appear-as-substrings-in-word
Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring in word. A substring is a contiguous sequence of characters within a string. Example 1: Input: patterns = ["a","abc","bc","d"], word…