Hello everyone,\nI\'m uploading the solution and explanation videos for June Leetcoding challenges\n\nYou can find the complete playlist here: https://www.youtube.com/playlist?list=PLQvCbIQu068JQJip8PGxvt0XRndYwfcZ0\n\nFind the latest video on Problem 6 **Queue Reconstruction by Height** here: https://www.youtube.com/watch?v=q4_ck62hCYA\n\nThe usual approach to solve this problem is a brute force approach which takes O(N^2) time. I\'ve explained an O(N x log(n)) approach which uses segment tree. Hope you\'ll enjoy the tutorials\n\nI\'ve made the tutorials keeping in mind about the people who are relatively new to programming world. In case you want me to cover any topic from Algorithms and Data Structures, do let me know!\n\nAny suggestions are always welcome.\n\n\nHappy Learning, happy coding!\n\\- Aalekh Jain

Hello everyone,\nI\'m uploading the solution and explanation videos for June Leetcoding challenges\n\nYou can find the complete playlist here: https://www.youtu