Creating - no, but using, and be pretty proficient with ai workflows, know skills, rules, specbased - definitely yes, without exclusion. It is everywhere.
I personally dont write code, full vibe code + review.
I dont even open pr in git, ai does it.

1 year, and 2 days ago 😎

I think maybe I should push for 1k, just to flex even more😆😆😆

Daily (290/373 streak until LC cap)

Pretty easy, go for it.

https://leetcode.com/problems/count-the-number-of-special-characters-i/description/?envType=daily-question&envId=2026-05-26

#daily #easy #pattern

I remember, I was fake senior at Epam already, at 20. My uni friends decided to go for university olympiad algos contest. They also are seniors as well (it was gold era in Ukraine for swe)

Some 13-15 years old kids were also participating…

It was similar experience to first sparring with Candidate for Master of Sports when I started doing boxing.

These kids fucked us up soooo hard. They have completed 5 problems, by the time we had solved one and had been on our way to solve the second😆😆😆

After this, my ego got deep trauma I realised, it is not my thing, so my peak is some average hard leetcode problem with 40+ acceptance. This is peak. I am still pretty bad at it to be honest.

Daily (291/373 streak until LC cap)

not bad daily, not hard, just regular medium

https://leetcode.com/problems/count-the-number-of-special-characters-ii/description/?envType=daily-question&envId=2026-05-27

#daily #medium

https://www.snowflake.com/en/news/press-releases/snowflake-expands-aws-collaboration-with-6b-commitment-to-accelerate-enterprise-agentic-ai-adoption/


My guess, but I am way too incompetent in stock market dynamics and laws..

Joking. Of course this is because I stayed late nights, learned all the cryptography for one project and educated people about it so no one makes mistakes.

Daily (292/373 streak until LC cap)

Amazing problem, it is not hard actually, I would rate as mid. I had this leetcode pattern in my real interview for big tech, therefore highly recommended.

https://leetcode.com/problems/longest-common-suffix-queries/?envType=daily-question&envId=2026-05-30

#daily #hard #pattern #recommend

Daily (293/373 streak until LC cap)

Easy problem, easy day.

https://leetcode.com/problems/minimum-element-after-replacement-with-digit-sum/description/?envType=daily-question&envId=2026-05-30

#daily #easy #nopattern

Daily (294/373 streak until LC cap)

(Still unsolved, this is for tomorrow)
18% of acceptance, Uber asked it, it is segment tree....

If you are asked segment tree during the interview, probably the role is going to be hard and your interviewer is crazy tough on algos.

Will solve tomorrow, but don't waste time, I think it is better to reject company that asks you segment tree

https://leetcode.com/problems/block-placement-queries/description/?envType=daily-question&envId=2026-05-30

#daily #hard #pattern

Sorry I disappeared and didn't post daily for couple of days as I was working till 1-2AM for Snow. Will tell you more soon, but yeah, not that happy about that.

I will post about Segment tree and Fenwick tree + simple problems for them so that you all have the pattern under you hand to recall it quickly before the interview.

Don't think segment trees are complicated - therefore they are not asked during the real interview, they actually ARE asked, on jun/mid position in big tech (I know it was asked in Databricks)

He brought a friend😆😆

Now I need to provide for them apparently. I guess I need to push for promotion..

Daily (295/373 streak until LC cap)

Actually it is easy question, I don't know why it is labeled as medium. Go for it.

https://leetcode.com/problems/destroying-asteroids/description/?envType=daily-question&envId=2026-05-31

#daily #medium #nopattern

Heap.

As first prerequisite to understand the "array-based" representation of the trees -> we can check heap data structure.

Heap is used to efficiently get minimum (minheap) or maximum (maxheap) element.

You can do it just with plain array: insert all new items, and scan array to find the minimum with O(n) but heap allows O(log(n)) for both insert and findmin() operations.

It can be used as priority queue, in python it is implemented via heapq.
One of the applications can be Dijkstra algorithm that is using priority queue under hood.

In the comments we will discuss different implementations and tree representations.

#leetcode #heap #datastructures

Daily (296/373 streak until LC cap)

Easy, greedy problem

https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/description/?envType=daily-question&envId=2026-06-01

#daily #easy #nopattern

Guys, it is last month probably +- few days

Completed daily month streak = 50
Everyday check in: 1 * 30
Everyday daily: 10 * 30
Every week contest button: 5 * 10

50 + 30 + 300 + 50 = 430