Welcome to the first programming challenge! Three of these will be posted a week and you can complete it in any language you want.

You get a point for completing an easy challenge, 2 for a medium, and 3 for a hard. For each challenge if you solve it in the least amount of characters you get a bonus point, and if your code runs the fastest when I check it you also get a bonus point. (ties mean everyone who tied gets the bonus point although exact duplicate answers wont count)

Ill be posting a leaderboard that will show the people who have the most points every month

Submissions will be open for a week

As a new hire of bracket inc., you have been tasked with getting rid of excess brackets lying around the facility. You must simplify a series of brackets so that only brackets that dont have a match remain (a match is an opening and closing bracket of the same type beside each other). The final result should have no matches

As an example for the input [(({})({)(()}] the expected output would be [(({)(}]

These are the valid types of brackets: (){}[]

Your system will be tested against 10 different unknown test cases before it is unleashed on the facility. In order to complete this task you must pass all of the test cases.

Any programming language may be used and to submit an answer reply on this post with the code and the language you coded it in

Edit: Clarification, you must take input in from the user using the program instead of them being hardcoded. (makes it easier to test)

  • @Andy
    2•10 months ago

    Factor:

    For foolish brevity, renamed lemmy -> l and rid -> r.

    USING: kernel regexp command-line namespaces sequences io ;
IN: l

: r ( S -- s )
  R/ (\{\}|\(\)|\[\])/
  [ 2dup re-contains? ] [
    [ "" re-replace ] keep
  ] while drop
;

MAIN: [ command-line get [ r print ] each ]

    When compiled to an executable ridpairs, pass each string as an argument:

    $ ./ridpairs '[(({})({)(()}]' '(){}[]' '((){}[]]'
[(({)(}]

(]

    $ hyperfine "./ridpairs '[(({})({)(()}]' '(){}[]' '((){}[]]'"
Benchmark 1: ./ridpairs '[(({})({)(()}]' '(){}[]' '((){}[]]'
  Time (mean ± σ):       4.0 ms ±   0.4 ms    [User: 1.5 ms, System: 2.5 ms]
  Range (min … max):     3.3 ms …   5.9 ms    576 runs

    I think that amounts to 207 significant chars, definitely not the winner there.

    EDIT: build instructions:

    • Download and extract the development release from https://factorcode.org/
    • Paste the solution code into a new file at work/l/l.factor (the work folder is already present in the factor folder)
    • Launch the Factor UI: ./factor and inside the UI enter "l" deploy-tool
    • A menu with options pops up, choose to “Use the … vocabulary”
    • Click “Deploy”