removed duplicate title text

Author: DaveBerzack-NSS

src/sections/11-combining-patterns/_9b8a8427/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 1: Arrays — iterate, add, remove
 
 **Navigate:** 1 | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_a4b7c9d2/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 2: 2D Arrays — neighbors & updates
 
 **Navigate:** [1](9b8a8427) | 2 | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_a7b2e9f6/index.jsx

@@ -6,7 +6,6 @@ export default{
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 8: Sorting — built-in compare & O(n log n)
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | 8 | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_b3a8d7c1/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 5: Map & Set — frequency & dedup
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | 5 | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_c4f7a1d8/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 9: Sliding Window — max sum of size k
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | 9
 

src/sections/11-combining-patterns/_c6d9e2f4/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 4: Two Pointers — pair sum in sorted array
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | 4 | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_d1c5f8e3/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 7: Queue — use it to build a RecentCounter
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | 7 | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_d796e8a8/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 1: Arrays — iterate, add, remove
 
 **Navigate:** 1 | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_e8f1a5b3/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 3: Linked List — build, iterate, add, remove
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | 3 | [4](c6d9e2f4) | [5](b3a8d7c1) | [6](f9e4b2a7) | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)
 

src/sections/11-combining-patterns/_f9e4b2a7/index.jsx

@@ -6,7 +6,6 @@ export default {
   sectionId: 'combining-patterns',
   previousChapterId: null,
   content: `
-# Challenge 6: Stack — use it to reverse
 
 **Navigate:** [1](9b8a8427) | [2](a4b7c9d2) | [3](e8f1a5b3) | [4](c6d9e2f4) | [5](b3a8d7c1) | 6 | [7](d1c5f8e3) | [8](a7b2e9f6) | [9](c4f7a1d8)