July 2020
Intermediate to advanced
360 pages
7h 8m
English

39.1Constraints
⊳The input is a sequence of items, and the output depends on certain patterns in that sequence.
⊳The input is reshaped as a sequence of concatenations of N items in the original sequence, where N is large enough to be able to capture the pattern.
⊳The concatenations are created by sliding through the input sequence, with a step of S, depending on the problem at hand.
39.2A Program in This Style

39.3Commentary
THE PROBLEM of eliminating single-letter words from the input stream does not ...
Read now
Unlock full access