What is the P vs NP problem, and why is it considered one of the most important unsolved problems in computer science?

The P vs NP problem explores whether every problem whose solution can be verified quickly by a computer can also be solved quickly by a computer, with implications for cryptography, optimization, and algorithm design.