Pascal Triangle Encryption

Problem Statement

\n \n Pascal Triangle Encryption \n \n\n \n In order to ensure maximum security, the developers at Amazon employ multiple encryption methods to keep user data protected. \n \n In one method, numbers are encrypted using a scheme called \\\'Pascal Triangle\\\'. When an array of digits is fed to this system, it sums the adjacent digits. It then takes the rightmost digit (least significant digit) of each addition for the next step. Thus, the number of digits in each step is reduced by 1. This procedure is repeated until there are only 2 digits left, and this sequence of 2 digits forms the encrypted number. \n \n Given the initial sequence of the digits of numbers, find the encrypted number. You should report a string of digits representing the encrypted number. \n \n\n \n Example \n \n numbers = [4, 5, 6, 7] \n Encryption occurs as follows: \n \n Hence, the encrypted number formed is 04. \n \n \n\n \n Function Description \n Complete the function findNumber in the editor below. \n findNumb