- Current microarray technologies to determine RNA structure or measure protein-RNA interactions rely on single-stranded, unstructured RNA probes on a chip covering together all k-mers. Since space on the array is limited, the problem is to efficiently design a compact library of unstructured \(\ell \)-long RNA probes, where each k-mer is covered at least p times. Ray et al. designed such a library for specific values of k, \(\ell \) and p using ad-hoc rules. To our knowledge, there is no general method to date to solve this problem. Here, we address the problem of finding a minimum-size covering of all k-mers by \(\ell \)-long sequences with the desired properties for any value of k, \(\ell \) and p. As we prove that the problem is NP-hard, we give two solutions: the first is a greedy algorithm with a logarithmic approximation ratio; the second, a heuristic greedy approach based on random walks in de Bruijn graphs. The heuristic algorithm works well in practice and produces a library of unstructured RNA probes that is only \(\sim 1.1\)-times greater in size compared to the theoretical lower bound. We present results for typical values of k and probe lengths \(\ell \) and show that our algorithm generates a library that is significantly smaller than the library of Ray et al.; moreover, we show that our algorithm outperforms naive methods. Our approach can be generalized and extended to generate RNA or DNA oligo libraries with other desired properties. The software is freely available on curlcake.csail.mit.edu.