Leetcode_daily
Открыть в Telegram
Don't miss a day to solve the problem My leetcode graph - https://leetcode.com/SamoylenkoDmitry/
Больше1 662
Подписчики
Нет данных24 часа
+107 дней
-630 день
Архив постов
1 660
# 14.06.2026
2130. Maximum Twin Sum of a Linked List
medium
Max sum pairwise from tail
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/218om3UJuZI
1 660
# 13.06.2026
3838. Weighted Word Mapping
easy
Convert words to chars by weighting their sums and reversing
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/asQKj_XI-y8
1 660
# 12.06.2026
3559. Number of Ways to Assign Edge Weights II
hard
Ways to color the all queries paths a..b in tree
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/EwfsrTTu_NU
1 660
# 11.06.2026
3558. Number of Ways to Assign Edge Weights I
medium
Ways to color the deepest path in tree
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/jWSiyPJdCcU
1 660
# 10.06.2026
3691. Maximum Total Subarray Value II
hard
sum k largest ranges max(l..r)-min(l..r)
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/1YRY30jcew4
1 660
fun pivotArray(n: IntArray, p: Int) =
n.sortedBy { (it-p).sign }
this can't be done in-place in O(n)
1 660
fun createBinaryTree(d: Array<IntArray>): TreeNode? {
val m = HashMap<Int, TreeNode>(); val hasParent = HashSet<Int>()
for ((p,c,l) in d) {
val pn = m.getOrPut(p) {TreeNode(p)}
val cn = m.getOrPut(c) {TreeNode(c)}
if (l>0) pn.left = cn else pn.right = cn
hasParent += c
}
return m[d.first { (p,c,l) -> p !in hasParent }[0]]
}
no posts today, i'm traveling
1 660
# 06.06.2026
2574. Left and Right Sum Differences
easy
abs(prefix sum - suffix sum)
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/SuQyVx0VcSE
1 660
# 05.06.2026
3753. Total Waviness of Numbers in Range II
hard
Count hills and valleys base10 in a..b
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/G5IQBvlhUsw
1 660
# 04.06.2026
3751. Total Waviness of Numbers in Range I
medium
Count hills and valleys base10 in a..b
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/_mxzQ39Vwwo
1 660
# 03.06.2026
3635. Earliest Finish Time for Land and Water Rides II
medium
Min finish time of land + water single events
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/ctbEphoD83c
1 660
# 02.06.2026
3633. Earliest Finish Time for Land and Water Rides I
easy
Min finish time of land + water single events
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/QOgbGrliyAw
1 660
# 01.06.2026
2144. Minimum Cost of Buying Candies With Discount
easy
Min sum taking 2 out of 3
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/vDQlS-53V2Y
1 660
# 31.05.2026
2126. Destroying Asteroids
medium
Can consume all asteroids smaller than running sum?
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/QTn773sIRmQ
1 660
# 30.05.2026
3161. Block Placement Queries
hard
Queries 'can place a gap after place an obstacle'
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/RxfxXaQ3IRM
1 660
# 29.05.2026
3300. Minimum Element After Replacement With Digit Sum
easy
Min of digits sum
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/FfOi6aizg2c
1 660
# 28.05.2026
3093. Longest Common Suffix Queries
hard
Query common suffixes match
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/AiPXs-7kVkI
1 660
# 27.05.2026
3121. Count the Number of Special Characters II
medium
Count sorted characters
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/Ngzq2yMD4ZY
1 660
# 26.05.2026
3120. Count the Number of Special Characters I
easy
Count letters with both cases
blog: https://dmitrysamoylenko.com/leetcode/
youtube: https://youtu.be/1qIg9iPsFYo
Уже доступно! Исследование Telegram 2025 — ключевые инсайты года 
