{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/e6bc23f2af474d628d80b2fc1e138789\" frameborder=\"0\" width=\"1110\" height=\"832\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":832,"width":1110,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":832,"thumbnail_width":1110,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/e6bc23f2af474d628d80b2fc1e138789-ed2f9d6d6f15a1c0.gif","duration":298.3894,"title":"Valid Parentheses Problem Explained by a Software Engineer","description":"Hi, I'm Roger, and in this video, I walk through the problem of validating parentheses using a stack-based approach. I explain how to check for matching open and close brackets, and I provide pseudocode that outlines the logic, including checking for odd lengths and using a key-value pair for bracket matching. The time and space complexity for this solution is O(n). I encourage you to follow along and implement this logic in your own code."}