The questions for Pure Storage OA 2020 have been updated. All the multiple-choice questions have been renumbered, so please review them carefully before starting.
The second coding question is different:
You are given a short string short_s and a long string long_s, such that short_s can be found repeated several times in long_s. The task is to calculate the maximum number of consecutive repetitions of short_s within long_s, and return that number. If short_s or long_s is empty, then return 0.
I’m asking for upvotes, thank you! Good luck!
The above content is collected through the Internet, translated and processed by GPT.