---
title: "Discussion on \"Day 13 - Valid Parenthesis\" | Hashnode"
description: "Discussion on \"Day 13 - Valid Parenthesis\". Check if a string of brackets is valid using a stack-based algorithm. Efficient solution with O(n) time complexity"
url: "https://hashnode.com/posts/day-13-valid-parenthesis/6992d24b6c4e9a057324847f"
---

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

Discussion

# [Day 13 - Valid Parenthesis](https://blogs-himanshu.hashnode.dev/day-13-valid-parenthesis?utm_source=hashnode&utm_medium=feed)

Check if a string of brackets is valid using a stack-based algorithm. Efficient solution with O(n) time complexity

Feb 16 · 2 min read · blogs-himanshu.hashnode.dev  
Read the article

-   [#dsa](https://hashnode.com/tag/dsa)
-   [#leetcode](https://hashnode.com/tag/leetcode)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#leetcodedaily](https://hashnode.com/tag/leetcodedaily)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[himanshu](https://hashnode.com/@Himanshu-)

@Himanshu-

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

Aspiring Web developer

Learning and learning

## Responses

Markdown supported · ⌘↵ to post

No responses yet.