what is the minimum space complexity in problem of find longest common substring?

Question

const char* _longestCommonSubstr(const char *s1, const char *s2, int n, int m) {
   // assert n >= m
   int max = 0; // keep track of max length found
   int tmp = 0;