Brute force pattern

Does every DSA problem have a brute force solution? If not, how can we determine which problems can be solved using brute force and which ones cannot?