{
  "$type": "site.standard.document",
  "contributors": [
    {
      "did": "did:plc:igunvse2uemkwmci3igoxhu5",
      "displayName": "Oz Akan",
      "role": "author"
    }
  ],
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreihwsq5perf433qyghiumjkksf5kfy4lsonlz3xbcvg5srs6smer3e"
    },
    "mimeType": "image/webp",
    "size": 158984
  },
  "description": "Refresher on Big O time and space complexity with interview questions",
  "path": "/techs/04-bigo-refresher",
  "publishedAt": "2025-11-03T21:00:00.000Z",
  "site": "at://did:plc:igunvse2uemkwmci3igoxhu5/site.standard.publication/luminary-blog",
  "tags": [
    "algorithms",
    "refresher",
    "programming"
  ],
  "textContent": "Complexity Analysis is the process of determining how the runtime (time complexity) and memory usage (space complexity) of an algorithm grow as the input size increases. It helps us compare algorithms and choose the most efficient one for our needs.",
  "title": "Time and Space Complexity Refresher"
}