Single Number III - Read Statement

Given an array where every element appears twice except for two elements that appear once, find those two elements.

You must achieve $O(n)$ time and $O(1)$ space (excluding input).

Example: For [1,2,1,3,2,5], return [3, 5].