I took part in Codechef's November Challenge (which stretched from 3rd till 13th of Nov.) intermittently solving some of the tough problems (not necessarily quickly) to keep a track of my progress and increase my comfort in solving problems in a long contest setting.
Ranked at 2856 out of 7024 who submitted at-least one problem partially or completely correct, I'd say it was an slight better than average performance. My long-contest rating saw a big boost, but I simultaneously saw a drop in my overall codechef rating [performance graphs]. Solved 3 problems successfully, tried fourth and fifth one but couldn't figure out the problem so didn't attempt and saw wrong answer for a submission for the sixth problem. For the remaining four, I didn't even get a chance to go through given the limited time I had (this happens when you manage your job while stealing some time out for your hobby. ;) )
Successful submissions are open to public post closure of the contest:
https://www.codechef.com/NOV17/status/VILTRIBE,chandniverma
https://www.codechef.com/NOV17/status/CLRL,chandniverma
https://www.codechef.com/NOV17/status/PERPALIN,chandniverma
I am yet to up-solve those 7 problems which I couldn't solve during the contest.
-------
The following week, I got my free time busy with the 35th Week of Code by Hackerrank.
Ranked at 3181 out of 9289, I'd say I performed better than average among the participants but there is still a huge gap between my score (59) and that of the highest scorer (290).
Here, I solved the first 3 problems successfully.
The fourth problem, Matrix Land, was a show-stopper! I really recommend it! I spend 3 evenings on it and still was not able to come up with a working solution. I was trying to figure out a modification of Bellman-Ford algorithm (which is a Dynamic Programming algorithm) to solve it with some decent efficiency but was getting nowhere as there was no way to mark visited vertices...
It turns out, reading the insightful problem editorial, one could solve it using a bunch of dynamic programming equations.
I went through the 5th and 6th problems too which were number crunching problems and they despite of being hard and expert level, seemed easier than the 4th one but didn't get much time to think them through their solutions.
Again, I have yet to up-solve the unsolved ones.
* SDE Career Contemplations * DSA Practice * Problem Solving in Java * Tech in General * Open Source guidance * Career guidance
Subscribe to:
Post Comments (Atom)
Featured Post
interviewBit Medium: Palindrome Partitioning II
Problem Name: Palindrome Partitioning II Problem Description : https://www.interviewbit.com/problems/palindrome-partitioning-ii/ Problem Ap...
-
Many users had requested this feature ( bug ) and it is now available for all to use. Now Empathy supports blocking/unblocking contacts on ...
-
I have been using Linux for quite some time now but only recently got a chance to peek into the internals of the OS I work on in detail. Uni...
-
Hi all, Last week I created a new popup feature that would allow the users to quickly enable/disable accounts from the accounts tree-view ...
No comments:
Post a Comment