appreciate the grey snow...
Task 2: Binary Prefix: Given an array of 0s and 1s, return Booleans indicating whether each non-empty prefix of the array (shortest to longest) is divisible by 5 when interpreted as a binary number (highest bit first). Excellent, a problem involving arrays and math; what a great opportunity to use
Both this weekʼs tasks are not confined to ASCII, making them more real-world applicable. That brings with it real-world problems. Task 1: Last Word: "There are more things in heaven and earth, Horatio, than are dreamt of in your philosophy." — Hamlet You are given a string. Write a
Software engineering often involves listening to statements of problems, deriving one or more underlying actual problems, and coming up with solutions that address (partially or completely) those problems (and ideally have other advantages or advance other goals as well).[1] But sometimes the starting point you get is a specification
Task 2: Nice Strings: You are given a string made up of lower and upper case English letters only. Write a script to return the longest substring of the give string which is nice. A string is nice if, for every letter of the alphabet that the string contains, it