AlgorithmsBinary search and variations: lower bound, rotated array, answer search
Implement binary search correctly on the first try and apply variations for lower/upper bound, rotated array, and answer search using Java 21.
HashMap Solutions for Counting Problems in Java
Use HashMap to count frequencies, find the most common element, count pairs, and group anagrams — with complexity and common pitfalls.
Big-O Through Code Examples: Understanding Algorithm Complexity
Explaining Big-O with concrete Java code examples, from O(1) to O(2^n), helping you read code and guess its complexity instantly.
Two Pointers and Sliding Window: Optimizing Arrays and Strings
Learn two pointers and sliding window techniques to solve array/string problems with O(n) complexity, with runnable Java examples.