1

INDEX

Courses we offer at AlgoZenith

Deliverables in courses AZ-201 and AZ-202
Course Curriculum
AZ-201 : Applied Algo/DS for Internships and Placements 5

Prerequisites
Target Audience
Overview (what should you expect at the end) :
Topics Covered

AZ-202 Applied Algo/DS for Coding Competitions 8

Prerequisites
Target Audience
Overview (what should you expect at the end)
Topics Covered

Payment Details for AZ-201 and AZ-202 11

2
About AlgoZenith:
At AlgoZenith, we Strive to Provide the best training for Coding Competitions and
Internships / Placements, curated by those who have live performance in these fields.
Learn from the Top Competitive Programmers and those who have aced numerous Coding
tests and Interviews. Get years of experienced content delivered to you through expert
designed course content.

Prepare and fuel you Career success with

Intensive Training at AlgoZenith !!

CP requires guts. CP is challenging, intriguing, and

hence stimulating.
Implementation laughs in your Implementation gets stronger
face. with practice.
Test cases check your
perseverance more than
programming. Test cases become familiar along
the way and easier to combat
Time complexity is a big bully
early on. Time complexity makes
and space complexity is a traitor.
you grow beyond your
Syntax errors are sweet but imagination.
otherwise debugging is
diabolical.
Space complexity gets friendlier
It'll char your mood, bombard
as you continue and syntax
your confidence & break your
errors disappear like an
heart.
eradication.
Not understanding your mistakes
Debugging turns into the new
despite re-watching/re-reading
'normal' since it's always
takes a toll on fortitude.
expected and soon accepted.

CP teaches patience more than

CP transforms from
coding.
placement/contest preparation
But it's incredibly interesting so into fun and surprisingly,
you keep going. quickly.

3
Courses we offer at AlgoZenith:
We currently have 3 courses ongoing on the platform:
- AZ-201 : Applied Algo & DS for Internships and Placements.
- AZ-202 : Applied Algo & DS for Coding Competitions.
- AZ-301 : Competitive Programming for Advanced Programmers*

Brochure for AZ - 301

Deliverables in courses AZ-201 and AZ-202:

1. We will follow a mix of Pre-Recorded Video lessons and Live sessions to cover the
Content. Recording of all the video lessons will be present on the Learning platform
for all the purchased modules until the end of the Batch. The frequency of Live
sessions will depend on topics to be covered and requirements.

2. The base set of practice problems on the Learning platform to strengthen the
concepts learned in the Recorded and Live Sessions.

3. Personalized Training Set for those who cover the base set and want to learn more
variants and techniques. (You will have to complete the base set problems first).

4. Doubts Clearing will primarily be on 3 Levels

a. Common Discussion forum for the batch you are enrolled in. (Peer Learning)
b. Discussion with the mentor group. (Personal)
c. Weekly Live Doubt Clearing on some problems that mentors feel should be
discussed.

5. Regular contests will be organised (bi-weekly). You can give it live or virtual. Also at
the end of every Module, revision contests will be present to make your grasp
concrete.

6. Curated Problems either made by experts or collected from previous year

internship/placement, Practice sites like Codeforces, Topcoder, Spoj will be provided
along with the materials that will make you learn new concepts and improve your
implementation skills. No hunting for good problems anymore!

4
Course Curriculum
AZ-201 : Applied Algo/DS for Internships and Placements
Prerequisites :
● Understanding of C / C++ programming language.
● Basic Programming Course (any entry level college course on programming).
● Commitment and Dedication.
Target Audience :
Ideal for those who want focused training for Coding tests/Interviews and are
targeting top software companies in the upcoming Internship and Placement
seasons.

Overview (what should you expect at the end) :

You will be prepared to develop strong problem solving, Programming, Debugging
and Interview facing skills.

Topics Covered :
- Time and Memory complexity
- STL Applications
- Run down on Available STL constructs.
- Application on actual programming problems.
- Foundational Mathematics
- Modulo Arithmetic.
- Binary exponentiation.
- Common Bugs to beware of.
- Prefix and Partial Sums
- Bit Manipulation
- Searching and Sorting
- Divide and Conquer
- Binary Search
- Sliding Window and Two pointer.
- Combinatorial and Number theoretic Maths.
- Sieve of Eratosthenes.
- Greedy Algorithms,Ideas and Common Observations.
- Brute force, Recursion and Backtracking.
- Dynamic Programming
- Standard States and Classical Problems
- Reducing New problems and Thinking process
- Common State-Ideas for New problems.
- Optimizations using Prefix Sums and Deque.

5
 - Bitmask Dynamic Programming.
- Digit Dynamic Programming.
- Tree Dynamic Programming.
- Graph
- Graph traversal and Algorithms:
- Depth First Search
- Breadth First Search
- Multi-Sourced Variants
- Disjoint Union Find
- DAGs and Topological Ordering.
- DFS and Kahn’s Algorithm.
- DP + DAG based problems
- Spanning Trees and MST.
- Shortest Path Algorithms.
- 0-1 BFS.
- Dijkstra’s Algorithm.
- Bellman Ford & Floyd Warshall.
- String Algorithms.
- Trie and its String and XOR based applications.
- Data Structures
- Segment Tree and Lazy propagation.
- Binary Index Tree.
- Sparse Table.
- Linked List.
- Binary Tree.
- Stack, Queue, Deque and Standard Techniques.
- Most Common Problems for Interviews.
- Algorithmic Design Problems.
- Object-oriented programming.
- Mock Interview for Practice.

Expected time Taken : 4-6 months.

Expected Efforts Needed : 3-5 hours per day.
Cost : Rs. 16000 Rs. 10000 - Rs. 12000 (GST and 25% discount included).
• Pay as you go! Monthly payments available with flexible payment
options. Leave anytime without any fees! See Payment Details Section
for more information.

6
INTERESTED? FILL UP THIS FORM. ONE WEEK CONTENT FREE !!
URL : https://forms.gle/8A9VWPUc2b4mjqVr8

AZ-202 Applied Algo/DS for Coding Competitions

Prerequisites
● Understanding of C / C++ programming language.
● Basic Programming Course (any entry level college course on programming).
● Commitment and Dedication.
Target Audience
This is for those who have learnt the starting materials and want to fastrack their
improvements, so that they can perform better in competitions.

Overview (what should you expect at the end)

Strengthening the Important topics needed in Competitive Programming and
Learning various New applications of them.

Topics Covered
- Time and Space Complexity.
- STL Applications.
- Binary Search Applications.
- Prefix and Partial Sums.
- Bit Manipulation.
- Divide and Conquer.
- Two Pointer and Sliding Window.
- Brute Force, Recursion and Backtracking.
- Mathematics
- Combinatorics and Number Theory.
- Sieve of Eratosthenes.
- Probability and Linearity of Expectations.
- Matrix Exponentiations.
- Permutations.
- Linear Recurrence.
- Greedy Algorithms.
- Dynamic Programming
- Standard States and Classical Problems
- Reducing New problems and Thinking process
- Common State-Ideas for New problems.
- Optimizations using Prefix Sums and Deque.

7
 - Bitmask Dynamic Programming.
- Digit Dynamic Programming.
- Tree Dynamic Programming.
- State Space Reduction.
- Sorting Conditions Based DP Problems.
- Non-Trivial DP Applications.
- Graphs
- Graph traversal and Algorithms:
- Depth First Search
- Breadth First Search
- Multi-Sourced Variants
- Disjoint Union Find
- DAGs and Topological Ordering.
- DFS and Kahn’s Algorithm.
- DP + DAG based problems
- Spanning Trees and MST.
- Shortest Path Algorithms.
- 0-1 BFS.
- Dijkstra’s Algorithm.
- Bellman Ford & Floyd Warshall.
- Building Graphs with Non-Trivial State Space.
- Strongly Connected Components in Directed Graphs.
- Biconnected Component (Articulation Point, Bridges).
- Euler Tour/Cycle.
- LCA and Binary Lifting.
- Trie and its String and XOR based applications.
- Disjoint Set Union.
- Data Structures
- Segment Tree and Lazy propagation.
- Binary Index Tree.
- Sparse Table.
- Sqrt Decomposition.
- Game Theory.
- String Algorithms (KMP, Hashing, Z - Algorithm).
- More Techniques if time Permits.

Expected time Taken : 4-6 months.

Expected Efforts Needed : 3-5 hours per day.
Cost : Rs. 16000 Rs. 10000 - Rs. 12000 (GST and 25% discount included).

8
 • Pay as you go! Monthly payments available with flexible payment
options. Leave anytime without any fees! See Payment Details Section
for more information.

INTERESTED? FILL UP THIS FORM. ONE WEEK CONTENT FREE !!

URL : https://forms.gle/8A9VWPUc2b4mjqVr8

Payment Details for AZ-201 and AZ-202 :

- After Enrollment, Content equivalent to 1 Week is FREE as a Demo (Video Material

and few of the practice problems). This will be sent to you by mail before the Batch
starts.
- You can watch the content and decide whether you would like to continue
with the purchased content within the first week.

- There are two types of purchase options available. You can choose any of them,
according to your convenience.
- Single Step Purchase
- For the first module, 1 week equivalent course content is free of cost.
For continuing Module 1, you have to make payment of Rs. 2500*
before the end of Week 1.
- The cost of the whole course is Rs. 10000 if you purchase the whole
course (all Modules) within the first four weeks after enrollment.
- Rest everything applies the same as the Multi-Steps Purchase.

9
- Multi-Steps Purchase
- At the end of each module either you can continue or drop the
course.
- Prices of Modules are
- 1 Week Equivalent Course Content FREE
- Module 1 (Remaining Content) Rs. 2500*
- Module 2 Rs. 3000*
- Module 3 Rs. 3000*
- Module 4 Rs. 3500*
- Except for the first module, you first have to make payment to learn
the content in the next module.
- For the first module, 1 week equivalent of course content is free of
cost. For continuing Module 1, you have to make payment of Rs.
2500* before the end of Week 1.
- You have to make a purchase of the next Module within the 6 Weeks
of the unlock of the previous Module. (You have a maximum of 6
Weeks to complete each module). If you fail to purchase the next
module after 6 weeks, the batch ends for you.
- The release date of the modules will be fixed. You are expected to
wait till the release date even if you complete early. Each module will
be unlocked after exactly 4 Weeks of the unlock of the previous
module. So you are expected to complete one module within 4 Weeks
days.
- No Refund Guarantees are made for the previous purchased Modules.
- Modules are available in the order 1, 2, 3, 4. You cannot purchase the
Module until you have purchased the previous Modules.
- Access to the course content and doubt support is not for lifetime,
only till you are enrolled in the batch.
- Your access to the batch ends
- After 6 Weeks if you purchase just 1 module.

10
 - After 12 Weeks if you purchase just 2 modules.
- After 18 Weeks if you purchase just 3 modules.
- After 6 months from the start date if you purchase all
modules.
- We have extension plans if you want to keep the access for 4 weeks
more.
- All the Prices mentioned are GST included. Any Discount applies on
the Striked Off prices and hence the Rs. 12000 price is after applying
25% discount.

11