# 17.11.2025
[1437. Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description) easy
All ones k-distant #easy
[1437. Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/description) easy
All ones k-distant #easy
👍1
# 18.11.2025
[717. 1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/description/) easy
Is '0' last from characters '0','10','11' concatenation #easy
[717. 1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/description/) easy
Is '0' last from characters '0','10','11' concatenation #easy
👍1
# 19.11.2025
[2154. Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/) easy
First
[2154. Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/) easy
First
original=original*2 not in array #easy👍1
# 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
# 21.11.2025
[1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/description/) medium
3-palindroms subsequences #medium
[1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/description/) medium
3-palindroms subsequences #medium
👍1
# 22.11.2025
[3190. Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three) easy
Min steps inc/dec to make %3 #easy
[3190. Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three) easy
Min steps inc/dec to make %3 #easy
👍1
# 23.10.2025
[1262. Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/description/) medium
Max sum that %3 #medium
[1262. Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/description/) medium
Max sum that %3 #medium
👍1
# 24.11.2025
[1018. Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/description/) easy
Prefixes divisible by 5 #easy #brainteaser
[1018. Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/description/) easy
Prefixes divisible by 5 #easy #brainteaser
👍1
# 25.11.2025
[1015. Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/description) medium
Smallest number 11..1 % k #medium
[1015. Smallest Integer Divisible by K](https://leetcode.com/problems/smallest-integer-divisible-by-k/description) medium
Smallest number 11..1 % k #medium
👍2
# 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👍1
# 27.11.2025
[3381. Maximum Subarray Sum With Length Divisible by K](https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/description/) medium
Max sum of %k-length subarray #medium
[3381. Maximum Subarray Sum With Length Divisible by K](https://leetcode.com/problems/maximum-subarray-sum-with-length-divisible-by-k/description/) medium
Max sum of %k-length subarray #medium
👍1
# 28.11.2025
[2872. Maximum Number of K-Divisible Components](https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/) hard
Max cuts where every subtree sum %k #hard #dfs
[2872. Maximum Number of K-Divisible Components](https://leetcode.com/problems/maximum-number-of-k-divisible-components/description/) hard
Max cuts where every subtree sum %k #hard #dfs
👍1