bolt: replace O(N^2) Array.includes with O(N) Set.has in filter loops

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));
+    // Optimization: Use Set for O(1) lookups instead of Array.includes which is O(N)
+    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));
+    // Optimization: Use Set for O(1) lookups instead of Array.includes which is O(N)
+    const submissionUserIdsSet = new Set(submissionUserIds);
+    const missingUserIds = classroomUserIds.filter(id => !submissionUserIdsSet.has(id));
 
     let additionalProfiles: any[] = [];
     if (missingUserIds.length > 0) {

components/teams/StudentTeamDashboard.tsx

@@ -93,7 +93,9 @@ export function StudentTeamDashboard({
 
   // Find available teams (teams user is NOT in)
   const userTeamIds = userTeams.map((t) => t.id);
-  const availableTeams = allTeams.filter((t) => !userTeamIds.includes(t.id));
+  // Optimization: Use Set for O(1) lookups instead of Array.includes which is O(N)
+  const userTeamIdsSet = new Set(userTeamIds);
+  const availableTeams = allTeams.filter((t) => !userTeamIdsSet.has(t.id));
 
   // Get teams with open spots
   const teamsWithOpenSpots = availableTeams.filter(