Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Created by @Harshit_Gupta,validated by @_O-MEGA,@Saphir123 and @CodyJisll.
If you have any issues, feel free to ping them.
Coding Games and Programming Challenges to Code Better
Send your feedback or ask for help here!
Created by @Harshit_Gupta,validated by @_O-MEGA,@Saphir123 and @CodyJisll.
If you have any issues, feel free to ping them.
Note: In case you just receive a single character, just use the same character instead of empty output.
This note sounds like it’s about the case where total == 1
, but then in Constraints it says:
1 <
total
count of symbols (per testcase) < 10
So what is this note about?
I just looked at my solution. I don’t remember how I was thinking. It seems I just ignored the author’s explanations. What needs to be achieved is pretty obvious from the test cases.
When I first reviewed the puzzle (almost 2 years ago), I suggested to delete that note you asked about, and this was the author’s reply:
Yes, I know there’s no case of just a single bit in inputs. It was just added to clarify the problem expectation in such a case, but yes it is redundant and can be removed.
I think the note is more confusing than clarifying.