exercises array

Author: DaveBerzack-NSS

README.md

@@ -64,11 +64,11 @@ Chapters are individual lessons within a section:
   previousChapterId: null,
   nextChapterId: 'arrays-indices',
   content: `## Arrays (a.k.a. collections of things)...`,
-  exercise: {
+  exercises: [{
     starterCode: `// Example starter code...`,
     solution: `// Example solution...`,
     tests: [/* tests */]
-  }
+  }]
 }
 ```
 
@@ -354,11 +354,11 @@ The application will be available at http://localhost:5173/data-structures-and-a
      previousChapterId: 'previous-chapter',
      nextChapterId: 'next-chapter',
      content: `## Markdown Content...`,
-     exercise: {
+     exercises: [{
        starterCode: `// Starter code...`,
        solution: `// Solution...`,
        tests: [/* tests */]
-     }
+     }]
    }
    ```
 

src/sections/03-algorithmic-thinking/_b032e981/index.jsx

@@ -39,7 +39,7 @@ Best of luck, and enjoy the practice! 🚀
 ## Problem: Reverse Array In-Place
 
 Write a function that reverses an array in-place without using any built-in reverse methods or creating a new array.`,
-  exercise: {
+  exercises: [{
     starterCode:`/*
 Problem: Reverse Array In-Place
 
@@ -220,5 +220,5 @@ function reverseArray(arr) {
         message: "Function should modify the array in-place."
       }
     ]
-  }
+  }]
 };

src/sections/03-algorithmic-thinking/_b892f062/index.jsx

@@ -39,7 +39,7 @@ Best of luck, and enjoy the practice! 🚀
 ## Problem: Move Zeros to End
 
 Write a function that moves all zeros in an array to the end while maintaining the relative order of non-zero elements.`,
-  exercise: {
+  exercises: [{
     starterCode:`/*
 Problem: Move Zeros to End
 
@@ -217,5 +217,5 @@ function moveZeroes(nums) {
         message: "Function should handle single element arrays."
       }
     ]
-  }
+  }]
 };

src/sections/04-arrays-and-two-pointers/_7a106b96/index.jsx

@@ -45,7 +45,7 @@ Follow-up Questions:
 - What is the space complexity?
 - How would this change if we needed to preserve order?`,
 
-exercise: {
+exercises: [{
   starterCode:`
 /*
 Problem: Remove Element
@@ -190,5 +190,5 @@ function removeElement(nums, val) {
         message: "Function should not modify array if val is not found."
       }
     ]
-  }
+  }]
 };

src/sections/04-arrays-and-two-pointers/_a62881e6/index.jsx

@@ -39,7 +39,7 @@ Best of luck, and enjoy the practice! 🚀
 ## Problem: Remove Duplicates from Sorted Array
 
 Given a sorted array, remove duplicates in-place and return the new length. You must modify the array in-place with O(1) extra space.`,
-  exercise: {
+  exercises: [{
     starterCode:`/*
 Problem: Remove Duplicates from Sorted Array
 
@@ -241,5 +241,5 @@ function removeDuplicates(nums) {
         message: "Function should handle arrays with no duplicates and maintain proper array length."
       }
     ]
-  }
+  }]
 };

src/sections/05-2d-arrays/09-code-exercise-1/index.jsx

@@ -6,7 +6,7 @@ import { tests } from './tests.js';
 export default {
   title: 'Module 4 - Code Exercise 1',
   content,
-  exercise: {
+  exercises: [{
     starterCode,
     solution,
     tests,
@@ -25,5 +25,5 @@ Implement the \`incrementNeighbors\` function that:
 - What is the space complexity? O(1) - only uses constant extra space
 - How would diagonal neighbors change this? Would check 8 directions instead of 4
     `
-  }
+  }]
 };

src/sections/05-2d-arrays/10-code-exercise-2/index.jsx

@@ -6,7 +6,7 @@ import { tests } from './tests.js';
 export default {
   title: 'Module 4 - Code Exercise 2',
   content,
-  exercise: {
+  exercises: [{
     starterCode,
     solution,
     tests,
@@ -29,5 +29,5 @@ Implement the \`getNeighbors\` function that:
 - What edge cases need to be considered? Bounds checking for grid boundaries
 - How would diagonal neighbors change this? Would check 8 directions and return up to 8 values
     `
-  }
+  }]
 };

src/sections/05-2d-arrays/_5e6361db/index.jsx

@@ -43,7 +43,7 @@ Write a function \`getNeighbors\` that returns an array of the values of all val
 - What edge cases need to be considered?
 - How would this change if diagonal neighbors were allowed?
 `,
-  exercise: {
+  exercises: [{
     starterCode:`
     /*
 Problem: Return Neighbor Values
@@ -116,5 +116,5 @@ Problem: Return Neighbor Values
         message: "Should return neighbors of center cell"
       }
     ]
-  }
+  }]
 };

src/sections/05-2d-arrays/_9e31c844/index.jsx

@@ -45,7 +45,7 @@ The input matrix should be updated in-place.
 - What is the time complexity of your solution?
 - What is the space complexity?
 - How would this change if diagonal neighbors were included?`,
-  exercise: {
+  exercises: [{
     starterCode:`/*Problem: Increment All Neighbors
 
 Given a 2D array (matrix) of numbers and a target cell (row, col), increment all **immediate neighbors** (up, down, left, right) of that cell by 1.
@@ -124,5 +124,5 @@ function incrementNeighbors(matrix, row, col) {
         message: "Should handle edge case for top edge cell"
       }
     ]
-  }
+  }]
 };

src/sections/06-linked-lists/_1c8056a9/index.jsx

@@ -48,7 +48,7 @@ Use the two-pointer technique (tortoise and hare) to solve this in one pass.
 - What is the time complexity of your solution?
 - What is the space complexity?
 - How would you find the node at 1/3 position?`,
-  exercise: {
+  exercises: [{
     starterCode:`/*
 Problem: Find Middle Node of Linked List
 
@@ -343,5 +343,5 @@ function findMiddleNode(head) {
         message: "Function should handle two-node list correctly."
       }
     ]
-  }
+  }]
 };