perf: optimize O(N*M) array filtering with O(1) Set lookups

Co-authored-by: xb1g <70068561+xb1g@users.noreply.github.com>

Author: google-labs-jules[bot]

app/api/assignments/[id]/nodes/route.ts

@@ -242,7 +242,9 @@ export async function POST(
     }
 
     const existingNodeIds = existingNodes?.map((n) => n.id) || [];
-    const missingNodes = node_ids.filter((id) => !existingNodeIds.includes(id));
+    // Bolt Optimization: Pre-compute Set for O(1) lookup instead of O(N) array includes
+    const existingNodeIdsSet = new Set(existingNodeIds);
+    const missingNodes = node_ids.filter((id) => !existingNodeIdsSet.has(id));
 
     if (missingNodes.length > 0) {
       return NextResponse.json(

app/api/classrooms/[id]/grading/route.ts

@@ -262,7 +262,9 @@ export async function GET(
 
     // Get additional profiles for members not in submissions
     const classroomUserIds = classroomMembers.map(m => m.user_id);
-    const missingUserIds = classroomUserIds.filter(id => !submissionUserIds.includes(id));
+    // Bolt Optimization: Pre-compute Set for O(1) lookup instead of O(N) array includes
+    const submissionUserIdsSet = new Set(submissionUserIds);
+    const missingUserIds = classroomUserIds.filter(id => !submissionUserIdsSet.has(id));
 
     let additionalProfiles: any[] = [];
     if (missingUserIds.length > 0) {