Posts tagged Algorithm
Subset Recurrence
A bitmask recurrence over subsets for the minimum number of groups.
Ceiling Division
Replacing a conditional ceiling division with (x+m-1)/m.
Bigginer 292 - E
Proving the solution to AtCoder ABC 292 E Transitivity
News Clustering Takeaways (kakao 2018)
Bit tricks and indexing techniques learned from the news clustering problem.
Candidate Key Takeaways (2019 kakao)
Bitmask combinations and a string-key pitfall learned from the candidate key problem.
2021 KAKAO BLIND RECRUITMENT
Points I missed and tips to remember from the 2021 Kakao blind coding test problems.
Shortest Paths in a Graph with Multiple Start Nodes
Pushing all start nodes into Dijkstra's queue at once to get the multi-source shortest path.
Optimizing Many Updates on a 2D Array
How to handle many range updates on a 2D array in O(NM).
G4 Binary Search Problem Notes
A list of Gold 4 binary search problems, starting with Baekjoon 2110.
Gold 5 Binary Search Problem Patterns
Binary search approaches for Baekjoon Gold 5 problems 3020 and 3079.
Implementing Binary Search Without Mistakes
A pointer to a Baekjoon blog post on implementing binary search without confusion.
Problems to Review
Two Programmers SQL problems saved to review later.
S1 Greedy Problems
Solution ideas for Baekjoon Silver 1 greedy problems.
Tips for Calculating Time Complexity with Divisor Counts
Bounding the time complexity of a nested loop that runs once per divisor.
Time Complexities That Are Tricky to Prove
Proving with integrals that a harmonic-series-style nested loop is O(e log e).