Bit Manipulation - Generate All Permutations Using Bitmask DP
What is the time complexity of generating all permutations of
n elements using bitmask DP with iterative tabulation as shown in the code snippet? Assume appending to lists is O(1) amortized.