Combinatorics Contribution Method¶
Table of Contents¶
- 2063. Vowels of All Substrings (Medium)
- 1588. Sum of All Odd Length Subarrays (Easy)
- 2681. Power of Heroes (Hard)
- 891. Sum of Subsequence Widths (Hard)
- 3428. Maximum and Minimum Sums of at Most Size K Subsequences (Medium)
- 3426. Manhattan Distances of All Arrangements of Pieces (Hard)
- 2763. Sum of Imbalance Numbers of All Subarrays (Hard)
- 979. Distribute Coins in Binary Tree (Medium)
- 2477. Minimum Fuel Cost to Report to the Capital (Medium)
2063. Vowels of All Substrings¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: math, string, dynamic programming, combinatorics
1588. Sum of All Odd Length Subarrays¶
-
LeetCode | LeetCode CH (Easy)
-
Tags: array, math, prefix sum
2681. Power of Heroes¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, dynamic programming, sorting, prefix sum
891. Sum of Subsequence Widths¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, sorting
3428. Maximum and Minimum Sums of at Most Size K Subsequences¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, math, dynamic programming, sorting, combinatorics
3426. Manhattan Distances of All Arrangements of Pieces¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: math, combinatorics
2763. Sum of Imbalance Numbers of All Subarrays¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, ordered set
979. Distribute Coins in Binary Tree¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: tree, depth first search, binary tree
2477. Minimum Fuel Cost to Report to the Capital¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: tree, depth first search, breadth first search, graph