NP

Lesson in the Computer Science Roadmap · Stage 14: Tries

Last updated 14 September 2026

What is NP?

The NP in NP class stands for Non-deterministic Polynomial Time. It is the collection of decision problems that can be solved by a non-deterministic machine in polynomial time.

Study this in the interactive course See the whole Computer Science roadmap

Free resources to learn NP

ArticleTrying to understand P vs NP vs NP Complete vs NP Hard
VideoComplexity: P, NP, NP-completeness, Reductions
VideoComplexity: Approximation Algorithms
VideoComplexity: Fixed-Parameter Algorithms
VideoLecture 23: Computational Complexity
VideoGreedy Algs. II & Intro to NP Completeness
VideoNP Completeness II & Reductions
VideoNP Completeness III
VideoNP Completeness IV

NP: common questions

Can I learn NP in Hindi?

This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain NP in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.

Is this NP tutorial for beginners?

It is lesson 109 of 188 in the free Computer Science roadmap, in stage 14, Tries. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.