Coding Interview
Why is Binary Search O(log n)?
Jason Yang · 02 Dec, 2025
Binary Search runs in O(log n) because it halves the search space every step. Here's the intuition, the math proof, and how it compares to linear search.
Blog posts — page 35
Coding Interview
153. Find Minimum in Rotated Sorted Array
Jason Yang · 02 Dec, 2025
Find Minimum in Rotated Sorted Array (LeetCode 153): the O(log n) binary search that locates the rotation pivot, explained step by step with examples.
Programming Language
Adding a gRPC Endpoint to order-service: A Practical Guide
Jason Yang · 02 Dec, 2025
Add a gRPC endpoint to a Spring Boot order-service: define .proto files, generate stubs, implement the RPC logic, and expose a new CreateOrder API.
Coding Interview
Dynamic Programming Explained: The Missing Link with Divide & Conquer
Jason Yang · 01 Dec, 2025
Dynamic Programming demystified: at its core, DP is just Divide and Conquer plus memory. See the connection and it gets far easier to explain in interviews.
Coding Interview
152. Maximum Product Subarray
Jason Yang · 01 Dec, 2025
Maximum Product Subarray (LeetCode 152): why you track max and min together to handle negatives and zeros, and the O(n) dynamic-programming solution.