# Tag Info

Performance Time complexity for your algorithm is $O(N²+N²/2)$. If you find a way to combine Transpose $O(N²)$ and ReverseCols $O(N²/2)$ in a single run, you could get $O(N²)$ in worst case. Edit: given Henrik's good eye, you have already come up with a solution before that adheres to the optimized complexity. So, apply it here.