Unique pairs with sum divisible by 101 and word search in matrix
Filed under Dunzo
The question
Given an array, return true or false if unique pairs can be made where each element is used once and each pair's sum is divisible by 101. Also, search for a word in a character matrix moving in 8 directions.
No write-up yet. Related questions below have one.
Related Dunzo questions
Collected from public candidate posts and coding forums. Updated Nov 2026.