Introduction
Now it is 3:08pm, 18 hours left for the contest. Julia was busy this morning. She had her first mocking experience with a new company called refdash.com. She could not believe that after 40 mocking experience, she started to enjoy solving algorithm and data structure problems and survived first algorithm.
After 10:00 am - 11:30 am mocking experience, she went back to the .NET user group and had a lunch, attended one hour session for a talk. She quit early because she likes to get some learning experience through those four algorithms. One medium level, one hard level, two expert levels algorithms in world codesprint 11.
Julia likes to play contest and she just could not believe that she could not take whole afternoon to sit in lectures. She likes to play competition, and get challenged on algorithms. Julia is an active learner, she likes to try new things, build something using her crafting skills, specially algorithm problems.
Coding in the contest
Code from 10:00 pm to 3:00 am, score 0 even though the algorithm passed a few of test cases Julia set up, also sample test case. Great learning opportunity after the contest.
Here is the progress report.
Follow up after the contest
May 28, 2017 1:38 pm
Code submitted in the contest is here. Score 0. Will find out why test case 1 fails, there are 10,000 roads. Timeout is the issue.
The union find algorithm is the classical algorithm, which can be applied to this "City construction" algorithm.
No comments:
Post a Comment