Competitive programming

Join our Competitive Programming Course for beginners. Master algorithms, data structures, and problem-solving techniques. Prepare for coding contests and excel in the world of competitive programming. Enroll today!

Book Your Seat

Register now

Course Registration

45

Classes

3 Times

Weeks

All

Skill Level

English

Language

Overview

Designed for aspiring programmers, computer science enthusiasts, and anyone seeking to enhance their problem-solving skills, this course is your gateway to success in competitive programming competitions and real-world software development challenges.

 

Work on a plethora of practice problems and participate in simulated contests to apply your knowledge, improve your problem-solving speed, and simulate real competitive programming environments. Prepare to unlock your potential, tackle complex problems with confidence, and join the ranks of successful competitive programmers.

 

Enroll in our Competitive Programming course today and embark on a rewarding journey of intellectual growth and skill development. Your coding adventure awaits!

Completing this course will help you:

Who is the course for?

This course is designed for individuals who are passionate about computer programming and problem-solving. No matter your starting point, if you have a curiosity for problem-solving and a desire to advance your programming skills, this course provides the guidance, resources, and community to help you achieve your goals. Join us on this exciting journey into the world of competitive programming and algorithmic excellence!

Play Video

Learning Path

  • Analysis of Algorithm
  • Asymptotic Notations
  • Analysis of common loops
  • Space Complexity
  • Count Digits
  • Palindrome Numbers
  • Factorial of Numbers
  • GCD of Two Numbers
  • LCM of Two Numbers
  • Check for Prime
  • Prime Factors
  • Sieve of Eratosthenes
  • Computing Power
  • Bitwise Operators: Operation of AND, OR, XOR , Left Shift, Right Shiftoperators
  • Check Kth bit is set or not.
  • Count Set Bits.
  • To check whether a number is a power of 2 or not.
  • Odd occurrences in an array.
  • Two numbers having odd occurrences in an array.
  • Generate power set using bitwise operators.
  • Introduction to Recursion
  • Applications of Recursion
  • Writing base cases in Recursion
  • Print n to 1
  • Print 1 to n
  • Tail Recursion
  • Checking Palindrome
  • Sum of digits
  • Rod cutting
  • Subsets of a set
  • Tower of Hanoi Problem
  • Introduction and Advantages
  • Types of Arrays: Fixed-sized array and Dynamic-sized array
  • Operations on Arrays:Searching, Insertions, Deletion and Reversing
  • Left Rotation of the array by 1
  • Check if Sorted
  • Left Rotation of the array by D places
  • Leaders in an Array
  • Maximum Difference Problem
  • Frequencies in Sorted Array
  • Stock Buy and Sell Problem
  • Trapping Rainwater Problem
  • Maximum Consecutive 1s
  • Maximum Subarray Sum
  • Longest Even-Odd Subarray
  • Maximum Circular sum subarray.
  • Majority ElementMinimum Consecutive Flips
  • Sliding Window Technique
  • Prefix Sum Technique
  • Introduction to Matrix
  • Multidimensional Matrix
  • Pass Matrix as Argument
  • Printing matrix in a snake pattern
  • Transposing a matrix
  • Rotating a Matrix
  • Check if the element is present in a row and column-wise sorted matrix.
  • Boundary Traversal
  • Spiral Traversal
  • Matrix Multiplication
  • Search in row-wise and column-wise Sorted Matrix
  •  Introduction of String
  • Given a string, check if they are an anagram of each other.
  • Given a string, find the leftmost character that repeats.
  • Given a string, find the leftmost character that does not repeat.
  • Given a string, find the lexicographic rank of it in O(n) time.
  • Implementation of the previously discussed lexicographic rank problem.
  • Given a text string and a pattern string, find if a permutation of the pattern.
  • Given two strings, check if they are rotations of each other or not.
  • Various Pattern Searching
  • Algorithms.
    Palindrome Check
  • Binary Search Iterative and Recursive
  • Index of First Occurence in Sorted Array
  • Index of Last Occurence in Sorted Array
  • Count of occurrences of x in sorted element
  • Count of 1s in a binary sorted array
  • Find an element in sorted and rotated array
  • Peak element
  • Find an element in an infinite sized sorted array
  • The square root of an integer
  • Find pair in an unsorted array which gives sum X
  • Find pair in a sorted array which gives sum X
  • Find triplet in an array which gives sum X
  • Implementation of C++ STL sort() function in Arrays and Vectors
  • Stability in Sorting Algorithms
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Intersection of 2 sorted arrays
  • Union of 2 sorted arrays
  • Count Inversions in arrays
  • Naive
  • Lomuto
  • Hoare
  • Using Lomuto and Hoare
  • Time and Space analysis
  • Choice of Pivot and Worst case
  • Tail call elimination
  • Kth Smallest element
  • Chocolate Distribution Problem
  • Sorting arrays with 2 and3 types of elements
  • Merge Overlapping Intervals
  • Meeting the Maximum Guests
  • Heap Sort
  • Cycle Sort
  • Counting Sort
  • Radix Sort
  • Bucket Sort
  • Introduction and Time complexity analysis
  • Application of Hashing
  • Discussion on Direct Address Table
  • Working and examples on various Hash Functions
  • Introduction and Various techniques on Collision Handling
  • Chaining and its implementation
  • Open Addressing and its Implementation
  • Chaining V/S Open Addressing
  • Double Hashing
  • Unordered Set and Unordered Map
  • Count Distinct Elements
  • Count of the frequency of array elements
  • The intersection of two arrays
  • Union of two unsorted arrays
  • Pair with given sum in an unsorted array
  • Subarray with zero-sum
  • Subarray with given sum
  • Longest subarray with a given sum
  • Longest subarray with an equal number of 0’s and 1’s
  • Longest common span with the same sum in a binary array
  • Longest Consecutive Subsequence
  • Count Distinct elements in every window
  • More than n/k Occurences
  • Optimized More than n/k Solution
  • Introduction and Implementation
  • Doubly Linked List
  • Circular Linked List
  • Detecting Loops
  • Detecting loops using Floyd cycle detection
  • Detecting and Removing Loops in Linked List
  • Middle of Linked List
  • Nth node from the end of linked list
  • Deleting a Node without accessing Head pointer of Linked List
  • An iterative method to Reverse a linked list
  • Recursive method to reverse a linked list
  • Reverse in group of size k
  • Recursive Traversal in a Singly Linked List
  • Segregating even-odd nodes of linked list
  • The intersection of two linked list
  • Pairwise swap nodes of linked list
  • Clone a linked list using a random pointer
  • LRU Cache Design
  • Merge two Sorted Linked Lists
  • Palindrome Linked List
  • Recursive Traversal in a Singly Linked List
  • Remove Duplicates from a Sorted Singly Linked List
  • Sorted Insert in a Singly Linked List
  • Reverse a Doubly Linked List
  • Understanding the Stack data structure
  • Applications of Stack
  • Implementation of Stack in Array and Linked List
  • Balanced Parenthesis
  • Two stacks in an array
  • K Stacks in an array
  • Stock span problem with variations
  • Previous Greater Element
  • Next Greater Element
  • Largest Rectangular Area in a Histogram
  • Infix to Postfix (Simple Solution)
  • Infix to Postfix (Efficient Solution)
  • Evaluation of Postfix
  • Infix to Prefix (Simple Solution)
  • Infix to Prefix (Efficient Solution)
  • Evaluation of Prefix
  • Introduction and Application
  • Implementation of the queue using array and LinkedList
  • Reversing a Queue
  • Generate numbers with given digits
  • First Circular Tour
  • Introduction and Application
  • Implementation
  • Maximums of all subarrays of size k
  • ArrayDeque in Java
  • Design a DS with min max operations
  • Introduction Tree: Application, Binary Tree and Tree Traversal
  • Implementation of Inorder Traversal , Preorder Traversal, Postorder Traversal, Level Order Traversal (Line by Line) and Tree Traversal in Spiral Form
  •  Size of Binary Tree
  • Maximum in Binary Tree
  • Height of Binary Tree
  • Print Nodes at K distance
  • Print Left View of Binary Tree
  • Children Sum Property
  • Check for Balanced Binary Tree
  • Maximum Width of Binary Tree
  • Convert Binary Tree to Doubly Linked List
  • Construct Binary Tree from Inorder and Preorder
  • Tree Traversal Spiral Form
  • The diameter of a Binary Tree
  • LCA problem with an efficient solution
  • Burn A Binary Tree from a Leaf
  • Count Nodes in a complete Binary Tree
  • Serialize and Deserialize a Binary tree
  • Iterative Inorder Traversal
  • Iterative Preorder Traversal (Simple)
  • Iterative Preorder Traversal (Space Optimized) 
  • Background, Introduction and Application
  • Implementation of Search in BST
  • Insertion in BST
  • Deletion in BST
  • Floor in BST
  • The ceiling of a key in BST
  • Ceiling on the left side in an array
  • Find Kth Smallest in BST
  • Check for BST
  • Fix BST with Two Nodes Swapped
  • Pair Sum with given BST
  • Vertical Sum in a Binary Tree
  • Vertical Traversal of Binary Tree
  • Top View of Binary Tree
  • Bottom View of Binary Tree
  • Introduction & Implementation
  • Binary Heap
  • Priority Queue
  • Sort K-Sorted Array
  • Buy Maximum Items with Given Sum
  • K Largest Elements
  • Merge K Sorted Arrays
  • Median of a Stream
  • Introduction to Graph
  • Graph Representation : Adjacency Matrix and Adjacency List
  • Breadth-First Search and application
  • Depth First Search and application
  • Shortest Path in an Unweighted Graph
  • Detecting Cycle in Undirected Graph and Directed Graph
  • Topological Sorting Kahn’s BFS and DFS Based Algorithm
  • Shortest Path in Directed Acyclic Graph
  • Prim’s Algorithm/Minimum Spanning Tree
  • Dijkstra’s Shortest Path Algorithm
  • Bellman-Ford Shortest Path Algorithm
  • Kruskal’s Algoritm
  • Kosaraju’s Algorithm
  • Articulation Point
  • Bridges in Graph
  • Tarjan’s Algorithm
  • Practice Problems

What people are saying

Are You Ready To Start?

More Courses

You might also be interested in these courses

Course 2

Full Stack Developer with React

Explore our Full Stack Developer with React course for beginners. Learn the fundamentals of web development, JavaScript, React, and more, and kickstart your journey to becoming a proficient web developer.

Full Stack Developer with React

Duration : 3 Month Course.
Fee : 10,000/-INR.
View Course

Course 3

Data Analytics

Lorem ipsum dolor sit amet, consectetur adipiscing elit. aulla sit amet magna sodales, interdum tortor etlert of dictum mauris loean ultricies lectus quis gravida urna interdum quam bibend.

Data Analytics

2 Month Course
View Course