Why Competitive Programming?, How To Approach A Problem In Contest, Various Types Of Errors

Introduction to Recursion, Recursion and PMI, Fibonacci Number, Recursion and Arrays

Order Complexity Analysis, Theoretical Analysis, Linear Search time complexity, Insertion Sort time complexity, Selection Sort time complexity, Theoretical Analysis - Recursive Algorithms, Merge Sort Time complexity, Fibonacci Time Complexity Analysis, Space Complexity Analysis, Merge Sort Space Complexity Analysis, Fibonacci Space Complexity Analysis, Kadane's Algorithm

STL - Data Structures, STL - Functions, Hussain Set, Voters List, Permutation & Palindrome

Aggressive Cows, Inversion Count

Recursion and Strings, Merge Sort Algorithm, Quick Sort Algorithm, Strings, Return Subsequences of a String, Return Keypad Approach

Backtracking ( N-Queen), N-Queen Code, Rat In A Maze code

Flip ith bit, Check Odd-Even, Introduction & Shift Operators, Clear All Bits From LSB, Remaining Bitwise Operators, Check Power of 2, Check nth bit

Modulo Operations, Modulo Properties, Modulo Operations - Continue, Number Of Balanced Binary Trees

Basics Of Dynamic programming: Fibonacci Numbers, AlphaCode, Longest Increasing Subsequence, Coin Change And StairCase, Minimum Cost, Magic Grid, Maximum Sum Rectangle, Longest Common Subsequence, Knapsnack - Iterative, Subset Sum

Introduction To Greedy Techniques, Minimum Absolute Difference In Array, Nikunj And Donuts, Fractional Knapsack, Weighted Job Scheduling

DP With Bitmasking, What is Bit Masking?, Minimum Cost for Jobs, Mehta and Bank Robbery

Introduction to Segment Tree, Update On A Segment Tree, Size Of Segment Tree, Sum Of Squares Video, Maximum Sum in Subarray, Lazy Propagation, How To Build A Segment Tree, Query On A Segment Tree, Segment Tree Max Pair Sum

Introduction to Fenwick Tree, Coordinate Compression, OrderSet Problem, Distinct Query

Return all connected components, Get Path - BFS, Get Path - DFS, Has path, Solution: BFS Traversal, DFS - Adjacency Matrix, Graphs Terminology, Graphs Introduction, Graphs Implementation, BFS Traversal, BFS & DFS for disconnected graph, Weighted & Directed Graphs

Dijkstra’s Algorithm, Prim's Algorithm, Kruskal's Algorithm, Minimum Spanning Trees, Detect Cycle, Union Find Algorithm

Permutation Swaps, Connected Components, Fill Matrix Question, Connected Horses, Strongly Connected Components, Bipartite Graph

Longest Prefix Suffix, Z-Algorithm Pattern Matching, Longest Palindromic Substring Basics, KMP Algorithm, Pattern Matching Basics, Longest Prefix Suffix

Search Engine, SUBXOR, Maximum XOR Subarra, XOR Maximum Pair, Tries & XOR

GCD(Euclid Algorithm), Diophantine Equations, Multiplicative Modulo Inverse, Find Prime Numbers From 1 To N, Sieve Of Eratosthenes, Divisors Of Factorial, Advanced GCD, Euler's Totient Function, Segmented Sieve,Wilson's Theorem, Modular Exponentiation, Nth Fibonacci Number - Log(n), Fermat’s Little Theorem, Matrix Exponentiation, Optimized Power Function, Recurrence Relations

Othello, Othello Evaluation Function, MinMax Algorithm, Sprague Grundy Theorem, Grundy Numbers, Game Of Nim, Intro To Game Theory, Proof Of Nim Formula, Evaluation Function In MinMax Algorithm

Convex Hull, Area Of A Polygon, Distance Of A Point, Intro To Computational Geometry, Intersection Of Two Lines