1. Given a string `s`, count number of substrings of length 3 that comprises of distinct letters. \n2. I forgot...\n3. Newspaper Editing:\n\tGiven an array of paragraphs `p`, where each paragraph is an array of words.\n\tAlso given an integer `width`. \n\tRules for editing:\n\t* words on the same line is separated by a single space.\n   * The length of  one line must not exceed `width`; if the length of one line `len` ismaller then  `width`, pad the beginning and the end of line with white spaces. If `len`is even, then pad beginning and end with `len/2` spaces. If `len`\tis odd, pad beginning  and end with `floor(len/2)` and `ceil(len/2)` spaces, respectively.\n   * Add one asterisk (* ) to the front and back of each line; asterisks does not count towards the length of the line.\n   * Add a line made up of asterisks before the first line and after the last line.\n4. Count Bytes Stored\n\tYou are provided with an array `A` that represents a stream of data, and each element (a chunk) `A_i` is an array of two integers `[start, end]`, which represents the byte addresses used to store the incoming data at time `i`. For example, a chunk `[1, 3]` means that the data is stored on byte 1, 2, and 3. \n\tReturn an array `count`, such that each element `count_i` represents the number of bytes used. NOTE: chunk may overlap e.g. `[1, 3]` overlaps with `2, 5`. \n\n

Given a string s, count number of substrings of length 3 that comprises of distinct letters. \n2. I forgot...\n3. Newspaper Editing:\n\tGiven an array of paragr