• Home

  • Courses

    • Run Java Selenium Tests in Azure Devops
    • Interviewing for Testing Positions
  • For Business

  • Trainings

    • Beginner Selenium (May 2018)
    • Advanced Selenium (Feb 2019)
  • Teacher

  • Bootcamp Info

  • Forum

  • Blog

  • Meetups

    • Test Automation for Responsive Site
    • All about Locators in Selenium Projects
  • More..

    • FAQ
    • Cheat Sheets
    • Presentations
  • More...

    Use tab to navigate through the menu items.
    To see this working, head to your live site.
    • Categories
    • All Posts
    • My Posts
    alexsiminiuc3
    Jun 10, 2018

    Nested paranthesis

    in Job Interview Tests

    This is a test from a real interview.


    A string S consisting of N characters is called properly nested if: 

    • S is empty

    • S has the form "(U)" where U is a properly nested string

    • S has the form "VW" where V and W are properly nested strings

    For example, string "(()(())())" is properly nested but string "())" isn't.  Write a function int solution(char *S);  that,  given a string S consisting of N characters,  returns 1 if string S is properly nested and 0 otherwise.  For example, given S = "(()(())())", the function should return 1 and given S = "())", the function should return 0, as explained above.  Assume that the string S consists only of the characters "(" and/or ")".

    0 comments
    0
    Comments

    Share Your ThoughtsSign up to leave a comment.

    0 comments

    © 2021 Vancouver Selenium WebDriver Automation Training