Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

Could someone explain how to calculate the average and worst complexity of a back-tracking algorithm?

I think the worst case is O((m*n) ^2)? The worst case for DFS is O(mn) in this case? m and n is the dimension of matrix.

Why not O((m*n) ^4)?

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.