leetcode.com 2025-10-11
🟡3186.maximum-total-damage-with-spell-casting
🏷️ Tags
#array #hash_table #two_pointers #binary_search #dynamic_programming #counting #sorting
🟡3186.maximum-total-damage-with-spell-casting
🏷️ Tags
#array #hash_table #two_pointers #binary_search #dynamic_programming #counting #sorting
Telegraph
maximum-total-damage-with-spell-casting
A magician has various spells. You are given an array power, where each element represents the damage of a spell. Multiple spells can have the same damage value. It is a known fact that if a magician decides to cast a spell with a damage of power[i], they…
leetcode.cn 2025-10-13
🟢2273.find-resultant-array-after-removing-anagrams
🏷️ Tags
#array #hash_table #string #sorting
🟢2273.find-resultant-array-after-removing-anagrams
🏷️ Tags
#array #hash_table #string #sorting
Telegraph
find-resultant-array-after-removing-anagrams
给你一个下标从 0 开始的字符串 words ,其中 words[i] 由小写英文字符组成。 在一步操作中,需要选出任一下标 i ,从 words 中 删除 words[i] 。其中下标 i 需要同时满足下述两个条件:
leetcode.com 2025-10-13
🟢2273.find-resultant-array-after-removing-anagrams
🏷️ Tags
#array #hash_table #string #sorting
🟢2273.find-resultant-array-after-removing-anagrams
🏷️ Tags
#array #hash_table #string #sorting
Telegraph
find-resultant-array-after-removing-anagrams
You are given a 0-indexed string array words, where words[i] consists of lowercase English letters. In one operation, select any index i such that 0 < i < words.length and words[i - 1] and words[i] are anagrams, and delete words[i] from words. Keep performing…