Ruskey and Savage asked the following question: for , does every matching in extend to a Hamiltonian cycle in ? Fink showed that the answer is yes for every perfect matching, thereby proving Kreweras’ conjecture. In this paper we consider the question in hypercubes with faulty edges. We show for that every matching of at most edges extends to a Hamiltonian cycle in . Moreover, we prove that when and is nonempty this conclusion still holds even if has at most faulty edges, with one exception.