We are studying the adaptive bitprobe model to store an arbitrary subset S of size at most five from a universe of size m and answer the membership queries of the form “Is x in S?” in two bitprobes. In this paper, we present a data structure for the aforementioned problem. Our data structure takes space. This result improves the non-explicit result by Garg and Radhakrishnan [6] which takes space, and the explicit result by Garg [5] which takes space for the aforementioned set and query sizes. © 2019, Springer Nature Switzerland AG.