To guarantee the highest level of security, the developers at FastPrep.io implement multiple layers of encryption techniques to safeguard user data and ensure it remains fully protected from any potential threats.
One of the encryption methods used is a unique scheme known as the "Pascal Triangle" encryption. In this approach, numbers are transformed through a systematic reduction process that follows a specific pattern.
When an array of digits is input into this system, it sums adjacent digits in a pairwise manner. After computing each sum, it extracts the rightmost digit (i.e., the least significant digit) from each result to form the next sequence. As this process continues, the number of digits in each step gradually decreases by 1.
This iterative procedure is repeated until only two digits remain. The final pair of digits obtained at the end of the process represents the encrypted number.
Given an initial sequence consisting of the digits of a number, apply the Pascal Triangle encryption method to determine the final encrypted number. The process involves systematically reducing the sequence by summing adjacent digits and retaining only the rightmost digit of each sum at every step.
Your task is to compute and return the resulting encrypted number as a string of digits, representing the final two-digit sequence derived from the encryption process.
Example 1:
Input: digit_numbers = [4, 5, 6, 7]
Output: "04"
Explanation:the source said that ans for this example input was "04" :)
ππ


input:
output: