At most K and exactly K

Kestrel Stream needs the longest session that touches at most two categories, and the number of sessions that touch exactly two. The first attempt extends from every start and needs about a trillion steps on the worst night. One window that only moves forward finds the longest in O(n), adding right minus left plus one counts every valid session, and exactly K is at most K minus at most K minus 1.