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
Was playing with postgres, and I was under impression that it uses MVCC, and that's why it does not need pessimistic locking, as it is checking that version is still the same.
Outcome: all 3 isolation levels: read committed, snapshot(aka repeatable read) and serializable are locking simple CAS (compare and swap)
Outcome: all 3 isolation levels: read committed, snapshot(aka repeatable read) and serializable are locking simple CAS (compare and swap)
🔥1
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
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
🔥1
A bit of leetrooms today, to keep the skill up.
One nice problem:
https://leetcode.com/problems/sum-of-matrix-after-queries/description/
To not burn your ass you need to know that you can afford only one for loop over the queries. Inside that for loop you cannot iterate over rows or cols.
One nice problem:
https://leetcode.com/problems/sum-of-matrix-after-queries/description/
To not burn your ass you need to know that you can afford only one for loop over the queries. Inside that for loop you cannot iterate over rows or cols.
👍1
andreyka26_se
Video
In the ticketmaster we gonna design at some point, this shit will not exist!!
I actually can assume architectural decision to make it work per location, but maybe I'm wrong
I actually can assume architectural decision to make it work per location, but maybe I'm wrong
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
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
👍3🔥1
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
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
🔥2👍1
Daily
Idk, for some reason took me very long time to figure out what is needed in this q.
https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/description/?envType=daily-question&envId=2025-11-04
#daily #easy
Idk, for some reason took me very long time to figure out what is needed in this q.
https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-i/description/?envType=daily-question&envId=2025-11-04
#daily #easy
❤1
andreyka26_se
- O(log n) for search (including index search)
- O(log n) for insert
- O(log n) for deletion by index
This DS is called SortedList
- O(log n) for insert
- O(log n) for deletion by index
This DS is called SortedList
You'll need this for today's daily))))
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
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
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
👍2