Practice | Hashtable

Home > PYQ > NIC STA 2023 - Shift 1

1. Which of the following is linown to be no! an NP-Harct Problem?

A. Vertex cover problem

B. fending biggest element in an array

C. Maximal independent problem

D. Travelling salesman problem

No explanation ¯\_(ツ)_/¯

You must login to add comments. Login now.