Latest Posts
Abhinav Rajesh Shripad
A humorous and engaging journey through the internship process at IIT Delhi, leading to landing an internship at Quantbox. From the preparation phase, surviving technical interviews, to the excitement of the final offer—this post offers a light-hearted yet insightful look at the challenges and triumphs of internship season.
Explore an efficient algorithm for finding Hamiltonian Paths in Tournament graphs with a time complexity of O(n log n). We first prove the existence of Hamiltonian Paths in Tournaments and along the way find an O(n^2) algorithm for same. We then discuss the key insights and algorithms to achieve an O(n log n) time complexity. At the end we draw some parallels with the optimization techniques used with some very standard algorithms problem.
Older Posts
This is the third post of my new Astro blog.
This is the second post of my new Astro blog.
This is the first post of my new Astro blog.