Nov. 7, 2016
Problem statement:
https://www.hackerrank.com/contests/ncr-codesprint/challenges/super-valid-bracket-sequences
First submission: pass sample test case, score 0 of 40.
https://gist.github.com/jianminchen/c4cfa2a7a4ffeecaaeff725af17baaad
Julia spent time to understand the problem, and then, she did work on sample test case; and next, she likes to work on timeout, space complexity.
It is a dynamic programming solution.
Showing posts with label medium algorithm on HackerRank. Show all posts
Showing posts with label medium algorithm on HackerRank. Show all posts
Monday, November 7, 2016
Monday, September 26, 2016
HackerRank - World CodeSprint #7 - Summing Pieces
Sept. 26, 2016
Problem statement
Spent over 8+ hours to work on the algorithm, really enjoyed the algorithm. It is different experience, with strong determination to make some points, took more than 2+ hours to figure out the dynamic programming formula - should call recurrence formula. Started from scoring 4.00 points, moved up to 19.00 out of 40.00.
What a learning experience, totally different from projects at work/ university. Will document the detail experience, what Julia should learn after she reviews/ analyzes the practice.
Will come back later.
Step 1:
submission 1, pass first 3 test cases - score 4.14/ 40
Step 2:
score 11 out of 40 - step 2 / 4 (4, 11, 14, 19 out of 40)
use line 78, line 98, extra string array to help debugging the code, make it short to fix the issues in the code. But, this extra code has
to be removed later to gain 2 points.
Step 3:step 3 / 4 ( 4, 11, 14, 19 out of 40)
Step 4:
score 13.9
step 4: score 19 out of 40
March 3, 2017
Review the algorithm, write a complete solution, and then post a question on codereview.stackexchange.com.
And also do some research how to win a silver medal, Julia was very close to a silver medal on this world codesprint #7,
Problem statement
Julia is a warrior in the contest - fearless, she feels at home
Spent over 8+ hours to work on the algorithm, really enjoyed the algorithm. It is different experience, with strong determination to make some points, took more than 2+ hours to figure out the dynamic programming formula - should call recurrence formula. Started from scoring 4.00 points, moved up to 19.00 out of 40.00.
What a learning experience, totally different from projects at work/ university. Will document the detail experience, what Julia should learn after she reviews/ analyzes the practice.
Will come back later.
Progression to 19/ 40
Step 1:
submission 1, pass first 3 test cases - score 4.14/ 40
Step 2:
score 11 out of 40 - step 2 / 4 (4, 11, 14, 19 out of 40)
use line 78, line 98, extra string array to help debugging the code, make it short to fix the issues in the code. But, this extra code has
to be removed later to gain 2 points.
Step 3:step 3 / 4 ( 4, 11, 14, 19 out of 40)
Step 4:
score 13.9
step 4: score 19 out of 40
Six months later - follow up review
March 3, 2017
Review the algorithm, write a complete solution, and then post a question on codereview.stackexchange.com.
And also do some research how to win a silver medal, Julia was very close to a silver medal on this world codesprint #7,
Subscribe to:
Posts (Atom)