Introduction
Julia decided to join stackexchange.com theoretic computer science community today. And then she chose one study a time - finding smallest k elements in an array in O(k) time
Julia found out that after more than 24 month heavily working on Leetcode, code review and full time programmer job, she still has not developed the strong analysis of algorithm ability, she evaluated her study on Leetcode 312: balloon burst algorithm on March 26, 2017. It took her more than 4 hours to work on a hard algorithm using dynamic programming, but she still needs more time to play with some test case and figure out something fundamental. So, she decided to find a new school and make the changes.
She decided to join the theoretic computer science community and other communities like Math overflow etc. She likes to find some good thinkers in the computer science, so she can get some training on the analysis - problem solving area. She likes to read algorithms/ articles talking about more about analysis and how to approach a problem.
Algorithm Study
Surprisingly Julia started to know more computer science theory and graph related scientist, professors and researchers. Cool, Julia likes to read the article with a lot of math formula, she like sto associate with those people who likes to express ideas using mathematical formulas. She feels at home and also like the intensity of learning.
Radu Grigore - spend 10 minutes to read a scientist resume.
Radu Grigore - spend 10 minutes to read a scientist resume.
No comments:
Post a Comment