This is bogus.

In particular, how is “divide and conquer” not “recursion”?

And surely a breadth first search is a great example of a greedy algorithm? Indeed, surely both BFS and DFS are examples of recursion?

Where does something simple like bubble sort fit into your list? Where do hash-based algorithms like Bloom filters fit into this?

What about numeric algorithms like matrix inversion? They just don’t count for you?

I would particularly note that hash-based algorithms seem to appear in almost every serious interview I’ve ever had in the last twenty years.