Why the faster version is faster

• A

  Scanning every earlier element, by keeping only the smallest tail for each length

• B

  Filling in a table at all, because the method works without any dynamic programming involved

• C

  Comparing values, because binary search compares indices instead

• D

  Storing lengths, because the answer is read from the input directly