Plus Group for course R52BSIL4

English

We have done a lot of questions using string as a input type or string as a medium, but this class will take you through algorithms based on string as a data structure. You will be introduced to some popular algorithms like KMP and Z-algorithms. These are really useful algorithms and  they require a details understanding of the concept. So let's crack it in this class.

String Algorithms: KMP and Z-Algorithm

Hinglish

In this course, Suresh Upadhyay will provide in-depth knowledge of Discrete Mathematics. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hinglish and the notes will be provided in English.

Course on Discrete Mathematics

Today we will be learning about an efficient pattern finding algorithm called Knuth-Morris-Pratt or KMP algorithm. This is the most basic pattern finding algorithm out there and the most popular as well.

String algorithms I - KMP algorithm

In this session, Tarun Gupta will cover basics of tries and will explore why tries are important. At the end of the session, we would know how to implement and use tries and will move closer to building our own dictionary search application.

Build Your Own Search Application - Basics of Tries

Queues are FIFO/LILO kind of a data structures. We will understand queues in greater depth in this class. We will make our own Queue class, define various utility functions and understand how they work.

Queues: Introduction

In this session, I will be covering Hashing Introduction And Basic concepts which will be beneficial for students preparing for competitive programming. 

Hashing Data structure for Beginners | Learn From Practice

In this class, we will be learning about the searching techniques in C++.  Searching in C++ is of two types: Linear Search and Binary Search. We'll discus binary search in depth, as it is an important subject for interviews

Searching Techniques in C++

We have done a lot of questions using string as a input type or string as a medium, but this class will take you through algorithms based on string as a data structure. You will be introduced to some popular algorithms like KMP, Rabin Carp and alot more. Let's get into this.

String Problems

This is continuation of the previous session. We'll complete our discussion on the basic functionalities. Live coding will be used to enhance learning. Complexity analysis will be done. Then, a classical problem will be used for illustration.

Trie (Interview Centric) - II

This is an extension to previous classes on Pointers and Linked Lists. We will be discussing more questions on Linked Lists and Pointers. These will be important questions for your interviews and other competitions.

Introduction to Linked List - III

This is an advanced level lecture, in this lecture, Utkarsh Gupta will be explaining how the KMP and Z algorithms work and where they can be used. Implementation will also be discussed.

Strings Algorithms: KMP and Z-algorithm

In this class, Riya will be discussing the Aho-Corasick Algorithm in great detail. This is going to be a beginner friendly session on pattern matching algorithms.

Introduction to Aho-corasick Algorithm

In this course, Nimisha Bansal will cover important concepts of English and this course would be helpful for aspirants preparing for Bank Exams. Learners at any stage of their preparation will be benefited from the course. The course will be covered in Hindi and the notes will be provided in English.

Complete Course on English for All Banking Exams - III

In this course, Sanket will cover important concepts of discrete mathematics. The course will be helpful for aspirants preparing for competitive programming exams. The language of communication will be Hindi and English.

In this course, Pulkit Chhabra will provide in-depth knowledge of Number Theory. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hindi and the notes will be provided in English/Hindi.

Course on Number Theory

In this class, we'll discuss multiple string searching algorithms from naive to efficient algorithms including KMP, Rabin-Karp, etc. We'll also discuss some questions based on time.