This is an introductory level course which will teach the basics of problem solving and the concepts revolving it.

What you will learn

What are the basic tools needed to learn and practice competitive programming?

How to excel in Competitive programming? Using Leetcode, CodeForces, etc.

How to use STL such as vectors, pairs, etc.

Practice problems based on Data Structures and Algorithms and also Algorithmic approach based problems.

Description

This is an introductory level course which will teach the basics of problem solving and the concepts revolving it. The videos, problems, etc. will be updated very frequently. All the important topics required such as STL which includes topics such as Vectors, Pairs, HashMap, etc. are involved in this course.Β Don’t worry if you are new to coding, YOU have come to the right place. Every problem we solve, increases your critical thinking skills, problem solving skills and also more understanding about trying different approaches to solve a certain problem whilst keeping the provided constraints in mind.

  • An explained pseudocode which has the brief objective and our approach to solve the problem.
  • The code I have written previously as well as the live code we have written.
  • An full in-depth explanatory video which has the proper explanation to each and every line of code written and also the revolving concepts, other approaches to solve, mistakes many students commit, etc.
  • Other materials to refer to obtain more information, other solved problems on it, etc.

We know coding is no joke when it comes to contests, so I’ll take the duty to make you contest ready and also solve problems in multiple ways.


Get Instant Notification of New Courses on our Telegram channel.


No better sutra to learn coding, apart from practicing it. And I’ll provide you exactly with that. Let’s learn to code together. Welcome on-board!

English
language

Content

Introduction

Introduction
What is a Template and Why is it needed?

Most Basic Competitive Programming questions!

Finding number of common factors when 2 numbers are given.
Finding number of common factors (Optimal way)
GCD of two numbers (2 Ways)
Finding factors of a number (2 Ways)
Listing out all subarrays for a given array.
Bruteforce method for subarray sum.
Prefix Sum Approach for subarray sum.
Kadane’s Algorithm for subarray sum.
Pascal’s Triangle (Only Printing)