Engineering Logs

Mastering hierarchical data and efficient updates. Transitioning from basic prefix sums to Segment Trees and Fenwick Trees.

A two-hour mock contest focusing on Number Theory, the Sieve of Eratosthenes, and prime factorization algorithms under time constraints.

Moving from brute force recursion to efficient DP. Mastering memoization, 1D optimization, and state transitions.

Mastering grid navigation, recursion, and connected components. Transitioning from implicit grids to explicit adjacency lists.

Eliminating $O(N^2)$ loops using $O(N)$ pre-computation. Analysis of Static Range Sum Queries.

The architectural roadmap for the ACM @ ASU competitive programming track. Transitioning from $O(N^2)$ to $O(1)$ across six bi-weekly sessions.