TASK DEFINITION: In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
PROBLEM: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']

SOLUTION: 4918

PROBLEM: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

SOLUTION: 0

PROBLEM: 6, 17, ['G', 'W', '5183', '833', '9089', '4803', '5751', '819', 'q', '8251', 'J', '2763', 'R', '6831', 'i', 'i', '6967', 'H']

SOLUTION:
36185