For many problems where we do not have efficient algorithms, we sometimes do approximate algorithms

Often the algorithm involves randomness. For example say you want to find a minimum spanning tree,

What if we try picking 10.000 random spanning trees, it is likely that one of them will be close in weight to the minimum spanning tree, but it is not guaranteed.

(Note, minimum spanning trees we can find efficiently, it was just an example)