DMITRII’s Substack

DMITRII’s Substack

Home
Archive
About
# 11.07.2025 [2402. Meeting Rooms III]
Most frequent meeting room #hard #heap
 • 
DMITRII SAMOILENKO
# 10.07.2025 [3440. Reschedule Meetings for Maximum Free Time II]
Max free time after moving 1 event #medium #sorting
 • 
DMITRII SAMOILENKO
# 9.07.2025 [3439. Reschedule Meetings for Maximum Free Time I]
Max free time after moving k events together #medium #sliding_window
 • 
DMITRII SAMOILENKO
# 8.07.2025 [1751. Maximum Number of Events That Can Be Attended II]
Max top k valued intervals #hard #binary_search #dp
 • 
DMITRII SAMOILENKO
# 7.07.2025 [1353. Maximum Number of Events That Can Be Attended]
Max attended events #medium #heap
 • 
DMITRII SAMOILENKO
# 6.07.2025 [1865. Finding Pairs With a Certain Sum]
Design pairs counter; two lists, one changes #medium #hashmap
 • 
DMITRII SAMOILENKO
# 5.07.2025 [1394. Find Lucky Integer in an Array]
The most brute-force is O(n^2), the fastest is O(n) and O(1) memory.
 • 
DMITRII SAMOILENKO
# 4.07.2025 [3307. Find the K-th Character in String Game II]
kth char in double+shift by ops[i] string #hard #bit_manipulation
 • 
DMITRII SAMOILENKO
# 3.07.2025 [3304. Find the K-th Character in String Game I]
`k`th char after appending rotated self #easy
 • 
DMITRII SAMOILENKO
# 2.07.2025 [3333. Find the Original Typed String II]
ways to remove duplicates, preserve length at least k #hard #dp
 • 
DMITRII SAMOILENKO
# 30.06.2025 [594. Longest Harmonious Subsequence]
Longest subsequence with max-min=1 #easy #counting #sort #two_pointers
 • 
DMITRII SAMOILENKO

June 2025

© 2025 DMITRII SAMOILENKO
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture