I will teach you competitive programming, algorithms and data structures

I can offer basic to intermediate algorithms, data structures according to the client needs. The topics I can train on can range from basic DFS-BFS, Trees, Graph Algorithms, Number theories (Sieve, Totient, Modulo Inverse etc) to intermediate and advanced techniques like Segment Trees, Sparse Table, Heavy-light Decomposition, Sqrt Decomposition, Centroid Decomposition etc. I can teach and train on problems related to basic to intermediate dynamic programming techniques. I can also train on solving difficult problems in Codeforces (Rated 1900-2200) with personally handpicked set of problems and teach on approaches to deal with difficult problems. For this program, I will share the experiences and lessons I learnt by solving over 280+ problems within this range, which I believe will greatly help you to get started with solving difficult problems in Codeforces. This training program can vary greatly in terms of difficulty level and is suitable for people ranging for newbie/unrated to specialist in codeforces. It is recommended that you have some basic understanding of C++ before starting this program