lol the only thing people posted a solution for was FizzBuzz
for matrix multiplication the naive algorithm is sufficient for small matrices, I doubt you could implement Strassen or Coopersmith-Winograd algorithm during an interview unless you were given a lot of time. Prime factorization and huffman compression are pretty straightforward. Fast fourier transform is pretty math heavy, my point being these are very math-specific questions (as opposed to simpler logic questions: ex. how does a generator work in Python)
for matrix multiplication the naive algorithm is sufficient for small matrices, I doubt you could implement Strassen or Coopersmith-Winograd algorithm during an interview unless you were given a lot of time. Prime factorization and huffman compression are pretty straightforward. Fast fourier transform is pretty math heavy, my point being these are very math-specific questions (as opposed to simpler logic questions: ex. how does a generator work in Python)