Introduction
Problem statement is here.
It is 9:30 pm, Julia worked on the algorithm starting from 7:00 pm, and then after 2 hours 30 minutes, she finally made some progress. Here is the report:
Good food, a blog, one hour nap,
As a hackerrank player, Julia got home 3:00 pm, she spent 45 minutes to write a blog about mocking experience to entertain herself first; She took a nap from 5:00 - 6:00 because she felt tired after working on algorithm "city construction"; She entertained herself with a friend with dinner, and talked about her mocking experience and hackerrank contest.
Julia tried to bring herself to a zone before she starts to code again. And then she studied more about "city construction" medium algorithm. She knew that she should be able to write something for the algorithm before 12:00 pm.
Compare to a peer
One thing Julia likes to do is to check ranking by country: Canada. She likes to compare one of top players, and here is the comparison. The time is running out, Julia like to choose some algorithms to work on in next 3 - 4 hours.
Understand hard level
Gave up at 10:37pm. Try to give at least 2 hours to solve "city construction". The algorithm is asking number of ones in the binary expression of x is minimum. Julia worked on the problem like "number in the binary expression of x is minimum".
Julia tried the idea to solve the problem, but her solution scored 11 points. She gave up the effort and will work on it after the contest.
Follow up
May 28, 2017 1:44 pm
After the contest, post the code submitted in the contest. Score 31 out of maximum score 75. Will look into the correct solution later.
No comments:
Post a Comment