Amazon SDE 1 OA

Round 1

Questions: Please help me solve this problem that appeared on a SDE1 OA a while ago.

Constraints:

• 1 ≤ n, m ≤ 750
• 1 ≤ k ≤ min(n, m)
• 1 ≤ paint[i][0] ≤ n
• 1 ≤ paint[i][1] ≤ m
• paint[i] ≠ paint[j] for any 1 ≤ i < j ≤ n*m