Home » Development » Competitive Programming for Dummies | 1. Arrays

[Free] Competitive Programming For Dummies | 1. Arrays

Learn the Basics of Competitive Programming from scratch for Coding Rounds in Placements and for other Coding Contests – Free Course

Added on September 26, 2023 Development 2 min read

What you’ll learn

• Knowledge about C++ language
• Skill of writing your own Project using C++
• Ability to develop algorithm for any given problem
• Proficient in basic concepts of any programming language
• Develop and Work on Real-World applications of C++ language
• Getting ready for Coding round of Your College Placements

Requirements

• Students should be able to understand English at least to some average extent
• No knowledge of programming is required prior to taking up this course
• Students should have some basic knowledge on operating the computers
• Before enrolling, please make sure that you know how to use your PC desktop, deal with software installations and file handling

Description

Github Repository : /CyberkidAdithya/CompetitivePython

In this course, you will be learning everything you need in order to become an expert coder in C++ for both placements and competitive programming contests. I will covering a wide range of important concepts in Programming and we will also be looking into problems from popular programming contests from Google Kickstart, Codechef, Codeforces etc.

Few of the CONCEPTS which I will be covering are as follows:

Basic Programming

Object Oriented Programming

Time && Space Complexity

Loops, Arrays, Math, Probability

Circular Arrays, Matrices, Strings

Permutations && Combinations

Bit Masking && Bit Manipulations

Recursion && Backtracking

Dynamic Programming

Prefix Sum, Precomputations

Square Root Decomposition

Sliding Window

Modular Arithmetic

Number Theory, Geometry

Greedy Approach, Bruteforce

Two Pointer Approach

Linked Lists, Stacks, Queues

Sets, Heaps && Priority Queues

Hashing, Trees and Graphs

Binary Search Trees, Search Trees

Tries, Segment Trees, Fenwick Trees

Minimum Spanning Trees, Suffix Trees

Multiset

Few of the ALGORITHMS which I will be covering are as follows:

Divide and Conquer

Searching, Sorting

BFS, DFS, Traversal

Shortest Path, Dijkstra

Kadane, Manhattan Distance

Gaussian Elimination

Backtracking

Floyd Warshall

Pigeonhole

Euclidean Algorithm

Topological Sort

Prim, Krushal

Chinese Remainder Theorem

Sieve of Eratosthenes

Determinants

Logarithmic Exponentiation

Maximizing Problems

Fast-Fourier Transform

In this course, you will be learning everything you need in order to become an expert coder in C++ for both placements and competitive programming contests. I will covering a wide range of important concepts in Programming and we will also be looking into problems from popular programming contests from Google Kickstart, Codechef, Codeforces etc. By the end of this course, you will have a very good knowledge in CP.