Design & Analysis of Algorithms - Vol 3 | 1. Grid Paths by Abraham | Learn Smarter
K12 Students

Academics

AI-Powered learning for Grades 8–12, aligned with major Indian and international curricula.

Professionals

Professional Courses

Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.

Games

Interactive Games

Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.

1. Grid Paths

The discussion centers around the problem of counting grid paths in a rectangular grid, focusing on movements from the bottom left corner to the top right corner with specific rules. It explores combinatorial methods to calculate the number of unique paths, including scenarios where certain intersections are blocked. The concepts of inclusion and exclusion are introduced to account for multiple blocked intersections and their effect on path counting.

Enroll to start learning

You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.

Sections

  • 1

    Grid Paths

    This section discusses the problem of counting paths on a grid using combinatorics, focusing on allowed movements and blocked intersections.

  • 1.1

    Introduction To Grid Paths

    This section introduces the concept of grid paths, focusing on how to calculate the number of unique paths from the bottom left to the top right corner of a grid.

  • 1.2

    Counting Paths Without Blocks

    This section explores the problem of counting distinct grid paths from the bottom-left to the top-right corner of a rectangular grid while adhering to movement constraints.

  • 1.3

    Paths With A Blocked Intersection

    This section discusses the combinatorial problem of finding grid paths and computing valid paths given blocked intersections.

  • 1.4

    More Complex Blockages

    This section explores the combinatorial problem of computing the number of paths in a grid while navigating through blockages.

Class Notes

Memorization

What we have learnt

  • Grid paths can be counted u...
  • Paths can be calculated bas...
  • The inclusion-exclusion pri...

Final Test

Revision Tests