HomeGoals

Home

Goals

SignUp / Login

Competitive programming live specialization specialization
Live Class

Competitive Programming

4.8

(150 ratings)

Learn about Recursive Functions, linear and non-linear data structures such as Hash Tables and Heap. Learn how to solve complex problems using backtracking algorithms, divide and conquer algorithms, greedy algorithms, and dynamic programming.


Features

Shareable Certificate
Earn a Certificate upon completion
100% Online Live Class
Mentor driven live classes
Instant Doubt Resolution
Get your doubt clarified instantly
Practice Material
Get Notebook to revise, practice, test yourself and interact with mentor

Live Session to be Scheduled

What You Will Learn

Goal - Competitive Programming - C++
What you will learn

Competitive Programming

  • Learn how to create a recursive function, and how it works.
  • Instead of creating queues, stacks every time, learn how to use them from STL (Standard Template Library)
  • Learn more linear (Hash Tables) and non-linear (Heaps) data structures, where and when to use them
  • Learn how to solve complex problems using backtracking algorithms, divide and conquer algorithms, greedy algorithms and dynamic programming.

PREREQUISITE KNOWLEDGE
  • Laptop with good internet connection
  • Introduction to C++

Competitive Programming Batch Schedule

Batch Starting at
Recursion and STL

Not Scheduled | 60 min

Function Calls and Stacks, Recursion, Complexity of a recursive algorithm, Tree Traversal using Recursion, Templates in C++, Standard Template Library (STL), STL - Containers (Vectors, Deque, List), STL - Algorithms (sort, binary_search).

Recursion and STL

Function Calls and Stacks, Recursion, Complexity of a recursive algorithm, Tree Traversal using Recursion, Templates in C++, Standard Template Library (STL), STL - Containers (Vectors, Deque, List), STL - Algorithms (sort, binary_search).

Not Scheduled | 60 min
Backtracking

Introduction to Backtracking, Types of problems, Backtracking Problem Identification, Applications of Backtracking, Recursive Backtracking, Iterative Backtracking, n-Queen Problem using backtracking, Sudoko using backtracking.

Not Scheduled | 60 min
Divide and Conquer

Introduction to Divide and Conquer, Steps in Divide and Conquer Algorithm, Divide and Conquer Examples, Merge Sort, Quick Sort, Comparison of Merge, Quick Sort.

Not Scheduled | 60 min
Hash Table

Insert, Search, Delete time complexities Comparision, Introduction to Hash Table, Hash function, Hash function Applications, Hash Table (Insertion, Search, Deletion), Collisions in Hash Table, Chaining, Open Addressing, Linear Probing, Quadratic Probing, Double Hashing, Hash Table from STL.

Not Scheduled | 60 min
Heaps

Introduction to Heap, Applications of Heaps, Heapify Function, Heap Sort, Priority Queue, Heaps from STL.

Not Scheduled | 60 min
Greedy Algorithm

Introduction to Greedy Algorithm, Steps to achieve Greedy Algorithm, Properties required for the Greedy Algorithm, When to use Greedy Algorithm, Applications of Greedy Algorithm, Fractional Knapsack Problem, Shortest path between two nodes, Dijkstra's Algorithm, Complexity Analysis of Dijkstra's Algorithm.

Not Scheduled | 60 min
Dynamic Programming - Part 1 [Longest Common Subsequence]

Introduction to Dynamic Programming, Memoization, Tabulation, Memoization vs Tabulation, Fibonacci using Recursion, Fibonacci using DP (Memoization), Fibonacci using DP (Tabulation), Introduction of Longest Common Subsequence (LCS) Problem, LCS - Brute Force Solution, LCS - DP Solution.

Not Scheduled | 60 min
Dynamic Programming - Part 2 [Knapsack problem]

Knapsack Problem, Fractional Knapsack Problem, 0/1 Knapsack Problem, 0/1 Knapsack Problem - Brute Force Solution, 0/1 Knapsack Problem - DP Solution (Memoization), 0/1 Knapsack Problem - DP Solution (Tabulation), Complexity Analysis.

Not Scheduled | 60 min
Certificate

Competitive Programming


Want to know more?