Question

What are computer problems of class NP?

Answer 1

HEY MATE HERE IS YOUR ANSWER:-

NP is the set of all decision problems for which the instances where the answer is "yes" have efficiently verifiable proofs.

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means "at least as hard as any NP-problem," although it might, in fact, be harder.

HOPE IT HELPS ☺️