Description
In this course, you will learn :
- What are the essential tools for learning and practising competitive programming?
- How Do You Succeed in Competitive Programming? Using Leetcode, CodeForces, and so on.
- How to use STL objects such as vectors, pairs, and so on.
- Practice problems based on data structures and algorithms, as well as problems based on the algorithmic approach.
Syllabus :
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)