In the hidden clique problem, one needs to find the maximum clique in an n-vertex graph that has a clique of size k but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice of input graph) when k ≥c√n for a sufficiently large constant c. In this manuscript we present a new algorithm for finding hidden cliques. It too provably works when k > c√n for a sufficiently large constant c. However, our algorithm has the advantage of being much simpler (no use of spectral techniques), running faster (linear time), and experiments show that the leading constant c is smaller than in the spectral approach. We also present linear time algorithms that experimentally find even smaller hidden cliques, though it remains open whether any of these algorithms finds hidden cliques of size o(√n).