Plus Group for course MFLMXA5U

English

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, 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

In this problem-solving session, we are going to solve some interesting problems on Graphs Data Structure. We will discuss Beginner to Advanced level problems.

Graphs (Interview Problem Solving) - II

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

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, Riya is going to start discussing dynamic programming as a concept from the start and help understand the importance and applications of this concept.

Mastering Dynamic Programming - II

In this course, Sanket Singh will discuss important concepts of String Algorithms and Computational Geometry in a comprehensive manner, starting from a basic introduction, proof techniques and solving competitive programming problems. Learners aspiring to perform in competitive programming will benefit from this course. The course will be taught in Hindi and the notes will be provided in English.

Course on String Algorithms and Computational Geometry

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

In this session, we are going to do some interesting problem solving on Dynamic Programming, along with intuition building for the discussed problems.

Dynamic Programming (Problem Solving) - 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 is going to start discussing Backtracking as a concept from the start and help understand the importance and applications of this concept.

Mastering Backtracking - III

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

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.

String Algorithms

In this session, Umang will be discussing important String Algorithms which are important for Competitive Programming and interviews. Detailed discussion with implementation and Pseudo code will be done.

Learn String Algorithms

Free Live Class

Competitive Programming

Advanced

Computational Geometry

Graph Algorithms

Advanced Dynamic Programming

More from Riya Bansal

Solving Recurrence Relations And Applications In Time Complexity Analysis

Solving Recurrence Relations

Fundamentals on String Algorithms

Prime Numbers: Primality Test and Factorization

Interview Preparedness

Intermediate

Basic Data Structures

Game Theory

Interview Preparation

Miscellaneous

Number Theory

Sorting & Searching Algorithms

Discrete Mathematics

Chitrank Mishra

Pulkit Chhabra

Utkarsh Gupta

Prince Kumar

Istasis Mishra

Nipun Mittal

Software Engineer at Microsoft | Ex - Flipkart | Former SDE and Instructor @ InterviewBit | Google Women TechMakers Scholar 2018

Introduction to Aho-corasick Algorithm

Riya Bansal

Similar Classes

Build Your Own Search Application - Basics of Tries

Tarun Gupta

String Algorithms: KMP and Z-Algorithm

Chitrank Mishra

Strings Algorithms: KMP and Z-algorithm

Utkarsh Gupta

String Algorithms

Nipun Mittal

Hashing Data structure for Beginners | Learn From Practice

Prince Kumar

Trie (Interview Centric) - II

Triveni Mahatha

String algorithms I - KMP algorithm

Istasis Mishra

Learn String Algorithms

Umang Agrawal

More from Riya Bansal

Mastering Dynamic Programming - II

Riya Bansal

Mastering Backtracking - III

Riya Bansal

Graphs (Interview Problem Solving) - II

Riya Bansal

Dynamic Programming (Problem Solving) - III

Riya Bansal

Similar Plus Courses

Course on String Algorithms and Computational Geometry

Sanket Singh

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Sanket Singh

Course on Discrete Mathematics

Suresh Upadhyay

No internet connection

Introduction to Aho-corasick Algorithm

Riya Bansal

Similar Classes

Build Your Own Search Application - Basics of Tries

Tarun Gupta

String Algorithms: KMP and Z-Algorithm

Chitrank Mishra

Strings Algorithms: KMP and Z-algorithm

Utkarsh Gupta

String Algorithms

Nipun Mittal

Hashing Data structure for Beginners | Learn From Practice

Prince Kumar

Trie (Interview Centric) - II

Triveni Mahatha

String algorithms I - KMP algorithm

Istasis Mishra

Learn String Algorithms

Umang Agrawal

More from Riya Bansal

Mastering Dynamic Programming - II

Riya Bansal

Mastering Backtracking - III

Riya Bansal

Graphs (Interview Problem Solving) - II

Riya Bansal

Dynamic Programming (Problem Solving) - III

Riya Bansal

Similar Plus Courses

Course on String Algorithms and Computational Geometry

Sanket Singh

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Sanket Singh

Course on Discrete Mathematics

Suresh Upadhyay

.css-8tavlo-InternetInfoImg{width:20px;height:20px;vertical-align:middle;margin-right:8px;}No internet connection

No internet connection