---
title: "Discussion on \"How To Count Unique Paths In A Grid With Obstacles\" | Hashnode"
description: "Discussion on \"How To Count Unique Paths In A Grid With Obstacles\". An example of dynamic programming"
url: "https://hashnode.com/posts/how-to-count-unique-paths-in-a-grid-with-obstacles/65b6a9386fc57679769a9db8"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [How To Count Unique Paths In A Grid With Obstacles](https://leetsolve.com/how-to-count-unique-paths-in-a-grid-with-obstacles?utm_source=hashnode&utm_medium=feed)

An example of dynamic programming

Nov 30, 2023 · 4 min read · leetsolve.com  
Read the article

-   [#dynamic-programming](https://hashnode.com/tag/dynamic-programming)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#coding](https://hashnode.com/tag/coding)
-   [#cpp](https://hashnode.com/tag/cpp)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Nhut Nguyen](https://hashnode.com/@nhutnguyen)

@nhutnguyen · Copenhagen, Denmark

  
[View profile](https://hashnode.com/@nhutnguyen)

Software developer and Writer

Hi! My name is Nhut Nguyen. I am a software engineer and a writer in Copenhagen, Denmark. Learn more about me at nhutnguyen.com

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
