Daily
Today is trash problem, don't even fucking spend your time on it
https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/description/?envType=daily-question&envId=2025-10-12
#daily #hard #trash
Today is trash problem, don't even fucking spend your time on it
https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/description/?envType=daily-question&envId=2025-10-12
#daily #hard #trash
Daily
hard one, a bit nonsense but not that much
https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/description/?envType=daily-question&envId=2025-10-17
#daily #hard
hard one, a bit nonsense but not that much
https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/description/?envType=daily-question&envId=2025-10-17
#daily #hard
Daily
Same daily as yesterday, but with bigger constraints (yesterday's solution does not pass memory limit xD)
https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/description/?envType=daily-question&envId=2025-10-22
#daily #hard
Same daily as yesterday, but with bigger constraints (yesterday's solution does not pass memory limit xD)
https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii/description/?envType=daily-question&envId=2025-10-22
#daily #hard
Daily
Was not able to come up with the idea, which was very simple. Once you get it - it is not hard problem anymore
https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description/?envType=daily-question&envId=2025-10-30
#daily #hard
Was not able to come up with the idea, which was very simple. Once you get it - it is not hard problem anymore
https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description/?envType=daily-question&envId=2025-10-30
#daily #hard
❤3
Daily
Pretty hard, and cumbersome, so you gonna write decent amnt of code today(
https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/description/?envType=daily-question&envId=2025-11-05
#daily #hard
Pretty hard, and cumbersome, so you gonna write decent amnt of code today(
https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/description/?envType=daily-question&envId=2025-11-05
#daily #hard
🔥1
Daily
Pretty hard IMO, didn't like question much, however I would not say it is bullshit, it is quite good, just that hard for me.
https://leetcode.com/problems/maximize-the-minimum-powered-city/?envType=daily-question&envId=2025-11-07
#daily #hard
Pretty hard IMO, didn't like question much, however I would not say it is bullshit, it is quite good, just that hard for me.
https://leetcode.com/problems/maximize-the-minimum-powered-city/?envType=daily-question&envId=2025-11-07
#daily #hard
Daily
nono, fuck it, when the problem needs some fucking "Gray Code" knowledge, this is bye bye. Bullshit question, don't waste time.
https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/solutions/7333658/bit-manipulation-gray-code-logic-python-kwkii/?envType=daily-question&envId=2025-11-08
#dailly #hard
nono, fuck it, when the problem needs some fucking "Gray Code" knowledge, this is bye bye. Bullshit question, don't waste time.
https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/solutions/7333658/bit-manipulation-gray-code-logic-python-kwkii/?envType=daily-question&envId=2025-11-08
#dailly #hard
👍3
Daily
Greedy problem. Hard to be honest, I wouldn't be able to come up with the solution. Intuition is not intuitive at all.
A bit bullshit problem, but I can see a bit of real application - so alright.
The problem that typically greedy problems require some specific intuition applied out of nowhere, and they don't have some well known pattern like DP or two pointers, etc.
https://leetcode.com/problems/set-intersection-size-at-least-two/?envType=daily-question&envId=2025-11-20
#daily #hard
Greedy problem. Hard to be honest, I wouldn't be able to come up with the solution. Intuition is not intuitive at all.
A bit bullshit problem, but I can see a bit of real application - so alright.
The problem that typically greedy problems require some specific intuition applied out of nowhere, and they don't have some well known pattern like DP or two pointers, etc.
https://leetcode.com/problems/set-intersection-size-at-least-two/?envType=daily-question&envId=2025-11-20
#daily #hard
👍3