this post was submitted on 15 Aug 2023
21 points (100.0% liked)

Programming Challenges

6 readers
1 users here now

Welcome to the programming.dev challenge community!

Three challenges will be posted every week to complete

Easy challenges will give 1 point, medium will give 2, and hard will give 3. If you have the fastest time or use the least amount of characters you will get a bonus point (in ties everyone gets the bonus point)

Exact duplicate solutions are not allowed and will not give you any points. Submissions on a challenge will be open for a week.

A leaderboard will be posted every month showing the top people for that month

founded 1 year ago
MODERATORS
Ategon@programming.dev
21
[Easy] Bracket Simplification (programming.dev)
submitted 1 year ago* (last edited 1 year ago) by Ategon@programming.dev to c/challenges@programming.dev
22 comments fedilink hide all child comments
 

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)

you are viewing a single comment's thread
view the rest of the comments
[โ€“] Phytolizer@programming.dev 1 points 1 year ago* (last edited 1 year ago) (1 children)

ISO C99:

#include 
#include 
#include 
#include 

static char opener(char ch) {
    switch (ch) {
        case '}': return '{';
        case ']': return '[';
        case ')': return '(';
        default: return 0;
    }
}

enum { MAX_LINE_LENGTH = 2048 };
static char buffer[MAX_LINE_LENGTH];

int main(void) {
    char* line = fgets(buffer, sizeof(buffer), stdin);
    if (line == NULL) {
        fprintf(stderr, "Error: could not read input.\n");
        return EXIT_FAILURE;
    }
    size_t len = strlen(line);
    if (len > 0 and line[len - 1] == '\n') {
        line[--len] = 0;
    }

    char stack[128];
    size_t stack_size = 0;
    for (size_t i = 0; i < len; ++i) {
        char pair = opener(line[i]);
        if (pair and stack_size != 0 and stack[stack_size - 1] == pair) {
            --stack_size;
        } else {
            stack[stack_size++] = line[i];
        }
    }
    stack[stack_size] = 0;
    puts(stack);
}

Mirrored code on bpa.st

Compile: cc -std=c99 -pedantic-errors -O2 bracket.c -o bracket

(Edited to add -O2 because you mentioned it would be timed.)

[โ€“] Phytolizer@programming.dev 1 points 1 year ago

Hm, the renderer really messed with this (HTML escaped the less than, removed includes as if they were HTML tags?) :/