Another straightforward implementation problem. This problem can be done especially quickly using certain Python methods.

One method of implementing a solution is to push the individual binary digits of the number into a stack until that number is 0. Keep in mind that by doing this, we need to handle the case if the number is 0, which can be done with a rare "do-while" loop. Afterward, pop the stack and replace 1s with dank and 0s with meme. Make sure that you do not forget to include the trailing zeros.

Time Complexity: ~\mathcal{O}(T \log N)~