Hi i was just wondering what is the P versus NP.

In computational complexity theory, the complexity class NP complete in a class of problems having two properties it is in the set of NP problems any given solution to a problem can be verified quickly

P is problem and NP is complete

P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified by a computer, it can also be quickly solved by a computer