READ_ONLY_ACCESS
[
  {
    "id": "ct-w05-000",
    "front": "Week 5 Diagnostic: In 0-indexed list L = [10, 20, 30, 40, 50], what is the value at index 3?",
    "back": "Answer: 40 — L[0]=10, L[1]=20, L[2]=30, L[3]=40."
  },
  {
    "id": "ct-w05-001",
    "front": "Week 5 Diagnostic: What is the worst-case time complexity of Insertion Sort on an array of size N?",
    "back": "Answer: D — When the array is in reverse sorted order, Insertion Sort makes ~N^2 / 2 comparisons and shifts, giving O(N^2) complexity."
  }
]