# 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
This media is not supported in your browser
VIEW IN TELEGRAM
# 13.10.2025
[2273. Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/description) medium
Dedup anagrams #easy
[2273. Find Resultant Array After Removing Anagrams](https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/description) medium
Dedup anagrams #easy
👍2
# 14.10.2025
[3349. Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/description) medium
Any increasing consequent windows size k #easy
[3349. Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/description) medium
Any increasing consequent windows size k #easy
👍1
This media is not supported in your browser
VIEW IN TELEGRAM
# 15.10.2025
[3350. Adjacent Increasing Subarrays Detection II](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/description/) medium
Max k of adjucent increasing k-windows #medium #counting
[3350. Adjacent Increasing Subarrays Detection II](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/description/) medium
Max k of adjucent increasing k-windows #medium #counting
👍1
This media is not supported in your browser
VIEW IN TELEGRAM
# 16.10.2025
[2598. Smallest Missing Non-negative Integer After Operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/description/) medium
First positive number can't be build by adding/subtracting value #medium #hashmap
[2598. Smallest Missing Non-negative Integer After Operations](https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/description/) medium
First positive number can't be build by adding/subtracting value #medium #hashmap
👍2
# 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
# 18.10.2025
[3397. Maximum Number of Distinct Elements After Operations](https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/description) medium
Distincts count after adding -k..k to each #medium
[3397. Maximum Number of Distinct Elements After Operations](https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/description) medium
Distincts count after adding -k..k to each #medium
👍3
This media is not supported in your browser
VIEW IN TELEGRAM
# 19.10.2025
[1625. Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/description) medium
Min string after shifting by b and rotating odd indice by a #medium #bruteforce
[1625. Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/description) medium
Min string after shifting by b and rotating odd indice by a #medium #bruteforce
👍2
# 20.10.2025
[2011. Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/description) easy
do ++ or -- operation from 0 #easy
[2011. Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/description) easy
do ++ or -- operation from 0 #easy
👍2
# 21.10.2025
[3346. Maximum Frequency of an Element After Performing Operations I](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/description) medium
Max frequency after changing +k..-k ops elements #medium #sliding_window
[3346. Maximum Frequency of an Element After Performing Operations I](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i/description) medium
Max frequency after changing +k..-k ops elements #medium #sliding_window
👍2
This media is not supported in your browser
VIEW IN TELEGRAM
# 22.10.2025
[3347. Maximum Frequency of an Element After Performing Operations II](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/description) hard
Max frequency after changing +k..-k ops elements #medium #sliding_window
[3347. Maximum Frequency of an Element After Performing Operations II](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/description) hard
Max frequency after changing +k..-k ops elements #medium #sliding_window
👍3
This media is not supported in your browser
VIEW IN TELEGRAM
# 23.10.2025
[3461. Check If Digits Are Equal in String After Operations I](https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/description/) easy
Fold each pair to (a+b)%10 until 2 left #easy
[3461. Check If Digits Are Equal in String After Operations I](https://leetcode.com/problems/check-if-digits-are-equal-in-string-after-operations-i/description/) easy
Fold each pair to (a+b)%10 until 2 left #easy
👍1