Question

A problem is said to be NP-hard if:

A It can be solved in polynomial time.
B It is at least as hard as the hardest problems in NP.
C It is in the P class.
D It has a non-deterministic solution.
Practice Next

Relevant for Exams:

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)