LoginSignup
14
13

More than 5 years have passed since last update.

コツコツCodilityの挑戦

Last updated at Posted at 2018-05-30

Codilityとは

Codilityはオンラインプログラミング試験とも言われており、オンライン上で時間内に与えられた問題を解くとスコアリングされるものです。

【対応言語】
C,C++,C#,Go,Java,JavaScript,Lua,Object
ive-C,Pascal,PHP,Peal,Python,Ruby,Scala,Swift 2,Swift 3,VB.NET

Codilityの挑戦

1年くらい全然コードを書いてなかったが、短期一本集中してC++でCodilityに挑戦
「PAINLESS」からしっかり向き合います。

Codilityの問題について

Codilityは、Lesson1からLesson17まであり、それぞれテーマがある。
各Lessonは1~4問程度あり、「PAINLESS」「RESPECTABLE」「AMBITIOUS」と難易度が分れている。

Codilityの各Lessonと問題

Lesson 1: Iterations
-[Painless] BinaryGap  6/1update

Lesson 2: Arrays
- [Painless] OddOccurrencesInArray 6/3update
- [Painless] CyclicRotation 6/2update

Lesson 3: Time Complexity
-[Painless] PermMissingElem 6/4update
-[Painless] FrogJmp 6/4update
-[Painless] TapeEquilibrium 6/5update

Lesson 4: Counting Elements
-[Painless] PermCheck 6/6update
-[Painless] FrogRiverOne
-[Painless] MissingInteger7/6update
-[Respectable] MaxCounters

Lesson 5: Prefix Sums
-[Painless] CountDiv
-[Painless] PassingCars
-[Respectable] GenomicRangeQuery
-[Respectable] MinAvgTwoSlice

Lesson 6: Sorting
-[Painless] Distinct
-[Painless] Triangle
-[Painless] MaxProductOfThree
-[Respectable] NumberOfDiscIntersections

Lesson 7: Stacks and Queues
-[Painless] StoneWall
-[Painless] Brackets
-[Painless] Nesting
-[Painless] Fish

Lesson 8: Leader
-[Painless] Equileader
-[Painless] Dominator

Lesson 9: Maximum slice problem
-[Painless] MaxDoubleSliceSum
-[Painless] MaxSliceSum
-[Painless] MaxProfit

Lesson 10: Prime and composite numbers
-[Painless] MinPerimeterRectangle
-[Painless] CountFactors
-[Respectable] Peaks
-[Respectable] Flags

Lesson 11: Sieve of Eratosthenes
-[Painless] CountSemiprimes
-[Respectable] CountNonDivisible

Lesson 12: Euclidean algorithm
-[Painless] ChocolatesByNumbers
-[Respectable] CommonPrimeDivisors

Lesson 13: Fibonacci numbers
-[Respectable] Ladder
-[Respectable] FibFrog

Lesson 14: Binary search algorithm
-[Respectable] MinMaxDivision
-[Respectable] NailingPlanks

Lesson 15: Caterpillar method
-[Painless] AbsDistinct
-[Painless] CountDistinctSlices
-[Painless] CountTriangles
-[Respectable] MinAbsSumOfTwo

Lesson 16: Greedy algorithms
-[Painless] MaxNonoverlappingSegments
-[Painless] TieRopes

Lesson 17: Dynamic programming
-[Respectable] NumberSolitaire
-[Ambitious] MinAbsSum

14
13
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
14
13