Plus Group for course H5T8ZORA

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

English

In this course, Anjali Sheel 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. The course will be covered in English 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

In this session, we'll learn the basics of the Trie data structure. We'll discuss why we need one, how powerful can it get and where to use it? Basics functionalities - word insertion, counting prefixes and counting exact words will be discussed.

Trie (Interview Centric)

In this session, Triveni will discuss about Dijkstra's algorithm for finding shortest path. Knowledge of basic graph algorithms (such as BFS) and basic data structures (Segment Tree/ Fenwick Tree etc) are pre-requisites. Practice problems included.

Shortest Path Algorithms - Dijkstra Algorithm

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 session, Triveni will discuss Bellman-Ford algorithm. Which works for negative edge weights as well. Why Dijkstra's doesn't work? How to check negative cycles? Compare shortest path algorithms. Practice problems and solved examples included.

Shortest Path Algorithms - Bellman-Ford Algorithm

In this session, Triveni will solve more interesting and advanced problems using known techniques like DP, Linearity of expectations, recurrence relations, basic definitions etc.

Probability and Expected Values - IV

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

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

Intermediate

Basic Data Structures

Dynamic Programming & Recursion

Advanced

More from Triveni Mahatha

Asymptotic Analysis of Algorithm

Preposition - Part II

Solving Recurrence Relations

Prime Numbers: Primality Test and Factorization

Interview Preparedness

Reading Comprehension

English Language

Interview Preparation

Miscellaneous

Bank Exams

Vocabulary

Grammar/Sentence Correction

Number Theory

Sorting & Searching Algorithms

Discrete Mathematics

Chitrank Mishra

Pulkit Chhabra

Utkarsh Gupta

Prince Kumar

Istasis Mishra

Nimisha Bansal

Nipun Mittal

Riya Bansal

Sanket Singh

Umang Agrawal

Tarun Gupta

Qualified ICPC 2016 World Final. Won multiple Codechef Long Challenges (India). ICPC Onsite Regionals' Problem setter and Judge. IIT Kanpur.

Trie (Interview Centric) - II

Triveni Mahatha

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

Introduction to Aho-corasick Algorithm

Riya Bansal

String algorithms I - KMP algorithm

Istasis Mishra

Learn String Algorithms

Umang Agrawal

More from Triveni Mahatha

Shortest Path Algorithms - Dijkstra Algorithm

Triveni Mahatha

Shortest Path Algorithms - Bellman-Ford Algorithm

Triveni Mahatha

Trie (Interview Centric)

Triveni Mahatha

Probability and Expected Values - IV

Triveni Mahatha

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Sanket Singh

Course on Discrete Mathematics

Anjali Sheel

Complete Course on English for All Banking Exams - III

Nimisha Bansal

No internet connection

Trie (Interview Centric) - II

Triveni Mahatha

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

Introduction to Aho-corasick Algorithm

Riya Bansal

String algorithms I - KMP algorithm

Istasis Mishra

Learn String Algorithms

Umang Agrawal

More from Triveni Mahatha

Shortest Path Algorithms - Dijkstra Algorithm

Triveni Mahatha

Shortest Path Algorithms - Bellman-Ford Algorithm

Triveni Mahatha

Trie (Interview Centric)

Triveni Mahatha

Probability and Expected Values - IV

Triveni Mahatha

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Sanket Singh

Course on Discrete Mathematics

Anjali Sheel

Complete Course on English for All Banking Exams - III

Nimisha Bansal

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

No internet connection