Goal

Competitive Programming

Show only

Special classes

Filter by

All courses

Ongoing

Upcoming

Completed

Language

All languages

English

Hinglish

Topic

All topics

Beginner

Expert

Advanced

Intermediate

Arrays are the simplest block of collective data storage available to programmers. In this class, we will practice questions related to arrays and look briefly at various techniques of problem-solving which can be applied to arrays.

Practice - Arrays

Basic Data Structures

Arrays are the simplest block of collective data storage available to programmers. In this class, we will look into the basics of arrays. We will learn about the memory management associated with Arrays and practice questions related to the topic.

Data Structures - Arrays - II

Data Structures - Arrays

This is the fourth class in Backtracking series. In this class, we will look at a very traditional chess board problem where one is required to place N queens on the board such that none of the queens cancels each other.

Backtracking: N-Queen Problem

Building Blocks of Programmimg

In this class, we will practice the various concepts which we have learnt so far in the beginners series. We will solve questions related to control-flow statements and decision-making statements.

Miscellaneous Practice

Introduction to Programming in C++

This is the third lecture in the backtracking series and here we are going to solve for Sudoku solver. Sudoku is a Japanese puzzle game introduced in 1984. We will be learning more about this game in this class and see how backtracking can help solve this question easily.

Backtracking: Sudoku Solver

Menu Driven programs are a category of terminal based programs which involve the use of switch construct. This class is a practice class to learn about switch case at depth and it will also involve the use of other control flow statements.

Writing Menu Driven Programs

Backtracking uses the methods of recursion and is generally used in decision making and optimizing solutions. In this class, we will aim at solving more questions based on backtracking and explore more into the subject.

Practice - Backtracking

In the previous class, we looked into what are the various flow control options available to us in C++. We learned about the basic kinds and solved few examples. In this class, we will learn more about iterative flow control and solve more problems

Practice: Control Flow

Backtracking is a technique that aims at searching all possible combinations as a solution to solve a problem. Backtracking uses the methods of recursion and is generally used in decision making and optimizing solutions.

Introduction to Backtracking

Control Flow Statements - II

In this class, we will understand the standards of recursion at depth. We will explore everything about the function call stack and ways to improve recursive logic. We will also try to analyze the time complexity of this process.

Recursion in C++

Legend

Master

Star

Rising Star

India

HyperVerge

GeeksForGeeks

Jaypee Institute of Information Technology

Dentira

Jaypee Institute Of Information Technology

Jhansi, Uttar Pradesh, India

Senior Advisor @ IEEE Student Branch JIIT

Winner @ HackBMU'20

Woohoo! You’re officially a learning rockstar. Keep racking up more thousands!

1000 minutes

You deserve this honour for all the hard work! 500 is a big milestone. Keep going higher and faster!

500 minutes

Your first century, you did it! Go ahead, tell the world. 

100 minutes

Woot! You're halfway to a century of learning minutes. Keep going strong!

50 minutes

Dedicate this special Teachers’ Day Hat to appreciate the efforts of your favorite educator

Chitrank Mishra

514 Followers