Interview Questions

  • View all interview questions
  • blank
  • Generate all balanced bracket combinations
    For this popular algorithm interview question, your goal is to print all possible balanced parenthesis combinations up to N. For example: N = 2 (()), ()() N = 3 ((())), (()()), (())(), ()(()), ()()()

    Algorithm




    You need to be a premium member to see the rest of this question and code.

    Become a Premium Member

    With our large collection of challengs, tutorials, and solutions, we make it easy for you to become a better coder, prepare for interviews, and learn new skills from more experienced coders.

    “Daniel - Thanks so much for making Coderbyte! We still recommend it to people.” ― Shawn Drost
    • 200+ Coding Challenges
    • Mock Interview Questions
    • 500,000+ Code Solutions
    • Algorithm Tutorials
    • Interview Prep Courses
    mrdaniel published this on 2/8/16 | math, Google
    Comments
    Login to submit a comment