id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

pais@kinetigram.com recursion02 > R25_nestParen
prev  |  next  |  chance

APCS Recursion 2, Problem 5. Given a string, return true if it is a nesting of zero or more pairs of parenthesis, like "(())" or "((()))". Suggestion: check the first and last chars, and then recur on what's inside them.


R25_nestParen("(((x))") → false
R25_nestParen("((())") → false
R25_nestParen("((()()") → false

...Save, Compile, Run (ctrl-enter)

public boolean R25_nestParen(String str) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 300

Copyright Nick Parlante 2017 - privacy