sleepy-coder-101 / Competitive_programing

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

ROAD-MAP for Students

Topics of Competitive Programming

    Time Complexity Analysis

STL Library

  • Maps
  • Sets
  • Vectors
  • Sort
  • Custom Sort Function
  • Priority Queue
  • Lower bound and Upper Bound
  • Basic Algorithms

  • Binary Exponentiation
  • Modular Arithmetic
  • Modulo Multiplicative Inverse
  • GCD and Prime Numbers
  • Sieve of Eratosthenes
  • Prime Number algorithms
  • Number Theory (Questions on Number theory count = 10-20)

  • Modular Operations
  • GCD and LCM
  • Ncr calculations
  • NcR % P algorithm
  • Matrix Exponentiation to find Nth Fibonacci
  • Questions on Matrix Exponentiation (Count = 5)
  • Sorting

  • Bubble Sort
  • Merge Sort
  • Quick Sort
  • Count Sort
  • Arrays

  • Kaden’s Algorithm
  • Prefix Array
  • Difference Array
  • 2D Prefix array
  • Questions from GFG arrays! (Microsoft + Amazon)
  • Linked List (Very Important for Interviews)

  • Singly Linked List
  • Doubly Linked List
  • Reverse a Linked List
  • 20-25 Questions From Linked List from GFG
  • Stack

  • Infix Postfix Prefix Questions
  • Implement a stack
  • Questions on Stack (20-25)
  • Queue

  • Implementation
  • Questions on leetcode
  • Trees

  • Binary Tree
  • Iterations on Binary Tree
  • N ary Trees
  • AVL Trees and Red Black Trees
  • N ary trees
  • DFS and BFS on trees
  • Segment Trees with Lazy propagation
  • Disjoint Set Union
  • LCA using Binary Lifting
  • Square Root Decomposition
  • Mo’s Algorithm
  • Centroid Decomposition
  • Heavy Light Decomposition
  • Dynamic Programming

  • Fibonacci Series
  • Knapsack Problem
  • Longest Common Subsequence
  • Longest Common Substring
  • Longest Palindromic Subsequence
  • Longest Palindromic Substring
  • Subset Sum Problem
  • Road Cutting problem
  • Coin Change Problem
  • Egg dropping Problem
  • Maximum Cost Matrix
  • Questions On Dynamic Programming (20-30)
  • Graphs

  • Graph storing
  • Dfs and Bfs on Graphs
  • Dijkstra
  • Floid Warshal
  • Bellman Ford Algorithm
  • Minimum spanning tree using Kruskal Algorithm
  • Bipartite matching algorithms
  • Min Flow max Flow
  • Questions
  • String

  • Palindrome Matching
  • KMP algorithm
  • Tries
  • Geometry

  • Basics
  • Convex Hull
  • Sweep Line
  • Questions
  • Maths

  • Fast Fourier Transform
  • Gaussian Elimination
  • Game Theory

  • Implementation Problem

    AIMS

    15 questions per day from leetcode


    APRIL

  • Array
  • Linked List
  • Stack
  • Queue
  • DBMS
  • JAVA
  • HTML , CSS , JAVASCRIPT
  • MAY

  • Trees
  • Graphs
  • Backtracking
  • React
  • Node
  • Mongodb
  • JUNE

  • Dynamic Programming
  • String
  • Project (starts)
  • JULY

  • Practice (DSA)
  • Project (continuation/ends)
  • About


    Languages

    Language:C++ 98.9%Language:Shell 1.1%