From 9232d03e24e818216ffa2bd634a8b2892ac9ce07 Mon Sep 17 00:00:00 2001
From: Selva Muthu Kumaran
 <86711942+selvamuthukumaran1@users.noreply.github.com>
Date: Tue, 28 Nov 2023 04:39:19 +0530
Subject: [PATCH] Add resource for np completness (#4778)

roadmap-computer-science-np-complete-new-video-link-provided
fixes: #4731
---
 .../content/113-complexity-classes/104-np-complete/index.md      | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/data/roadmaps/computer-science/content/113-complexity-classes/104-np-complete/index.md b/src/data/roadmaps/computer-science/content/113-complexity-classes/104-np-complete/index.md
index 88e0c8c53..0ee3313ce 100644
--- a/src/data/roadmaps/computer-science/content/113-complexity-classes/104-np-complete/index.md
+++ b/src/data/roadmaps/computer-science/content/113-complexity-classes/104-np-complete/index.md
@@ -7,6 +7,7 @@ Visit the following resources to learn more:
 - [Types of Complexity Classes | P, NP, CoNP, NP hard and NP complete](https://www.geeksforgeeks.org/types-of-complexity-classes-p-np-conp-np-hard-and-np-complete/)
 - [Trying to understand P vs NP vs NP Complete vs NP Hard](https://softwareengineering.stackexchange.com/questions/308178/trying-to-understand-p-vs-np-vs-np-complete-vs-np-hard)
 - [Complexity: P, NP, NP-completeness, Reductions](https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22)
+- [P vs. NP and the Computational Complexity Zoo](https://www.youtube.com/watch?v=YX40hbAHx3s)
 - [Complexity: Approximation Algorithms](https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24)
 - [Complexity: Fixed-Parameter Algorithms](https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp)
 - [Lecture 23: Computational Complexity](https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=24)