Maximum Sum Subarray of Size K in Java
Maximum Sum Subarray of Size K is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the core...
Technical Blog
Recent posts
Longest Substring With Exactly K Unique Characters in Java
Longest Substring With Exactly K Unique Characters is a good example of turning a small-looking problem into a precise invariant. The cleaned-up Java version...
Longest Subarray With Sum K in Java
Longest Subarray With Sum K is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the core id...
First Negative in Window of Size K in Java
First Negative in Window of Size K is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the ...
Find All Anagrams in a String in Java
Find All Anagrams in a String is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the core ...