Daily

Today is solid, good, not hard DP problem. Love it. Go and collect the point.

https://leetcode.com/problems/taking-maximum-energy-from-the-mystic-dungeon/description/?envType=daily-question&envId=2025-10-10

#daily #medium

Daily

Today is free problem, basically the yesterday daily's solution will work (with little adjustment)

https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/description/?envType=daily-question&envId=2025-10-15

#daily #medium

Daily

Daily is not the easiest one, a lot of edge cases, and requires pretty deep analysis of the problem.

https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/description/?envType=daily-question&envId=2025-10-16

#daily #medium

Daily

Today's daily is not that hard, but for me it was hard to come up with optimized solution, so I had to look it up

https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/description/?envType=daily-question&envId=2025-10-18

#daily #medium

Daily,

Average, but pay attention to constraints, dont come up with “clever solution”


https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/description/?envType=daily-question&envId=2025-10-19

#daily #medium

Daily

Not bad problem. The thing is that bruteforce will work as the constraint is 10^6.

https://leetcode.com/problems/next-greater-numerically-balanced-number/description/?envType=daily-question&envId=2025-10-24

#daily #medium

Daily

OMG, absolutely love it. This amazing feeling to implement something close to real world.
Not sure how come this is medium, typically, the concurrency knowledge is something that is getting checked in "bank" related algo/oop questions, but in leetcode it is not.



https://leetcode.com/problems/simple-bank-system/description/?envType=daily-question&envId=2025-10-26

#daily #medium

Daily

Should be easy IMO.

https://leetcode.com/problems/number-of-laser-beams-in-a-bank/submissions/1813045010/?envType=daily-question&envId=2025-10-27

#daily, #medium

Daily

It was a long time without linked list and here we go. Actuallly an easy problem, go and collect the coin.

https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/description/?envType=daily-question&envId=2025-11-01

#daily #medium

Daily

Actually pretty satisfying problem. Enjoyed, and it is not hard at all.

https://leetcode.com/problems/count-unguarded-cells-in-the-grid/description/?envType=daily-question&envId=2025-11-02

#daily #medium

Daily

Pretty nice problem, and not hard

https://leetcode.com/problems/minimum-time-to-make-rope-colorful/description/?envType=daily-question&envId=2025-11-03

#daily #medium

Daily

Today is graph problem. I love graph problems. But it requires again a bit of coding, and a bit of graph algo's knowledge.

https://leetcode.com/problems/power-grid-maintenance/description/?envType=daily-question&envId=2025-11-06

#daily #medium

Daily

Mid, but it is close to hard I would say for building an intuition

https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/description/?envType=daily-question&envId=2025-11-10

#daily #medium

Daily

Eventually, good old DP problem, love it.

https://leetcode.com/problems/ones-and-zeroes/description/?envType=daily-question&envId=2025-11-11

#daily #medium

Daily

Not that bad, but a bit bullshit. It takes a bit long to build an intuition (I will leave hint for that in comments)

https://leetcode.com/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/description/?envType=daily-question&envId=2025-11-12

#daily #medium

Daily

Not hard, not bad, greedy problem.

https://leetcode.com/problems/maximum-number-of-operations-to-move-ones-to-the-end/description/?envType=daily-question&envId=2025-11-13

#daily #medium