Count the number of substrings within a binary string that have an equal number of consecutive 0s and 1s. The 0s and 1s within the substring must also be grouped consecutively.

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.

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