— by Abhisek Pattnaik <[email protected]>
Python Koans is an interactive tutorial for learning the Python programming language by making tests pass.
— https://github.com/gregmalcolm/python_koans
- About Scoring Project - Greed Dice Game
— fork organized by Abhisek Pattnaik <[email protected]>
Miscellaneous resources I use in day to day journey of life for improving my productivity in various domains.
— by Abhisek Pattnaik <[email protected]>
You are given N
counters, initially set to 0
, and you have two possible operations on them:
increase(X)
− counter X
is increased by 1
,
max counter − all counters are set to the maximum value of any counter.
A non-empty zero-indexed array A
of M
integers is given. This array represents consecutive operations:
if A[K] = X
, such that 1 ≤ X ≤ N
, then operation K
is increase(X)
,
if A[K] = N + 1
then operation K
is max counter.
For example, given integer N = 5
and array A
such that:
Solutions to FreeCodeCamp Challenges using RegExp
See http://www.freecodecamp.com/abhisekp
ShortUrl to Gist: http://bit.ly/abhisekpFCCRegExpSolns
One Liner Solutions: http://j.mp/abhisekpFCCSolnsOneLiners