NP refers to Non-Deterministic Polynomial, the class of problems that are intractable to solve but can be verified reasonably. These set of problems have a worst-case time that is great than polynomial time i.e.
An NP-Class problem will have the following Big-O time complexities:
Examples
#todo List NP Problems that are neither NP-Complete nor NP-Hard