// DRUNKWATER TEMPLATE(add description and prototypes)
// Question Title and Description on leetcode.com
// Function Declaration and Function Prototypes on leetcode.com
//260. Single Number III
//Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
//For example:
//Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
//Note:
//The order of the result is not important. So in the above example, [5, 3] is also correct.
//Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
//Credits:
//Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
//class Solution {
//    func singleNumber(_ nums: [Int]) -> [Int] {
//    }
//}



// Time Is Money