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: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']

SOLUTION: 27156

PROBLEM: 1, 2, ['5605', '6415']

SOLUTION: 12020

PROBLEM: 2, 11, ['h', 'Y', '7585', 'u', '4267', 'G', 'I', 'T', '513', '7183', 'L', 'u', 'g', '1707', '2645', 'm', '13', '8829']

SOLUTION:
19548