Shortest Distance to Target Color

Given an array of colored values and multiple queries (index, target color), return for each query the minimum absolute distance from the index to any element of that color, or -1 if it doesn't exist. The challenge is to handle many queries efficiently by preprocessing the positions of each color so you can quickly find the nearest occurrence per query.