Merge pull request #458 from cpinitiative/thecodingwizard-patch-1

content: remove incomplete section from intro to dp module

Author: bqi343

content/4_Gold/Intro_DP.mdx

@@ -104,10 +104,6 @@ Although it is not too difficult to grasp the general ideas behind DP, the techn
 
 ## General Resources
 
-Note: You can skip the video and just use the starred resources if you want.
-
-<Youtube id="YBSt1jYwVfU" />
-
 <Resources>
 	<Resource source="CPH" title="7 - DP" starred>
 		Great introduction that covers most classical problems. Mentions
@@ -136,6 +132,14 @@ Note: You can skip the video and just use the starred resources if you want.
 	<Resource source="PAPS" title="9 - DP">
 		starts with DAGs, which are covered in "Topological Sort"
 	</Resource>
+</Resources>
+
+If you prefer watching videos instead, here are some options:
+
+<Resources>
+	<Resource source="Youtube" title="Errichto DP #1 - Fibonacci, iteration vs recursion" url="https://www.youtube.com/watch?v=YBSt1jYwVfU">
+		Great Introductory Errichto DP Video
+	</Resource>
 	<Resource source="Youtube" title="Errichto DP #2 - Coin change, double counting" url="https://www.youtube.com/watch?v=1mtvm2ubHCY">
 		Another Errichto DP video regarding coin change
 	</Resource>
@@ -153,12 +157,6 @@ It's usually a good idea to write a slower solution first. For example, if the c
 
 </Info>
 
-<IncompleteSection>
-
-this list is pretty long, should have a good reason for including each of these
-
-</IncompleteSection>
-
 ## Classical Problems
 
 The next few modules provide examples of some classical problems, or Dynamic Programming problems which are well known. However, classical doesn't necessarily mean common. Since so many competitors know about these problems, problemsetters rarely set direct applications of them. <!-- Solutions for most of these problems can be found in Chapter 7 of CPH.