Name some NP-Complete problems. — - tsp - knapsack problem - satisfiability - 3D matching - tricoloring - subset sum - rectangle packing - bin packing - vertex cover - set cover
G
1.2K
Google Interview
This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university