Solve Two Sum and Anagrams | Dataford Interview Questions

Akkodis Canada receives numeric identifiers and text labels from multiple workflow surfaces. Implement one function that solves two independent tasks efficiently: find the unique pair of identifier indices whose values equal a target, and group labels that are anagrams.

Formal Specification

Implement analyze_inputs(nums, target, words):

Return the indices of the two distinct elements in nums whose values sum to target. Return indices in ascending order. Exactly one pair exists.
Group words so that words containing the same letters, with the same frequencies, belong to one group. Preserve the order in which groups are first encountered and preserve the original order of words within each group. Matching is case-sensitive, and anagrams must have identical lengths.

Return a dictionary with this exact shape: {"two_sum": [i, j], "anagram_groups": [[...], [...]]}.

Constraints

2 <= len(nums) <= 100,000
-10^9 <= nums[i], target <= 10^9
1 <= len(words) <= 100,000
The total number of characters across all words is at most 1,000,000
Words contain lowercase and uppercase English letters only
Exactly one valid Two Sum pair exists
Do not modify the input arrays or word list

Function Signature

def analyze_inputs(nums, target, words):

Your question is Solve Two Sum and Anagrams. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem