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

Starting from (0, 0), can you reach a target point (tx, ty) by repeatedly applying the transformation (x, y) -> (x, x+y) or (x, y) -> (x+y, y)? Determine if it's possible.

You're given a linked list where each node contains a 0 or 1, representing a binary number. Convert this binary representation into its equivalent integer value.