razwan

// processing time O(m)
// added space O(m)
// time complexity: O(n+m)

function errorTable (p, m, f) {
  for (var j = 1; j <= m-1; j++) {  
    k = f[j-1];   
    while (k!=-1 && p[j-1] != p[k]) {
      k = f[k];
    }