Get Sequence

Problem Overview

• Determine if each DNA pair can become anagrams by deleting any number of occurrences of at most one character from each sequence.
• Input: dna[n][2] of lowercase strings; 1 ≤ n ≤ 10; lengths up to 10,000. Output: boolean[n] marking special pairs.
• Context: genome sequencing utility checking anagram patterns in DNA.
• Source: Amazon interviews; a common coding interview problem and interview question.