We had a call and spoke about how everything would work, what I’m strongest at. She finished with some ordering algorithms questions.

They were not complex, just like Quicksort vs. Mergesort, best execution time, worst execution time, and average execution time. However, since they were unexpected and not something you work with in your regular tasks, they were a little hard.

I nailed them (googled them afterwards), but I have to admit, I was a little lucky with some of them.

Can you write code in Java or C++ to find the power set of a given set?