This media is not supported in your browser
VIEW IN TELEGRAM
# 06.10.2025
[778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/description) hard
Min time to swim to end, flooding every second #hard #bfs
[778. Swim in Rising Water](https://leetcode.com/problems/swim-in-rising-water/description) hard
Min time to swim to end, flooding every second #hard #bfs
👍1
# 05.10.2025
[3539. Find Sum of Array Product of Magical Sequences](https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/description/) medium
Product of all
[3539. Find Sum of Array Product of Magical Sequences](https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/description/) medium
Product of all
good subsequences and permutations #hard #combinatorics👍1
# 05.10.2025
[3003. Maximize the Number of Partitions After Operations](https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/) medium
Max k-uniq parts after changing one letter #hard #prefix
[3003. Maximize the Number of Partitions After Operations](https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/) medium
Max k-uniq parts after changing one letter #hard #prefix
👍2
# 30.10.2025
[1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description) hard
Min +1 range increases to make target from zeros #hard
[1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description) hard
Min +1 range increases to make target from zeros #hard
👍2
# 05.11.2025
[3321. Find X-Sum of All K-Long Subarrays II](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/description/) hard
Sums of x most frequent from k-windows #hard
[3321. Find X-Sum of All K-Long Subarrays II](https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/description/) hard
Sums of x most frequent from k-windows #hard
👍1
# 07.11.2025
[2528. Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city/description) hard
Max min r-range sum after adding total of k #hard #bs #sliding_window
[2528. Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city/description) hard
Max min r-range sum after adding total of k #hard #bs #sliding_window
👍1
# 08.11.2025
[1611. Minimum One Bit Operations to Make Integers Zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/description) hard
Min steps to make zero by xor 1 or xor rightmost+1 #hard #bits
[1611. Minimum One Bit Operations to Make Integers Zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/description) hard
Min steps to make zero by xor 1 or xor rightmost+1 #hard #bits
👍2
# 20.11.2025
[757. Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/description) hard
Min set each interval have two values in it #hard #sorting
[757. Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/description) hard
Min set each interval have two values in it #hard #sorting
👍1
# 26.11.2025
[2435. Paths in Matrix Whose Sum Is Divisible by K](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/description/) hard
Paths in 2D matrix %k #hard
[2435. Paths in Matrix Whose Sum Is Divisible by K](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/description/) hard
Paths in 2D matrix %k #hard
👍1