Answer: VOIZWORKS Hiring Challenge | Online Assessment Question | On-Campus (2025)

Approach Compare both strings character by character. Store indices where characters differ. Cases: No differences → already equal → return true Exactly 2 differences → check if swapping those positions makes strings equal. Any other number of differences → return false Strategy Record mismatch positions. A valid swap can only fix exactly two mismatches. Verify the cross-match condition. Java Code import java.util.*; class Solution { public boolean areAlmostEqual(String s1, String s2) { List<Integer> diffs = new ArrayList<>(); for (int i ...