We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I have a question and a remark after completing this challenge :p
The question is Why no one uses a Lex/Yacc equivalent? This seems by far the most straightforward way to do this. And I see no interest in creating a custom lexer/parser :O
As for the remark, I think this challenge is not worth 100 points. It took 15 minutes to produce the 70 lines of code that solve it. I'd rather say 10 points (Yeah I know, I expose myself to some backfiring that way, let's see where the debate goes :-) ) The only difficulty IMHO was calculating the inverse of a number, but the problem statement gives explicitly the solution.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Expressions V2
You are viewing a single comment's thread. Return to all comments →
Hello!
I have a question and a remark after completing this challenge :p
The question is Why no one uses a Lex/Yacc equivalent? This seems by far the most straightforward way to do this. And I see no interest in creating a custom lexer/parser :O
As for the remark, I think this challenge is not worth 100 points. It took 15 minutes to produce the 70 lines of code that solve it. I'd rather say 10 points (Yeah I know, I expose myself to some backfiring that way, let's see where the debate goes :-) ) The only difficulty IMHO was calculating the inverse of a number, but the problem statement gives explicitly the solution.