📝 **Task:** Find the top-2 most frequent numbers in `[1, 1, 1, 2, 2, 3]`. Print the result. Expected: [1, 2] 📋 Implement the function above. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.