Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

Imagine a circular typewriter with a special pointer. Find the minimum time to type a word, where moving the pointer and typing each letter takes one unit of time.

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.