Competitive Programming- Advanced | Amar iSchool

Competitive Programming- Advanced

If you want to improve your algorithmic problem-solving skill. This course for you. This course helps you to enhance your problem-solving skill. After completing this course, you will be able to solve hard coding problems efficiently and participate in global coding competitions such as ACM-ICPC, IPC, and more..

Advanced 0(0 Ratings) 29 Students enrolled
Created by Ashiqul Islam Last updated Tue, 20-Apr-2021 Bengali
What will i learn?
  • Learn to solve advanced-level problems
  • Focus on various type of problems
  • This can help you to achieve better rank in programming contests
  • Learn algorithmic and data-structure problems which can improve your ranking in programming contests
  • Become an expert problem solver
  • Prepare for ACM-ICPC, Code Jam, Hacker Cup etc
  • Compete 12+ contest based problem solve

Curriculum for this course
0 Lessons 00:00:00 Hours
AdHoc
0 Lessons 00:00:00 Hours
Requirements
  • Codeforces Rating 1400++
+ View more
Description

Topics

Subtopics

AdHoc

 1. 1D,2D,3D Cumulative Sum

2. 1D,2D,3D Difference Array

3. Array Compression

4. Bitwise Operations, Iterating over all subset efficiently

5. Properties of exclusive or

6. Contribution Technique

7. Exchange Argument

8. Union of two segment, rect

9. Bracket Sequence

Search Techniques

1. Binary Search

2. Ternary Search (when it doesn’t work)

STL

1. Vector (sort, lower_bound, upper_bound, erasing duplicates, number of occurrence of a value)

2. Pair

3. Set (find, erase, lower_bound, upper_bound)

4. Map (iterating over map)

5. Priority queue

6. Deque , Stack, Queue  -> finding the immediate small/large element, is a bracket sequence balanced

7. Ordered Set

8. Iterating over all possible permutation / combination

9. Magic of Bitset (How does bitset really work)

Graph

1. Depth first search (Start time, End time, back edge, forward edge, checking whether a node is in another’s subtree or not, Euler Tour of a tree)

2. Breadth first search (shortest path length, retrieving shortest path, shortest path tree, cross edge, 0-1 bfs)

3. Articulation Point, bridge using dfs

4. Dijkstra (shortest path dag)

5. Floyd-Warshall (finding connectivity using bitset)

6. Kruskal’s Algorithm (Properties of minimum spanning tree)

7. Traversing a dense graph (with bitset/set)

8. Euler Tour of a graph

String

1. Hashing (Polynomial Hash, Hash of a set of integers)

2. Trie (Can you implement a set using trie ?)

3. String matching with bitset

4. KMP

5. Aho corasick

Data Structure

1. Basic Segment tree

2. Merge Sort Tree

3. Segment tree with Lazy Propagation

4. Square Root Decomposition

5. Sparse Table (min, max, and, or, gcd, lca)

6. Disjoint Set union (Small to Large Technique)

7. Flattening of a tree and maintaining info

8. Divide and Conquer Approach for trees (centroid decomposition)

Number Theory

1. Divisibility

2. Factorization (naive, O(√n))

3. Sieve, factorization

4. Bezout’s Identity

Combinatorics

1. Modular Arithmetic

2. Factorials and Modular Inverse

3. Stars and Bars Theorem and variation

4. Sum in the same row/column of pascal triangle

5. Basic Inclusion/Exclusion

Dynamic Programming

1. Knapsack, Different Variations (Deque, Subset Division, Bitset)

2. Interval Dp

3. Bitmask Dp

4. Dp with Some Greedy Observations

5. Optimizing memory for Dp

Game Theory

1. Basic Game Theory (winning, losing state and their strategy)

2. Nim (variations of Nim)

3. Grundy

 

+ View more
Other related courses
00:00:00 Hours
Updated Fri, 04-Jun-2021
0 2 ৳5000
00:00:00 Hours
Updated Tue, 20-Apr-2021
0 0 ৳5000
00:00:00 Hours
Updated Mon, 14-Jun-2021
0 21 Free
00:00:00 Hours
Updated Tue, 08-Jun-2021
0 0 ৳2000 ৳500
00:00:00 Hours
0 0 ৳5000 ৳3000
About the instructor
  • 0 Reviews
  • 29 Students
  • 1 Courses
+ View more

ACM ICPC world finalist 2019

ACM ICPC world finalist 2020

Student feedback
0
Average rating
  • 0%
  • 0%
  • 0%
  • 0%
  • 0%
Reviews
৳5000
Buy now
Includes:
  • Advanced
  • Online class
  • 0 Lessons
  • Full lifetime access
  • Access on mobile and tv
  • Certificate after completion