Dev Skill - Competitive Programming

Competitive Programming - Intermediate

Intermediate

Tk. 6,000

Registration will resume when new batch is announced

If you want to improve your basic algorithmic problem solving skill and improve in National contests and Codeforces contests, you should enroll in this course. We will conduct the course in a suitable way even for the very beginners. After completing this course, you should be able to solve the basic algorithmic and data-structure problems and have a clear idea of what to learn for the Advanced Level. Course highlight: Learn to solve problems Assignment for every lesson taught in the class We will help you debug in the beginning It will give you a head start for your university algorithm and data-structure classes

Who Can Join This Course?

C/C++ programming language

Course Outline

Complexity

i) Time/Memory Complexity, examples of nested loops and recursions

STL

i) introduction, mechanism, library functions
ii) vector
iii) Stack/queue/deque
iv) Priority Queue
v) set/map/multi/unordered

Binary Search

i) Binary Property
ii) Lower and upper bound
iii) Using binary property in complex problems

Ternary Search

i) Ternary Property
ii) Using ternary property in complex problems

Recursion

i) Recursive equation
ii) Divide and Conquer
iii) Quick select
iv) Inversion count

Sorting

i) Recap
ii) Merge sort
iii) Quick sort

String

i) Substring, Subsequence, substring, palindrome, anagram recap
ii) Matching
iii) Hashing

Greedy

i) Prove/disprove greedy approach
ii) Task scheduling
iii) Fractional knapsack
iv) Coin Change
v) And many more

Number Theory

i) Sieve of Eratosthenes
ii) Factorization
iii) Fermat's little theorem
iv) Modular Arithmetic
v) Totient function

Disjoint set union

i) Mechanism
ii) Various applications

Graph theory

i) Introduction and definitions
ii) Storing graphs

Graph Travarsal and shortest path

i) DFS/BFS
ii) Various properties and applications
iii) Dijkstra

Backtrack

i) Brute force
ii) Permutation generation
iii) Graph coloring

Dynamic programming

i) Introduction, properties, states
ii) Ancestors of DP: Fibonacci, Factorial, nCr
iii) Classics and variations

Segment Tree

i) Basic segment Tree

Instructors

Md Sadman Sakib

I am Md Sadman Sakib, an engineering graduate from University of Dhaka, specialized in Computer Science & Engineering. Currently working as a Software Engineer at Google. I love to learn,code,eat and travel! My CF Handle: reverse_macro

LinkedIn Profile