Daily JavaScript Challenge #JS-168: Check for Balanced Brackets in a String

#javascript #devchallenge #programming #webdev

Daily JavaScript Challenge: Check for Balanced Brackets in a String

Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!

The Challenge

Difficulty: Medium

Topic: Brackets and Parentheses

Description

Write a function that checks if a given string has balanced brackets. The brackets to be checked are: parentheses (), square brackets [], and curly braces {}. A string is considered balanced if every opening bracket has a corresponding and correctly placed closing bracket. The function should return true if the brackets are balanced, otherwise false.

Ready to Begin?

https://www.dpcdev.com/

Fork this challenge
Write your solution
Test it against the provided test cases
Share your approach in the comments below!

Want to Learn More?

Check out the documentation about this topic here: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Control_flow_and_error_handling#Loops

Join the Discussion!

How did you approach this problem?
Did you find any interesting edge cases?
What was your biggest learning from this challenge?

Let's learn together! Drop your thoughts and questions in the comments below. 👇

This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀

javascript #programming #coding #dailycodingchallenge #webdev

Fast, Lean, and Fully Extensible

CKEditor 5 is built for developers who value flexibility and speed. Pick the features that matter, drop the ones that don’t and enjoy a high-performance WYSIWYG that fits into your workflow

Start now

Top comments (2)

Asfia Aiman • May 6

function checkBalancedBrackets(str) {
const stack = [];
const bracketMap = {
')': '(',
']': '[',
'}': '{'
};

for (let char of str) {
    if (['(', '[', '{'].includes(char)) {
        stack.push(char);
    } else if ([')', ']', '}'].includes(char)) {
        if (stack.pop() !== bracketMap[char]) {
            return false;
        }
    }
}

return stack.length === 0;

}