Class NP-complete
Certain problems within NP Class have a special property called completeness, and we call these problems NP-COMPLETE. If we can find an efficient solution to any NP-COMPLETE, then we can use it to find an efficient solution to any NP problem.
# Examples
Some NP-COMPLETE problems include:
- Solving n × n Sudoku puzzles.
- Traveling salesman problem.
- Hamiltonian path problem.
- Bin packing problem.