There were two questions.

First one
With given integer array(not sorted), find the maximum number of elements after adding operations.
we can add two elements(arr[i], arr[i+1]) if it is acending order (arr[i] < arr[i+1])
the number of adding operations you make doesn't matter

ex) [9, 10, 11, 7]
10+11 can be added: [9,21,7]
9+21 can be added: [30, 7]
output = 30

even though we can add 9+10, if we do, we have [19, 11, 7]. So, 19 < 30.

Second one was this: https://leetcode.com/discuss/interview-question/1594897/Amazon-OA-questions-Find-password-strength (similar as https://leetcode.com/problems/total-appeal-of-a-string/description/)