← Flipkart questions

Count paths in 2D matrix with obstacles

Filed under Flipkart

Find the number of unique paths from the top-left corner (0,0) to the bottom-right corner (m,n) in a 2D grid containing obstacles, moving only right or down.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.