Competitive Programming- Beginner | Amar iSchool

Competitive Programming- Beginner

In this course, we will teach young programmers to develop their problem-solving skills. During this course, you’ll learn everything need to know to participate in competitions, what are their rules and how to manage time.

Beginner 0(0 Ratings) 3 Students enrolled
Created by Tariq Sajal Last updated Fri, 04-Jun-2021 Bengali
What will i learn?
  • Learn everything needed to participate in real competitions
  • Able to write efficient, reliable, and compact code as well as manage your time
  • Able to apply algorithmic ideas to problems
  • Compete 12+ contest based problem solve

Curriculum for this course
0 Lessons 00:00:00 Hours
Introduction to CP and C++ STL
0 Lessons 00:00:00 Hours
Requirements
  • C, C++ Language
+ View more
Description


TopicDetailsClass 
Introduction to CP and C++ STL
i) Introduction to CP
ii) Time and Memory complexity analysis
iii) Intro to Basic Data Structure (Stack/Queue/Vector etc)
iv) Basic C++ STL and its application
2
Binary Operators
i) Binary Number System
ii) Bitwise Operators and their application
iii) Problem-solving
1
Function and Recursion
i) Intro to function and Recursion
ii) Backtracking
iii) Problem-solving
2
Greedy Technique and
Sorting algorithms

i) Intro to greedy technique
ii) Insertion sort, counting sort, merge sort
iii) Problem-solving
1
Searching Technique
i) Binary search and its application
ii) Problem-solving
2
Dynamic Programming
i) Intro to DP
ii) Knapsack and coin change
iii) Longest Increasing Subsequence (O(n^2) & O(n*logn))
iv) Bitmask dp
v) Problem-solving

5
Number Theory and
Modular Arithmetic

i) Calculating GCD efficiently
ii) Modular arithmetic
iii) Modular exponentiation and inverse mod
iv) Factorization and problem-solving
v) Sieve
v) Prime factorization and problem solving
vi) totient function and problem-solving

4
Combinatorics
i) Inverse factorial
ii) Problem-solving
1
Graph Theory
i) Intro to Graph Theory
ii) DFS/BFS
iii) Connected Component
iv) Shortest Path
v) Graph Bicoloring
vi) Longest Path Problem (Tree)
vii) Problem Solving
5
Data Structure
i) Sliding Range Query
ii) Sparse Table

2


Total class= 25


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

Codeforces handle : _no0b

Regional 2019 team : BUET Fractals

Regional 2019 rank : 4

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