{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Merge Intervals in Java Algorithms (LeetCode)","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/84b378b1\"></iframe>","width":"100%","height":180,"duration":119,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/merge-intervals-in-java-algorithms-leetcode.\nReturning an array of the non-overlapping intervals that span every input interval.\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #java, #data-structures, #leetcode, #algorithms, #programming, #learning-to-code, #merge-intervals, #java-algorithms, #hackernoon-es,  and more.\nThis story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,\n            and for more stories, please visit hackernoon.com.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}