CS Theory

LSM Tree

LSM Tree technology overview covering mutable and immutable data structures optimization for sequential disk reads. Explains SSTable concepts immutable file systems and performance benefits of append only operations in database storage systems.

January 27, 2026

Raft Consensus Algorithm

The Raft consensus algorithm addresses data consistency issues in distributed environments with multiple replicas. It achieves multi-replica consistency through leader election and log replication management by the elected leader node, ensuring reliable distributed system operations.

January 27, 2026

Deep Understanding of Computer Systems Notes

Comprehensive technical notes covering computer systems fundamentals including encoding methods data types exception control flow virtual memory management process communication and system I/O concepts from a systems programming perspective.

January 26, 2026

Computer Network

Computer Network

A series of notes on computer network-related topics.

March 12, 2020

Go Basics Tutorial

Go Basics Tutorial

A series of notes on Go language fundamentals and core features

March 12, 2020

Operating System

Operating System

A series of notes on operating system-related topics.

March 12, 2020

POJ 3616 Milking Time

Solution to POJ problem 3616 Milking Time using weighted interval DP approach. The algorithm sorts intervals by start time and uses dynamic programming to find maximum efficiency while considering rest periods between milking sessions.

July 29, 2018

POJ 2385 Apple Catching 0ms Solution

Detailed solution and explanation for POJ 2385 Apple Catching problem using dynamic programming with 0ms execution time. Complete C++ code implementation with optimization techniques.

July 14, 2018

POJ 2229 Sumsets

Solution to POJ problem 2229 Sumsets using dynamic programming approach. The algorithm calculates the number of ways to represent a number as sums of powers of 2 with optimized time complexity through pattern recognition and modular arithmetic.

July 12, 2018

POJ 3176 Cow Bowling

Solution to POJ 3176 Cow Bowling problem using dynamic programming approach. This classic DP problem involves finding the maximum sum path in a triangular number array by moving from top to bottom with specific movement rules.

July 11, 2018