_ Author Rockyan _
** Algorithm and data structure: ** When writing business code, you may pay more attention to "accuracy" and not use algorithms or complex data structures. However, high performance should also be considered in high data volume or high Internet concurrency scenarios. This is not only to speed up your business, but also because system failures and downtime are often closely related to processing speed and memory usage. Even the slightest performance gap can cause an irreversible system avalanche.
** About this article ** Codility has many good algorithmic problems. The author wants to challenge one by one and share the code and test cases with everyone. Articles marked * (src & junit) contain code and test cases.
** Willingly ** I would like to talk about different solutions and how to use them in today's application scenarios. Please leave a message.
Github address: https://github.com/yp2211/algorithm
** Preamble ** _ Author Roc Yang_ ** Arithmetic data structure: ** At the time of editing and copying, we have a lot of "correctness", and an unnecessarily profitable calculation method. However, there is a large number of installations, or there is a high level of concurrency, and high performance is required. This is a cause of failure, a point of improvement of the business, a more important cause, a systematic failure, a speed of processing, and a slight breathing relationship. Very detailed and minute performance difference, unrecoverable system avalanche. ** Related text ** In Codility, the subject of abundant arithmetic. The author's thoughts and challenges, and the example of the test case.
- Example of inclusion charge sum measurement test in a standard (src & junit) sentence;
- In the text of the standard (src & junit & author's note), an example of the inclusion fee sum measurement test, and the problematic thought or application scene;
- The text of the lesson started, the challenge part of the future meeting. ** 愿 ** Hopefulness, Dear Sir, Ichiki Investigative, Various Solving Methods, and Nowadays, Applicable Uses, Receiving Words. ** Github Site **: https://github.com/yp2211/algorithm
AVAILABLE LESSONS:
Lesson 1: Iterations
[Painless] [100%] BinaryGap (src & junit)
Lesson 2: Arrays
[Painless] [100%] CyclicRotation (src & junit) [Painless] [100%] OddOccurrencesInArray (src & junit)
Lesson 3: Time Complexity
[Painless] [100%] FrogJmp (src & junit) [Painless] [100%] PermMissingElem (src & junit) [Painless] [100%] TapeEquilibrium (src & junit)
Lesson 4: Counting Elements
[Painless] [100%] FrogRiverOne (src & junit)
[Painless] [100%] PermCheck (src & junit)
Lesson 5: Prefix Sums
[Respectable] [100%] MinAvgTwoSlice (src & junit) [Painless] [100%] PassingCars(src & junit)
Lesson 6: Sorting
[Painless] [100%] MaxProductOfThree(src & jUnit) [Respectable] [NumberOfDiscIntersections] [Painless] [Triangle]
Lesson 7: Stacks and Queues Lesson 8: Leader Lesson 9: Maximum slice problem Lesson 10: Prime and composite numbers Lesson 11: Sieve of Eratosthenes Lesson 12: Euclidean algorithm Lesson 13: Fibonacci numbers Lesson 14: Binary search algorithm Lesson 15: Caterpillar method Lesson 16: Greedy algorithms Lesson 17: Dynamic programming Lesson 90: Tasks from Indeed Prime 2015 challenge Lesson 91: Tasks from Indeed Prime 2016 challenge Lesson 92: Tasks from Indeed Prime 2016 College Coders challenge Lesson 99: Future training
Recommended Posts