Today let's stream in the evening again (Leetcode).

Something like 19:30 UTC+0. Not long, just 3-4 questions and go sleep. Recording will be there

The results:
7th and 3d are top ones. So I would just choose the one with greater amount of likes.

Soon everything will be updated with that one.

Thank you for participation! Your vote matters, we have democracy here (with a little bit of tyranny😁)

In 10 mins

Go and join, I will explain my VIM OS-wide setup of keyboard with visuals (in the beginning)

3/16

https://www.youtube.com/live/xKkCuxJJx78?is=BoA1PRjNUCNnNnKQ

#leetcode #stream

Daily 380th day streak

Good problem, has pattern, was a bit hard to build intuition about, but definitely good one.

https://leetcode.com/problems/stone-game-viii/?envType=daily-question&envId=2026-08-24

#daily #hard #pattern

So folks, this marathon is due to mid of Sep +-. I want to see how far I can get in case I need to in 2-3 weeks.

Ideal form, is that I'm solving any problem from list in 40-50 minutes e2e as I advice usually, interview style performance.

Good example of either eventual consistency, but 2 different storages OR poll is linearizable (or anything above eventual consistency, while read count is eventually consistent).

Distributed Systems are everywhere

Daily 381st day streak

Easy one, 1 min coding, no pattern though.

https://leetcode.com/problems/smallest-missing-multiple-of-k/description/?envType=daily-question&envId=2026-08-25

#daily #easy #nopattern

Streaming today?) something like 20:30 utc+1 if I dont get dizzy after gym.
6 problems from leetcode must be solved

13 days of marathon left

20 mins and go

4/16

https://www.youtube.com/live/WqOi2kwla6Q?is=_w4VlkBsaVa2vgSN

#leetcode #stream

Daily 382nd day streak

This problem has happened to me one year ago as daily challenge.

Somehow it feels like ugly problem/solution to me, I just don't like it. It looks like hack and feels like hack.

https://leetcode.com/problems/shortest-and-lexicographically-smallest-beautiful-string/description/?envType=daily-question&envId=2026-08-26

#daily #medium #pattern

Nature representation of market monopoly😁

Thats why you rarely see small businesses (pigeons) in Dublin

Well well well. So I am again looking for new country?

I would be okay with waiting till citizenship even for 10-15 years in Ireland as I really like country and people here, but it is not easy/or even not possible to renew passport for some men from Ukraine.

Fucking shit. Gov didn’t accept this as part of the law yet, but overall - can be very bad sign for me. Cause I wouldn’t fit 8 years window. And then Idk, Argentina probably is the next station😅 or international refugee living in the tent.

Thanks folks, unexpectedly many people helped with some info about that, thank you❤️

Today, something like 20:30 UTC+1 - stream marathon again.

In the beginning we will solve problem that was really asked in one big tech company recently (somebody has shared with me)

10 mins

5/16

https://www.youtube.com/live/lGO5Wjy18bw?is=3ynvfnAG4RybpFN-

#leetcode #stream

For those who are on the stream:

https://algo.monster/liteproblems/2534

from collections import deque

def time_taken_to_cross_the_door(arrival: list[int], state: list[int]) -> list[int]:
    entering = deque()
    exiting = deque()
    doorstate = 0
    
    t = arrival[0]
    person = 0
    res = [0] * len(arrival)
    while person < len(arrival) or entering or exiting:
        if person < len(arrival) and t < arrival[person] and len(entering) == len(exiting) == 0:
            t = arrival[person]
            doorstate = 0
            continue
        elif person < len(arrival) and t == arrival[person]:
            while person < len(arrival) and arrival[person] == t:
                if state[person] == 1:
                    exiting.append(person)
                else:
                    entering.append(person)
                person += 1
        
        competitive = len(entering) > 0 and len(exiting) > 0
        
        if not competitive:
            if entering:
                res[entering.popleft()] = t
                doorstate = 1   
            else:
                res[exiting.popleft()] = t
                doorstate = 2
        else:
            if doorstate == 0 or doorstate == 2:
                p = exiting.popleft()
                res[p] = t
                doorstate = 2
            elif doorstate == 1:
                p = entering.popleft()
                res[p] = t
                doorstate = 1            
                    
        t += 1
    
    return res

if __name__ == "__main__":
    arrival = [int(x) for x in input().split()]
    state = [int(x) for x in input().split()]
    res = time_taken_to_cross_the_door(arrival, state)
    print(" ".join(map(str, res)))