{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/c08727a1f00d4c1aa29bc578651e9a3b\" frameborder=\"0\" width=\"1920\" height=\"1440\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":1440,"width":1920,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":1440,"thumbnail_width":1920,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/c08727a1f00d4c1aa29bc578651e9a3b-1683363904051.gif","duration":1826.794,"title":"assortedRecursion [reverseNumber, findFibonacci, toPower]","description":"hi! this is assorted recursion. i recommend watching on 1.5x or 2x speed! sorry for the background noise lol i was too lazy to use my microphone 😭\n\nTIMESTAMPS\n\nreverseNumber: base case + recursive case explanation : 0:00 - 6:30 \nmod / math explanation  (you can skip after 6:30 if you don't care how the math works and just want the formula lol!!!) : 6:30 - 9:05\nreverseNumber CODE : 11:21 - 14:17\n\nfindFibonacci - 14:17 - 23:11\n\ntoPower: 23:29 - end"}