Advanced Competitive Programming: Tree Query Algorithms in C++
Apps & experiments · Author · ongoing
Solutions to contest problems requiring genuinely advanced data structures - the class of problem where a naive approach times out and only a logarithmic-per-query structure passes.
Code: https://github.com/vasu-devs/LEETCODE
The detail
The algorithms implemented include virtual trees, binary lifting for lowest common ancestor queries, Euler tours, persistent segment trees and coordinate compression. These are not interview-preparation algorithms; they are what you reach for when a problem has both an offline query structure and a subtree constraint.
This matters for client work in a specific way: most performance problems are not solved by faster hardware but by choosing a data structure with better asymptotic behaviour. This is the evidence that I can do that.
Also maintain an ongoing solution archive. 5-star problem-solving rating, and selected for elite algorithm training from a cohort of 368.
C++ with the standard template library.
What I did
- Implemented virtual trees, binary lifting for lowest common ancestor, Euler tours and persistent segment trees under contest conditions
- Applied coordinate compression to make large-range problems tractable
- Maintain an ongoing solution archive
- Achieved a 5-star problem-solving rating and completed elite algorithm training selected from a cohort of 368
Stack
C++, Algorithms, Data Structures, Competitive Programming, Problem Solving, Optimization
Case study: https://www.siddhvasudev.com/projects/advanced-competitive-programming-tree-query-algorithms