Problem statement
C# code submission in the contest, score maximum score 40.
She spent a few hours on Hackathon Shirts. She thought about test cases she should choose more carefully. Two algorithms are involved, one is merging interval algorithm, the other is binary search algorithm. Very good workout.
Facts to share
Julia still made a bug in her writing after 4 - 5 times to practice merging intervals as an algorithm. Why? Because she depends on her memory of the algorithm, do not start from the beginning of analysis, what test cases she should cover when she finishes the coding. She missed the previous interval end value, she should check maximum of two values instead.
Julia,
rely on your past practices,
it is not to test how good your memorize the algorithm.
But always,
rely on your past practices,
it is not to test how good your memorize the algorithm.
But always,
always start with
the reasoning,
test cases.
Learn from your sinking sand lessons.
No comments:
Post a Comment