 A student at NIT Durgapur pursuing B.Tech currently in my final year. Interested in Data Structures, Algorithms and Web Development.


Sarfraz Baig

This course aims to give a good kickstart to everyone who wants to learn competitive programming. Right from setting up your system for achieving more efficiency to tough concepts like dynamic programming, this course contains it all.
This course focuses more on understanding the problem. Variety of questions are covered here with detailed illustrations, diagrams and code. Happy coding everyone!

English

Competitive Programming With Sphere Online Judge (SPOJ)

Competitive Programming

This is a quick overview of what we will be dealing in this entire course.

Overview of the Course

This lesson is a small introduction to competitive programming and SPOJ.

What is Sphere Online Judge (SPOJ)?

In this course, we will learn the very first problem every competitive programmer starts his journey with.

Life, Universe and Everything

This lesson focuses on ADHOC - 1: A very basic problem which does not make use of any algorithm.

Adding Reversed Number

This lesson focuses on ADHOC - 2: Learn one of the most important concept of competitive programming: SORTING

Fashion Shows

This lesson focuses on ADHOC - 3: Competitive programming generally has many problems directly related to mathematical formulas. This lesson contains one such problem.

Feynman

Many problems in competitive programming are very deceptive. They look very ambiguous but are very easy to do once you crack the logic. This lesson contains one such problem based on the Game Theory.

The Number's Game

In this lesson, we will learn an interesting problem which takes care of fundamental concepts like stack and queue.

Street Parade

This lesson deals with the string manipulation and big numbers.

Julka

This lesson focuses on string and the variety of methods we can apply to them.

Anti Blot System

In this lesson, we will see another interesting problem which makes use of Modular Exponentiation.

The Last Digit

This lesson gives a small introduction to recursion and memoization.

Bytelandian Gold Coins

This lesson focuses on one of the most popular problems in dynamic programming. It is based on 2 - D dynamic programming.

Edit Distance

The final problem of this course makes an interesting use of dynamic programming to help out Harry Potter in his quest.

Lessons

14 lessons • 2h 2m

Invalid Date

NaN

Overview of the Course

Invalid Date

NaN

What is Sphere Online Judge (SPOJ)?

Invalid Date

NaN

Life, Universe and Everything

Invalid Date

NaN

Adding Reversed Number

Invalid Date

NaN

Fashion Shows

Invalid Date

NaN

Feynman

Invalid Date

NaN

The Number's Game

Invalid Date

NaN

Street Parade

Invalid Date

NaN

Julka

Invalid Date

NaN

Anti Blot System

+ See all lessons