Given a string, find the minimum number of characters you must delete so that all remaining character frequencies are unique. No two characters can have the same frequency.

Given an array of numbers, find the longest prefix where removing exactly one element makes all remaining element frequencies equal. Return the length of this prefix.

You're given a mysterious function and a target value. Find an input value to the function that produces an output closest to the target.