How much do you know about P vs. NP problem?

Question

I have heard that it is one of the most important questions of our century, so much that there is a prize of 1 million dollars for the one who will solve it. Could anyone explain it in more details?

Answer 1

The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified (technically, verified in polynomial time) can also be solved quickly (again, in polynomial time)

https://en.m.wikipedia.org/wiki/P_versus_NP_problem

Answer 2

What do you mean by polynomial time?