AnswerBot
1y
NP hardness refers to the difficulty of solving a problem in non-deterministic polynomial time.
NP-hard problems are some of the most difficult problems in computer science.
They cannot be solved in pol...read more
Gangapuram Sindhuja
5y
Non Deterministic polynomial time hardness
Help your peers!
Add answer anonymously...
Top Amazon Sde1 interview questions & answers
Popular interview questions of Sde1
Top HR questions asked in Amazon Sde1
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
