
Analyze time complexity with Big O and Big Theta, and learn Kadane's algorithm. Study binary search, sieve of Eratosthenes, arrays, and the C++ STL (vectors, queues, stacks) plus recursion.
Explore time complexity in competitive programming, compare big O and big theta representations, and order common functions from constant to factorial to choose efficient algorithms.
Hello students,
In this course, we are using the"bits/stdc++" header file but due to some reasons, if you are not able to include the mentioned header file in your compiler, Don't Worry.
Just add
#include <iostream>
#include<math>
#include<vector>
#include<queue>
#include<stack>
in your code at the start.
Explore arrays and common operations including traversal, summing elements, searching for an element, and reversing arrays using iterative and recursive approaches with two-pointer techniques, plus a discussion of time complexities.
Learn to find the missing number in a 1 to n sequence using the sum formula n(n+1)/2. Implement the solution in C++ with a for loop to compute the difference.
Kadane's algorithm computes the maximum subarray sum with an iterative dynamic programming approach, updating current max and max so far for contiguous subarrays.
Explore binary search as a divide and conquer method for sorted arrays, using pseudo code with low, high, and mid to find x in O(log n) and not found handling.
Explore the sieve of eratosthenes in C++ to find primes up to n by marking multiples from i squared, with time complexity O(n log log n).
Competitive programming is the art of solving problems. It is a kind of brain exercise and every programmer takes an effort to ace the competitive programming competitions. In these competitions, what matters actually is the space or memory and the time that the code takes. The best solution is always the one in which both are efficient.
If you are the one who is an aspiring pro coder, the command of basics is all that matters.
This is the course made for complete beginners in C++ programming and covers all the basic concepts such as time complexity analysis, important algorithms such as Kadanes Algorithm and Sieve of Eratosthenes Algorithm, C++ Standard Template Library, and Recursion.
In each video tutorial, I will explain one concept and solve an example related to it i.e. implement code for the given problem with an explanation of each step. For every solution, I will discuss the possible recursive approaches and optimized approaches with smaller time complexities.
By the end of this course, a learner will be able to solve easy to medium-level problems on competitive coding websites such as Codechef and Codeforces. So, put yourself on the track to learning something productive and beneficial.
Enjoy the learning !!