We study generalization of the middle-level problem for subgraphs G(n,k) of the n-dimensional hypercube induced by levels between k and n-k. We show that G(n,2) is Hamiltonian for all odd n ≥ 5.