LeetCode: Map 映射

友情支持

如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

支付宝

有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

wx jikerizhi

公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

Map 映射

经典题目

1. 两数之和
3. 无重复字符的最长子串
12. Integer to Roman
13. Roman to Integer
17. Letter Combinations of a Phone Number
[0030-substring-with-concatenation-of-all-words]
[0036-valid-sudoku]
37. Sudoku Solver
41. 缺失的第一个正数
49. Group Anagrams
73. Set Matrix Zeroes
76. 最小覆盖子串
105. Construct Binary Tree from Preorder and Inorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal
[0126-word-ladder-ii]
127. Word Ladder
[0128-longest-consecutive-sequence]
133. Clone Graph
138. Copy List with Random Pointer
139. Word Break
[0140-word-break-ii]
141. 环形链表
142. 环形链表 II
146. LRU 缓存
[0149-max-points-on-a-line]
[0159-longest-substring-with-at-most-two-distinct-characters]
160. Intersection of Two Linked Lists
166. Fraction to Recurring Decimal
169. Majority Element
[0170-two-sum-iii-data-structure-design]
[0187-repeated-dna-sequences]
202. 快乐数
205. Isomorphic Strings
208. 实现 Trie (前缀树)
217. Contains Duplicate
[0219-contains-duplicate-ii]
[0229-majority-element-ii]
242. Valid Anagram
[0244-shortest-word-distance-ii]
[0246-strobogrammatic-number]
[0249-group-shifted-strings]
[0264-ugly-number-ii]
[0266-palindrome-permutation]
[0267-palindrome-permutation-ii]
268. Missing Number
[0288-unique-word-abbreviation]
[0290-word-pattern]
[0291-word-pattern-ii]
[0299-bulls-and-cows]
[0305-number-of-islands-ii]
[0311-sparse-matrix-multiplication]
[0314-binary-tree-vertical-order-traversal]
[0325-maximum-size-subarray-sum-equals-k]
[0336-palindrome-pairs]
[0340-longest-substring-with-at-most-k-distinct-characters]
347. 前 K 个高频元素
[0348-design-tic-tac-toe]
[0349-intersection-of-two-arrays]
350. Intersection of Two Arrays II
[0353-design-snake-game]
[0355-design-twitter]
[0356-line-reflection]
[0358-rearrange-string-k-distance-apart]
[0359-logger-rate-limiter]
[0379-design-phone-directory]
380. Insert Delete GetRandom O(1)
[0381-insert-delete-getrandom-o1-duplicates-allowed]
[0383-ransom-note]
387. First Unique Character in a String
[0389-find-the-difference]
395. Longest Substring with At Least K Repeating Characters
[0398-random-pick-index]
409. Longest Palindrome
[0421-maximum-xor-of-two-numbers-in-an-array]
[0423-reconstruct-original-digits-from-english]
[0424-longest-repeating-character-replacement]
[0432-all-oone-data-structure]
[0433-minimum-genetic-mutation]
438. Find All Anagrams in a String
[0442-find-all-duplicates-in-an-array]
[0447-number-of-boomerangs]
448. Find All Numbers Disappeared in an Array
[0451-sort-characters-by-frequency]
454. 4Sum II
[0457-circular-array-loop]
[0460-lfu-cache]
480. Sliding Window Median
[0491-non-decreasing-subsequences]
496. Next Greater Element I
[0500-keyboard-row]
[0508-most-frequent-subtree-sum]
[0519-random-flip-matrix]
[0522-longest-uncommon-subsequence-ii]
523. Continuous Subarray Sum
[0525-contiguous-array]
[0531-lonely-pixel-i]
[0532-k-diff-pairs-in-an-array]
[0533-lonely-pixel-ii]
[0535-encode-and-decode-tinyurl]
[0548-split-array-with-equal-sum]
[0554-brick-wall]
560. Subarray Sum Equals K
567. Permutation in String
[0575-distribute-candies]
[0582-kill-process]
[0588-design-in-memory-file-system]
[0594-longest-harmonious-subsequence]
[0599-minimum-index-sum-of-two-lists]
[0609-find-duplicate-file-in-system]
[0616-add-bold-tag-in-string]
621. 任务调度器
[0631-design-excel-sum-formula]
[0632-smallest-range-covering-elements-from-k-lists]
[0635-design-log-storage-system]
[0645-set-mismatch]
[0648-replace-words]
[0652-find-duplicate-subtrees]
[0653-two-sum-iv-input-is-a-bst]
[0659-split-array-into-consecutive-subsequences]
[0666-path-sum-iv]
[0676-implement-magic-dictionary]
[0677-map-sum-pairs]
[0681-next-closest-time]
[0690-employee-importance]
[0691-stickers-to-spell-word]
[0692-top-k-frequent-words]
[0694-number-of-distinct-islands]
[0697-degree-of-an-array]
[0705-design-hashset]
[0706-design-hashmap]
710. Random Pick with Blacklist
[0711-number-of-distinct-islands-ii]
[0720-longest-word-in-dictionary]
[0721-accounts-merge]
[0726-number-of-atoms]
[0734-sentence-similarity]
[0736-parse-lisp-expression]
[0737-sentence-similarity-ii]
740. 删除并获得点数
[0745-prefix-and-suffix-search]
[0748-shortest-completing-word]
752. Open the Lock
[0758-bold-words-in-string]
[0760-find-anagram-mappings]
[0763-partition-labels]
[0767-reorganize-string]
[0770-basic-calculator-iv]
[0771-jewels-and-stones]
[0781-rabbits-in-forest]
[0791-custom-sort-string]
[0792-number-of-matching-subsequences]
[0804-unique-morse-code-words]
[0811-subdomain-visit-count]
[0815-bus-routes]
[0817-linked-list-components]
[0819-most-common-word]
[0820-short-encoding-of-words]
[0822-card-flipping-game]
[0823-binary-trees-with-factors]
[0828-count-unique-characters-of-all-substrings-of-a-given-string]
[0833-find-and-replace-in-string]
[0839-similar-string-groups]
[0840-magic-squares-in-grid]
[0846-hand-of-straights]
[0859-buddy-strings]
[0863-all-nodes-distance-k-in-binary-tree]
[0865-smallest-subtree-with-all-the-deepest-nodes]
869. Reordered Power of 2
[0873-length-of-longest-fibonacci-subsequence]
[0874-walking-robot-simulation]
[0884-uncommon-words-from-two-sentences]
[0888-fair-candy-swap]
[0889-construct-binary-tree-from-preorder-and-postorder-traversal]
[0890-find-and-replace-pattern]
[0893-groups-of-special-equivalent-strings]
[0895-maximum-frequency-stack]
904. Fruit Into Baskets
[0911-online-election]
[0914-x-of-a-kind-in-a-deck-of-cards]
[0916-word-subsets]
[0923-3sum-with-multiplicity]
[0924-minimize-malware-spread]
[0928-minimize-malware-spread-ii]
[0929-unique-email-addresses]
[0930-binary-subarrays-with-sum]
[0939-minimum-area-rectangle]
[0947-most-stones-removed-with-same-row-or-column]
[0952-largest-component-size-by-common-factor]
[0953-verifying-an-alien-dictionary]
[0954-array-of-doubled-pairs]
[0957-prison-cells-after-n-days]
[0959-regions-cut-by-slashes]
[0961-n-repeated-element-in-size-2n-array]
[0966-vowel-spellchecker]
[0970-powerful-integers]
[0974-subarray-sums-divisible-by-k]
[0981-time-based-key-value-store]
[0982-triples-with-bitwise-and-equal-to-zero]
[0987-vertical-order-traversal-of-a-binary-tree]
992. Subarrays with K Different Integers
[0996-number-of-squareful-arrays]
[0997-find-the-town-judge]
[1001-grid-illumination]
[1002-find-common-characters]
[1010-pairs-of-songs-with-total-durations-divisible-by-60]
[1015-smallest-integer-divisible-by-k]
[1027-longest-arithmetic-subsequence]
[1036-escape-a-large-maze]
[1048-longest-string-chain]
[1054-distant-barcodes]
[1072-flip-columns-for-maximum-number-of-equal-rows]
[1074-number-of-submatrices-that-sum-to-target]
[1079-letter-tile-possibilities]
[1086-high-five]
1090. Largest Values From Labels
[1100-find-k-length-substrings-with-no-repeated-characters]
1110. Delete Nodes And Return Forest
[1122-relative-sort-array]
[1123-lowest-common-ancestor-of-deepest-leaves]
[1124-longest-well-performing-interval]
[1128-number-of-equivalent-domino-pairs]
[1133-largest-unique-number]
[1138-alphabet-board-path]
[1146-snapshot-array]
[1152-analyze-user-website-visit-pattern]
[1153-string-transforms-into-another-string]
[1156-swap-for-longest-repeated-character-substring]
[1160-find-words-that-can-be-formed-by-characters]
[1165-single-row-keyboard]
[1166-design-file-system]
[1169-invalid-transactions]
[1170-compare-strings-by-frequency-of-the-smallest-character]
[1171-remove-zero-sum-consecutive-nodes-from-linked-list]
[1172-dinner-plate-stacks]
[1177-can-make-palindrome-from-substring]
[1178-number-of-valid-words-for-each-puzzle]
[1181-before-and-after-puzzle]
[1189-maximum-number-of-balloons]
[1198-find-smallest-common-element-in-all-rows]
[1202-smallest-string-with-swaps]
[1207-unique-number-of-occurrences]
[1213-intersection-of-three-sorted-arrays]
[1218-longest-arithmetic-subsequence-of-given-difference]
[1224-maximum-equal-frequency]
[1244-design-a-leaderboard]
[1248-count-number-of-nice-subarrays]
[1257-smallest-common-region]
[1258-synonymous-sentences]
[1261-find-elements-in-a-contaminated-binary-tree]
[1275-find-winner-on-a-tic-tac-toe-game]
[1282-group-the-people-given-the-group-size-they-belong-to]
[1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix]
[1296-divide-array-in-sets-of-k-consecutive-numbers]
[1297-maximum-number-of-occurrences-of-a-substring]
[1311-get-watched-videos-by-your-friends]
[1331-rank-transform-of-an-array]
[1338-reduce-array-size-to-the-half]
[1345-jump-game-iv]
[1346-check-if-n-and-its-double-exist]
[1347-minimum-number-of-steps-to-make-two-strings-anagram]
[1348-tweet-counts-per-frequency]
[1357-apply-discount-every-n-orders]
[1358-number-of-substrings-containing-all-three-characters]
[1365-how-many-numbers-are-smaller-than-the-current-number]
[1366-rank-teams-by-votes]
[1370-increasing-decreasing-string]
[1371-find-the-longest-substring-containing-vowels-in-even-counts]
[1386-cinema-seat-allocation]
[1394-find-lucky-integer-in-an-array]
[1396-design-underground-system]
[1399-count-largest-group]
[1400-construct-k-palindrome-strings]
[1410-html-entity-parser]
[1418-display-table-of-food-orders-in-a-restaurant]
[1426-counting-elements]
[1429-first-unique-number]
[1436-destination-city]
[1442-count-triplets-that-can-form-two-arrays-of-equal-xor]
[1443-minimum-time-to-collect-all-apples-in-a-tree]
[1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list]
[1460-make-two-arrays-equal-by-reversing-subarrays]
[1461-check-if-a-string-contains-all-binary-codes-of-size-k]
[1477-find-two-non-overlapping-sub-arrays-each-with-target-sum]
[1481-least-number-of-unique-integers-after-k-removals]
[1485-clone-binary-tree-with-random-pointer]
[1487-making-file-names-unique]
[1488-avoid-flood-in-the-city]
[1490-clone-n-ary-tree]
[1496-path-crossing]
[1497-check-if-array-pairs-are-divisible-by-k]
[1500-design-a-file-sharing-system]
[1506-find-root-of-n-ary-tree]
[1512-number-of-good-pairs]
[1519-number-of-nodes-in-the-sub-tree-with-the-same-label]
[1525-number-of-good-ways-to-split-a-string]
[1540-can-convert-string-in-k-moves]
[1542-find-longest-awesome-substring]
[1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target]
[1554-strings-differ-by-one-character]
[1562-find-latest-group-of-size-m]
[1570-dot-product-of-two-sparse-vectors]
[1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers]
[1590-make-sum-divisible-by-p]
[1593-split-a-string-into-the-max-number-of-unique-substrings]
[1600-throne-inheritance]
[1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period]
[1612-check-if-two-expression-trees-are-equivalent]
[1624-largest-substring-between-two-equal-characters]
[1630-arithmetic-subarrays]
[1636-sort-array-by-increasing-frequency]
[1638-count-substrings-that-differ-by-one-character]
[1640-check-array-formation-through-concatenation]
[1647-minimum-deletions-to-make-character-frequencies-unique]
1650. Lowest Common Ancestor of a Binary Tree III
[1656-design-an-ordered-stream]
[1657-determine-if-two-strings-are-close]
[1658-minimum-operations-to-reduce-x-to-zero]
[1660-correct-a-binary-tree]
[1674-minimum-moves-to-make-array-complementary]
[1676-lowest-common-ancestor-of-a-binary-tree-iv]
[1679-max-number-of-k-sum-pairs]
[1684-count-the-number-of-consistent-strings]
[1695-maximum-erasure-value]
[1711-count-good-meals]
[1713-minimum-operations-to-make-a-subsequence]
[1726-tuple-with-same-product]
[1733-minimum-number-of-people-to-teach]
[1737-change-minimum-characters-to-satisfy-one-of-three-conditions]
[1740-find-distance-in-a-binary-tree]
[1742-maximum-number-of-balls-in-a-box]
[1743-restore-the-array-from-adjacent-pairs]
[1748-sum-of-unique-elements]
[1756-design-most-recently-used-queue]
[1763-longest-nice-substring]
[1772-sort-features-by-popularity]
[1775-equal-sum-arrays-with-minimum-number-of-operations]
[1781-sum-of-beauty-of-all-substrings]
[1788-maximize-the-beauty-of-the-garden]
[1790-check-if-one-string-swap-can-make-strings-equal]
[1794-count-pairs-of-equal-substrings-with-minimum-difference]
[1796-second-largest-digit-in-a-string]
[1797-design-authentication-manager]
[1804-implement-trie-ii-prefix-tree]
[1805-number-of-different-integers-in-a-string]
[1807-evaluate-the-bracket-pairs-of-a-string]
[1814-count-nice-pairs-in-an-array]
[1817-finding-the-users-active-minutes]
[1832-check-if-the-sentence-is-pangram]
[1836-remove-duplicates-from-an-unsorted-linked-list]
[1852-distinct-numbers-in-each-subarray]
[1857-largest-color-value-in-a-directed-graph]
[1865-finding-pairs-with-a-certain-sum]
[1876-substrings-of-size-three-with-distinct-characters]
[1893-check-if-all-the-integers-in-a-range-are-covered]
[1897-redistribute-characters-to-make-all-strings-equal]
[1906-minimum-absolute-difference-queries]
[1912-design-movie-rental-system]
[1915-number-of-wonderful-substrings]
[1930-unique-length-3-palindromic-subsequences]
[1932-merge-bsts-to-create-single-bst]
[1935-maximum-number-of-words-you-can-type]
[1938-maximum-genetic-difference-query]
[1940-longest-common-subsequence-between-sorted-arrays]
[1941-check-if-all-characters-have-equal-number-of-occurrences]
[1942-the-number-of-the-smallest-unoccupied-chair]
[1943-describe-the-painting]
[1948-delete-duplicate-folders-in-system]
[1980-find-unique-binary-string]
[1983-widest-pair-of-indices-with-equal-range-sum]
[1993-operations-on-tree]
[1995-count-special-quadruplets]
[2001-number-of-pairs-of-interchangeable-rectangles]
[2006-count-number-of-pairs-with-absolute-difference-k]
[2007-find-original-array-from-doubled-array]
[2008-maximum-earnings-from-taxi]
[2009-minimum-number-of-operations-to-make-array-continuous]
[2013-detect-squares]
[2023-number-of-pairs-of-strings-with-concatenation-equal-to-target]
[2025-maximum-number-of-ways-to-partition-an-array]
[2032-two-out-of-three]
[2034-stock-price-fluctuation]
[2043-simple-bank-system]
[2048-next-greater-numerically-balanced-number]
[2053-kth-distinct-string-in-an-array]
[2062-count-vowel-substrings-of-a-string]
[2067-number-of-equal-count-substrings]
[2068-check-whether-two-strings-are-almost-equivalent]
[2080-range-frequency-queries]
[2083-substrings-that-begin-and-end-with-the-same-letter]
[2085-count-common-words-with-one-occurrence]
[2094-finding-3-digit-even-numbers]
[2099-find-subsequence-of-length-k-with-the-largest-sum]
[2103-rings-and-rods]
[2107-number-of-unique-flavors-after-sharing-k-candies]
[2115-find-all-possible-recipes-from-given-supplies]
[2121-intervals-between-identical-elements]
[2122-recover-the-original-array]
[2131-longest-palindrome-by-concatenating-two-letter-words]
[2133-check-if-every-row-and-column-contains-all-numbers]
[2135-count-words-obtained-after-adding-a-letter]
[2150-find-all-lonely-numbers-in-the-array]
[2152-minimum-number-of-lines-to-cover-points]
[2154-keep-multiplying-found-values-by-two]
[2166-design-bitset]
[2168-unique-substrings-with-equal-digit-frequency]
[2170-minimum-operations-to-make-the-array-alternating]
[2182-construct-string-with-repeat-limit]
[2186-minimum-number-of-steps-to-make-two-strings-anagram-ii]
[2190-most-frequent-number-following-key-in-an-array]
[2196-create-binary-tree-from-descriptions]
[2201-count-artifacts-that-can-be-extracted]
[2206-divide-array-into-equal-pairs]
[2215-find-the-difference-of-two-arrays]
[2225-find-players-with-zero-or-one-losses]
[2227-encrypt-and-decrypt-strings]
[2229-check-if-an-array-is-consecutive]
[2244-minimum-rounds-to-complete-all-tasks]
[2248-intersection-of-multiple-arrays]
[2249-count-lattice-points-inside-a-circle]
[2250-count-number-of-rectangles-containing-each-point]
[2251-number-of-flowers-in-full-bloom]
[2254-design-video-sharing-platform]
[2260-minimum-consecutive-cards-to-pick-up]
[2261-k-divisible-elements-subarrays]
[2262-total-appeal-of-a-string]
[2266-count-number-of-texts]
[2268-minimum-number-of-keypresses]
[2273-find-resultant-array-after-removing-anagrams]
[2275-largest-combination-with-bitwise-and-greater-than-zero]
[2283-check-if-number-has-equal-digit-count-and-digit-value]
[2284-sender-with-largest-word-count]
[2287-rearrange-characters-to-make-target-string]
[2295-replace-elements-in-an-array]
[2301-match-substring-after-replacement]
[2306-naming-a-company]
[2309-greatest-english-letter-in-upper-and-lower-case]
[2325-decode-the-message]
[2336-smallest-number-in-infinite-set]
[2341-maximum-number-of-pairs-in-array]
[2342-max-sum-of-a-pair-with-equal-sum-of-digits]
[2347-best-poker-hand]
[2349-design-a-number-container-system]
[2350-shortest-impossible-sequence-of-rolls]
[2351-first-letter-to-appear-twice]
[2352-equal-row-and-column-pairs]
[2353-design-a-food-rating-system]
[2354-number-of-excellent-pairs]
[2357-make-array-zero-by-subtracting-equal-amounts]
[2363-merge-similar-items]
[2364-count-number-of-bad-pairs]
[2365-task-scheduler-ii]
[2367-number-of-arithmetic-triplets]
[2368-reachable-nodes-with-restrictions]
[2370-longest-ideal-subsequence]
[2374-node-with-highest-edge-score]
[2384-largest-palindromic-number]
[2385-amount-of-time-for-binary-tree-to-be-infected]
[2395-find-subarrays-with-equal-sum]
[2399-check-distances-between-same-letters]
[2402-meeting-rooms-iii]
[2404-most-frequent-even-element]
[2405-optimal-partition-of-string]
[2408-design-sql]
[2418-sort-the-people]
[2421-number-of-good-paths]
[2423-remove-letter-to-equalize-frequency]
[2434-using-a-robot-to-print-the-lexicographically-smallest-string]
[2441-largest-positive-integer-that-exists-with-its-negative]
[2442-count-number-of-distinct-integers-after-reverse-operations]
[2451-odd-string-difference]
[2453-destroy-sequential-targets]
[2456-most-popular-video-creator]
[2461-maximum-sum-of-distinct-subarrays-with-length-k]
[2465-number-of-distinct-averages]
[2475-number-of-unequal-triplets-in-array]
[2488-count-subarrays-with-median-k]
[2489-number-of-substrings-with-fixed-ratio]
[2491-divide-players-into-teams-of-equal-skill]
[2499-minimum-total-cost-to-make-arrays-unequal]
[2501-longest-square-streak-in-an-array]
[2502-design-memory-allocator]
[2506-count-pairs-of-similar-strings]
[2508-add-edges-to-make-degrees-of-all-nodes-even]
[2512-reward-top-k-students]
[2514-count-anagrams]
[2516-take-k-of-each-character-from-left-and-right]
[2521-distinct-prime-factors-of-product-of-array]
[2524-maximum-frequency-score-of-a-subarray]
[2526-find-consecutive-integers-from-a-data-stream]
[2531-make-number-of-distinct-characters-equal]
[2537-count-the-number-of-good-subarrays]
[2539-count-the-number-of-good-subsequences]
[2540-minimum-common-value]
[2547-minimum-cost-to-split-an-array]
[2549-count-distinct-numbers-on-board]
[2554-maximum-number-of-integers-to-choose-from-a-range-i]
[2561-rearranging-fruits]
[2564-substring-xor-queries]
[2570-merge-two-2d-arrays-by-summing-values]
[2581-count-number-of-possible-root-nodes]
[2584-split-the-array-to-make-coprime-products]
[2588-count-the-number-of-beautiful-subarrays]
[2590-design-a-todo-list]
[2593-find-score-of-an-array-after-marking-all-elements]
[2597-the-number-of-beautiful-subsets]
[2598-smallest-missing-non-negative-integer-after-operations]
[2605-form-smallest-number-from-two-digit-arrays]
[2606-find-the-substring-with-maximum-cost]
[2610-convert-an-array-into-a-2d-array-with-conditions]
[2615-sum-of-distances]
[2641-cousins-in-binary-tree-ii]
[2653-sliding-subarray-beauty]
[2657-find-the-prefix-common-array-of-two-arrays]
[2661-first-completely-painted-row-or-column]
[2670-find-the-distinct-difference-array]
[2671-frequency-tracker]
[2682-find-the-losers-of-the-circular-game]
[2707-extra-characters-in-a-string]
[2711-difference-of-number-of-distinct-values-on-diagonals]
[2713-maximum-strictly-increasing-cells-in-a-matrix]
[2716-minimize-string-length]
[2718-sum-of-matrix-after-queries]
[2729-check-if-the-number-is-fascinating]
[2732-find-a-good-subset-of-the-matrix]
[2743-count-substrings-without-repeating-character]
[2744-find-maximum-number-of-string-pairs]
[2747-count-zero-request-servers]
[2748-number-of-beautiful-pairs]
[2763-sum-of-imbalance-numbers-of-all-subarrays]
[2766-relocate-marbles]
[2767-partition-string-into-minimum-beautiful-substrings]
[2768-number-of-black-blocks]
[2780-minimum-index-of-a-valid-split]
[2781-length-of-the-longest-valid-substring]
[2784-check-if-array-is-good]
[2799-count-complete-subarrays-in-an-array]
[2808-minimum-seconds-to-equalize-a-circular-array]
[2813-maximum-elegance-of-a-k-length-subsequence]
[2815-max-pair-sum-in-an-array]
[2830-maximize-the-profit-as-the-salesman]
[2831-find-the-longest-equal-subarray]
[2840-check-if-strings-can-be-made-equal-with-operations-ii]
[2841-maximum-sum-of-almost-unique-subarray]
[2842-count-k-subsequences-of-a-string-with-maximum-beauty]
[2845-count-of-interesting-subarrays]
[2848-points-that-intersect-with-cars]
[2852-sum-of-remoteness-of-all-cells]
[2856-minimum-array-length-after-pair-removals]
[2857-count-pairs-of-points-with-distance-k]
[2869-minimum-operations-to-collect-elements]
[2870-minimum-number-of-operations-to-make-array-empty]
[2875-minimum-size-subarray-in-infinite-array]
[2897-apply-operations-on-array-to-maximize-sum-of-squares]
[2898-maximum-linear-stock-score]
[2902-count-of-sub-multisets-with-bounded-sum]
[2910-minimum-number-of-groups-to-create-a-valid-assignment]
[2913-subarrays-distinct-element-sum-of-squares-i]
[2932-maximum-strong-pair-xor-i]
[2933-high-access-employees]
[2935-maximum-strong-pair-xor-ii]
[2947-count-beautiful-substrings-i]
[2949-count-beautiful-substrings-ii]
[2950-number-of-divisible-substrings]
[2953-count-complete-substrings]
[2955-number-of-same-end-substrings]
[2956-find-common-elements-between-two-arrays]
[2958-length-of-longest-subarray-with-at-most-k-frequency]
[2963-count-the-number-of-good-partitions]
[2964-number-of-divisible-triplet-sums]
[2965-find-missing-and-repeated-values]
[2975-maximum-square-area-by-removing-fences-from-a-field]
[2981-find-longest-special-substring-that-occurs-thrice-i]
[2982-find-longest-special-substring-that-occurs-thrice-ii]
[2983-palindrome-rearrangement-queries]
[2996-smallest-missing-integer-greater-than-sequential-prefix-sum]
[3002-maximum-size-of-a-set-after-removals]
[3005-count-elements-with-maximum-frequency]
[3013-divide-an-array-into-subarrays-with-minimum-cost-ii]
[3016-minimum-number-of-pushes-to-type-word-ii]
[3020-find-the-maximum-number-of-elements-in-subset]
[3026-maximum-good-subarray-sum]
[3032-count-numbers-with-unique-digits-ii]
[3035-maximum-palindromes-after-operations]
[3039-apply-operations-to-make-string-empty]
[3043-find-the-length-of-the-longest-common-prefix]
[3044-most-frequent-prime]
[3046-split-the-array]
[3063-linked-list-frequency]
[3071-minimum-operations-to-write-the-letter-y-on-a-grid]
[3076-shortest-uncommon-substring-in-an-array]
[3078-match-alphanumerical-pattern-in-matrix-i]
[3080-mark-elements-on-array-by-performing-queries]
[3081-replace-question-marks-in-string-to-minimize-its-value]
[3083-existence-of-a-substring-in-a-string-and-its-reverse]
[3085-minimum-deletions-to-make-string-k-special]
[3090-maximum-length-substring-with-two-occurrences]
[3092-most-frequent-ids]
[3104-find-longest-self-contained-substring]
[3120-count-the-number-of-special-characters-i]
[3121-count-the-number-of-special-characters-ii]
[3128-right-triangles]
[3134-find-the-median-of-the-uniqueness-array]
[3137-minimum-number-of-operations-to-make-word-k-periodic]
[3138-minimum-length-of-anagram-concatenation]
[3143-maximum-points-inside-the-square]
[3144-minimum-substring-partition-of-equal-character-frequency]
[3146-permutation-difference-between-two-strings]
[3153-sum-of-digit-differences-of-all-pairs]
[3158-find-the-xor-of-numbers-which-appear-twice]
[3159-find-occurrences-of-an-element-in-an-array]
[3160-find-the-number-of-distinct-colors-among-the-balls]
[3162-find-the-number-of-good-pairs-i]
[3164-find-the-number-of-good-pairs-ii]
[3167-better-compression-of-string]
[3170-lexicographically-minimum-string-after-removing-stars]
[3176-find-the-maximum-length-of-a-good-subsequence-i]
[3177-find-the-maximum-length-of-a-good-subsequence-ii]
[3184-count-pairs-that-form-a-complete-day-i]
[3185-count-pairs-that-form-a-complete-day-ii]
[3186-maximum-total-damage-with-spell-casting]
[3217-delete-nodes-from-linked-list-present-in-array]
[3223-minimum-length-of-string-after-operations]
[3224-minimum-array-changes-to-make-differences-equal]
[3237-alt-and-tab-simulation]
[3238-find-the-number-of-winning-players]
[3242-design-neighbor-sum-service]
[3265-count-almost-equal-pairs-i]
[3267-count-almost-equal-pairs-ii]
[3272-find-the-count-of-good-integers]
[3279-maximum-total-area-occupied-by-pistons]
[3289-the-two-sneaky-numbers-of-digitville]
[3295-report-spam-message]
[3297-count-substrings-that-can-be-rearranged-to-contain-a-string-i]
[3298-count-substrings-that-can-be-rearranged-to-contain-a-string-ii]
[3299-sum-of-consecutive-subsequences]
[3305-count-of-substrings-containing-every-vowel-and-k-consonants-i]
[3306-count-of-substrings-containing-every-vowel-and-k-consonants-ii]
[3311-construct-2d-grid-matching-graph-layout]
[3312-sorted-gcd-pair-queries]
[3316-find-maximum-removals-from-source-string]
[3318-find-x-sum-of-all-k-long-subarrays-i]
[3321-find-x-sum-of-all-k-long-subarrays-ii]
[3325-count-substrings-with-k-frequency-characters-i]
[3327-check-if-dfs-strings-are-palindromes]
[3329-count-substrings-with-k-frequency-characters-ii]
[3331-find-subtree-sizes-after-changes]
[3335-total-characters-in-string-after-transformations-i]
[3337-total-characters-in-string-after-transformations-ii]
[3351-sum-of-good-subsequences]
[3365-rearrange-k-substrings-to-form-target-string]
[3369-design-an-array-statistics-tracker]
[3371-identify-the-largest-outlier-in-an-array]
[3375-minimum-operations-to-make-array-values-equal-to-k]
[3378-count-connected-components-in-lcm-graph]
[3381-maximum-subarray-sum-with-length-divisible-by-k]
[3389-minimum-operations-to-make-character-frequencies-equal]
[3391-design-a-3d-binary-matrix-with-efficient-layer-tracking]
[3395-subsequences-with-a-unique-middle-mode-i]
[3396-minimum-number-of-operations-to-make-elements-in-array-distinct]
[3404-count-special-subsequences]
[3408-design-task-manager]
[3412-find-mirror-score-of-a-string]
[3416-subsequences-with-a-unique-middle-mode-ii]
[3422-minimum-operations-to-make-subarray-elements-equal]
[3425-longest-special-path]
[3431-minimum-unlocked-indices-to-sort-nums]
[3434-maximum-frequency-after-subarray-operation]
[3438-find-valid-pair-of-adjacent-digits-in-string]
[3442-maximum-difference-between-even-and-odd-frequency-i]
[3443-maximum-manhattan-distance-after-k-changes]
[3447-assign-elements-to-groups-with-constraints]
[3450-maximum-students-on-a-single-bench]
[3458-select-k-disjoint-special-substrings]
[3471-find-the-largest-almost-missing-integer]
[3481-apply-substitutions]
[3483-unique-3-digit-even-numbers]
[3484-design-spreadsheet]
[3486-longest-special-path-ii]
[3487-maximum-unique-subarray-sum-after-deletion]
[3488-closest-equal-element-queries]
[3493-properties-graph]
[3505-minimum-operations-to-make-elements-within-k-subarrays-equal]
[3507-minimum-pair-removal-to-sort-array-i]
[3508-implement-router]
[3509-maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k]
[3510-minimum-pair-removal-to-sort-array-ii]