Given a string of digits, return all possible letter combinations that the number could represent, using the typical phone keypad mapping. The goal is to generate all valid combinations in any order.

You're given an array of numbers. Find how many ways you can remove a single element to make the sums of the even-indexed and odd-indexed elements equal.