Time complexity:O(n), we make only two iterations through the array. Space complexity:O(n), sorting frequency of each number. Approach #3: Boyer-Moore Voting algorithm In its most basic form, the algorithm seeks out a majority element if one exists. A majority element is one that appears...