refactor continued

Author: DaveBerzack-NSS

notes.txt

@@ -1,9 +1,78 @@
+01
+introduction
+	no context for example in right panel. 
+
+02
+Polynomials  
+	question 3 is tricky and semantic (is the definition important enough?)
+
+03
+what is a data structure
+	types could be more descriptive, not just a list
+big o
+	removed section on how to determine
+
+04
+objectives
+	content is all wrong
+core operations
+	content at the end is different
+array methods
+	content at the end
+
+06 
+all
+	checkpoints aren't being styled right
+playlist performance
+	extra content at the end
+
+07
+stacks introduction	
+	alex's first challenge and other content
+implementation tradeoffs
+	board questions & discussion, etc
+	checkpoint
+implement a stack class
+	Real-World Applications in the Library and more
+implement queue class
+	efficient solution... etc
+glossary
+	different terms/content
+
+08
+intro maps
+	content different
+intro sets
+	content different
+real world 
+	content different
+building foundation
+	content different
+building custom
+	content different
+info sheet
+	content different
+info sheet
+	content different
+checkpoint
+	formatting is messed up
+
+
+materials 
+	extra content
+
+
+
+	
+
+
+
+
+
+... do the code exercises still work with links?
+
+2d arrays - make content more narrative to match others
+
+<img width="100%" src="assets/splice.png"/>
 
-Introduction
-	introduction
-		no context for example in right panel. 
 
-Just enough math
-	Polynomials - 
-		figure 2 with stick figures?
-		question 3 is tricky and semantic (is the definition important enough?)

public/assets/splice.png

@@ -5,6 +5,7 @@ By the end of this course, the 5 problem-solving steps below should feel second
 You'll also get very familiar with the form below, as you'll use it while acting as the interviewer during your pair programming sessions:
 
 🔗 [Pairing Feedback Form](https://forms.gle/wTQYosJis3WizHRn9)
+
 (just read the form no need for anything else at this point).
 Your instructors will walk you through exactly how to use the 5-step problem-solving process by doing a behavior modeling session. They'll tackle a DSA problem live, thinking out loud and following each step to a T. The session will be recorded so you can revisit it anytime. This demo will show you what it looks like to apply the steps in a real coding scenario, helping you build the habit of approaching every problem systematically.
 

src/sections/03-algorithmic-thinking/04-problem-solving-process/index.md

@@ -128,7 +128,7 @@ function reverseInPlace(arr) {
     right--;
   }
 
-  return arr;
+  return arr; 
 }
 ```
 

src/sections/03-algorithmic-thinking/05-big-o-notation/index.md

@@ -121,7 +121,7 @@ console.log(rushOrders);
 
 "But here's the important part, Maya," Sarah continues seriously. "When we insert an order in the middle, something interesting happens behind the scenes."
 
-*[Visual: Array elements shifting right to make room for the new order]*
+<img width="100%" src="assets/splice.png"/>
 
 "Every order from position 2 onwards has to **shift to the right** to make room. This is why inserting in the middle takes **O(n) time complexity** - in the worst case, if we insert at the very beginning, we have to shift ALL the orders."
 

src/sections/04-arrays-and-two-pointers/02-arrays-intro/index.md

@@ -1,4 +1,3 @@
-# Two-Pointer Logic for Pairwise Traversal
 
 Meet Eleanor, the head librarian at the Grand Metropolitan Library. With over 50,000 books to organize, catalog, and maintain, Eleanor has discovered that the secret to efficient library management lies in a powerful technique: using two bookmarks to navigate through collections simultaneously. What she doesn't realize yet is that she's mastering one of programming's most elegant problem-solving patterns.
 

src/sections/04-arrays-and-two-pointers/07-two-pointers/index.md

@@ -1,5 +1,3 @@
-# Arrays - Operations & Complexity Info Sheet
-
 ## Common Array Operations
 
 | **Operation**          | **Description**                       | **Big O (Time)** |

src/sections/04-arrays-and-two-pointers/08-info-sheet/index.md

@@ -4,11 +4,8 @@ import solution from './solution.js?raw';
 import { tests } from './tests.js';
 
 export default {
-  id: "code-exercise-1",
   title: "Code Exercise 1: Remove Element",
   description: "Practice removing elements from arrays using two-pointer technique.",
-  previousChapterId: "arrays-and-two-pointers-checkpoint",
-  nextChapterId: "code-exercise-2",
   content,
   exercises: [{
     starterCode,

src/sections/04-arrays-and-two-pointers/13-code-exercise-1/index.jsx

@@ -4,11 +4,8 @@ import solution from './solution.js?raw';
 import { tests } from './tests.js';
 
 export default {
-  id: "code-exercise-2",
   title: "Code Exercise 2: Remove Duplicates from Sorted Array",
   description: "Practice removing duplicates from sorted arrays using two-pointer technique.",
-  previousChapterId: "code-exercise-1",
-  nextChapterId: null,
   content,
   exercises: [{
     starterCode,

src/sections/04-arrays-and-two-pointers/14-code-exercise-2/index.jsx

@@ -8,7 +8,7 @@ import { Checkpoint } from '@nss-workshops/nss-core';
 
 export default {
   id: "linked-intro",
-  title: "Introduction to Linked Lists",
+  title: "Introduction to Linked Lists - Building the Perfect Playlist",
   previousChapterId: "linked-objectives",
   nextChapterId: "linked-types",
   content: contentMd,