It is better to learn one algorithm a time. Based on her study of the book "The art of competition programming", the book chapter the game plan of contest, Julia learned that it is also very helpful for her to go over each algorithm as many as possible ideas based on Leetcode discussion. She also learned that it is also very helpful to solve an expert level algorithm, in order to find a solution, Julia will quickly build up skills to do some research on algorithm, review the basics, and tries a few ideas.
Small research talk
Review 3 advanced topics for competitive programming:
1. Fenwick tree
2. Max flow algorithm
3. Bitmask DP
Try to answer a few questions on Fenwick tree - binary index tree
One discussion on binary index tree is here on cs.stackexchange.com.
Second discussion on Fenwick tree is here on cs.stackexchange.com.
Study Hackerrank ProjectEuler+ leaderboard - link is here.