Coding Interview
53. Maximum Subarray
Jason Yang · 29 Nov, 2025
Maximum Subarray (LeetCode 53): Kadane's algorithm explained as one decision — extend or restart — plus the O(n) to O(1) space drop and a full worked trace.
Coding Interview
Jason Yang · 29 Nov, 2025
Maximum Subarray (LeetCode 53): Kadane's algorithm explained as one decision — extend or restart — plus the O(n) to O(1) space drop and a full worked trace.
Programming Language
Jason Yang · 29 Nov, 2025
Exception logging in Java done right: catch errors in the correct layer, log them once, and keep clear context — practical patterns for real systems.
Programming Language
Jason Yang · 29 Nov, 2025
Design effective custom exceptions in Java: structure them well, separate business and system errors, and integrate cleanly with Spring Boot error handling.
Programming Language
Jason Yang · 28 Nov, 2025
Why real Spring Boot developers prefer unchecked exceptions over the textbook rules — modern exception-handling patterns for clean, maintainable service code.
Coding Interview
Jason Yang · 28 Nov, 2025
Product of Array Except Self (LeetCode 238): the prefix and suffix product trick that avoids division for an O(n) solution, with an interactive visual.