{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/de83942f292d4d86bb0ff273e5c1445a\" frameborder=\"0\" width=\"1280\" height=\"960\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":960,"width":1280,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":960,"thumbnail_width":1280,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/de83942f292d4d86bb0ff273e5c1445a-00001.gif","duration":205.398,"title":"Brute Force vs Better Solution","description":"In this video, I explain the difference between a brute force solution and a better solution for checking if a string is a palindrome. I demonstrate the brute force solution, which has a complexity of n cubed, and then introduce the better solution, which has a complexity of n square. I also discuss the importance of considering both odd and even length palindromes. No action is requested from the viewers."}