{"openapi":"3.1.0","info":{"title":"Codewars API","version":"1.0.0","description":"Live profile, ranking and challenge data from Codewars, the competitive-programming community where developers level up by solving \"kata\". Get a member's whole standing — honor points, overall rank as a Codewars kyu/dan grade with its score, the per-language ranks they hold, their clan, their global leaderboard position and how many kata they have completed and authored. Pull the paginated list of kata a member has solved with the languages they used, the kata a member has created with rank and popularity, or any code challenge in full — its category, difficulty, tags, available languages and community stats (total completed, attempts, stars and vote score). Live, no key, nothing stored. Distinct from Codeforces, GitHub and Stack Exchange APIs — this is the Codewars honor, kyu-rank, clan, leaderboard and kata-challenge graph. Perfect for developer leaderboards, coding-community, gamification, portfolio and recruiting apps.","contact":{"name":"PremiumApi","url":"https://www.oanor.com/by/premiumapi"}},"servers":[{"url":"https://api.oanor.com/codewars-api","description":"oanor gateway"}],"tags":[{"name":"Members"},{"name":"Kata"}],"components":{"securitySchemes":{"oanorKey":{"type":"apiKey","in":"header","name":"x-oanor-key","description":"Get your key at https://www.oanor.com/developer/keys"}}},"security":[{"oanorKey":[]}],"paths":{"/v1/authored":{"get":{"operationId":"get_v1_authored","tags":["Members"],"summary":"Kata a member has created","description":"","parameters":[{"name":"username","in":"query","required":true,"description":"Codewars username","schema":{"type":"string"},"example":"g964"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"count":142,"source":"Codewars","authored":[{"id":"5e4bb05b698ef0001e3344bc","name":"Operations on sequences","rank":-5,"tags":["Algorithms","Mathematics"],"languages":["prolog","python","java","fortran","rust","clojure","javascript","csharp","pascal","lua","perl","raku","elm","cobol","d","erlang","go"],"rank_name":"5 kyu","description":"Let an array or a list \n\n`arr = [x(1), x(2), x(3), x(4), ..., x(i), x(i+1), ..., x(m), x(m+1)]`\n\nwhere all `x(i)` are positive integers. \nThe length `lg` of this array will be a positive multiple of 4.\n\nLet \n\n`P = (x(1) ** 2 + x(2) ** 2) * (x(3) ** 2 + x(4) ** 2) * ... * (x(m) **"},{"id":"5e1f2234c5772a000fe7f7ce","name":"Transform","tags":["Fundamentals"],"languages":["shell","perl"],"description":"Let us consider, as an example, strings like the following:\n```\ns='\"Title\"\nDate class\n.\n.\n\"Connected\"\nfifo,\nisoYear,\ndaynum,\nargfirst,\nmonthend,\nweeknum,\nassoc.quantity,\nyearstart,\nrank,\ntoday.'\nor:\ns=\"\\\"Title\\\"\\nDate class \\n.\\n.\\n\\\"Connected\\\"\\nfifo, \\nisoYear, \\ndaynum, \\nargf"},{"id":"5df754981f177f0032259090","name":"A floating-point system","rank":-6,"tags":["Fundamentals"],"languages":["java","kotlin","shell","ruby","python","rust"],"rank_name":"6 kyu","description":"A floating-point number can be represented as `mantissa * radix ^ exponent` (^ is raising radix to power exponent).\nIn this kata we will be given a positive floating-point number `aNumber` and we want to decompose it into a positive integer `mantissa` \ncomposed of a given number o"},{"id":"5db19d503ec3790012690c11","name":"Architect's Dream: drawing curves, observing, thinking","rank":-6,"tags":["Fundamentals"],"languages":["python","javascript","java","clojure","pascal","lua","perl","raku","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"An architect wants to construct a vaulted building supported by a family of arches C<sub>n</sub>.\n\nf<sub>n</sub>(x) = -nx - xlog(x) is the equation of the arch C<sub>n</sub> where `x` is a positive real number (0 < x <= 1), `log(x)` is the natural logarithm (base e), `n` a non ne"},{"id":"5dad6e5264e25a001918a1fc","name":"Reversing a Process","rank":-6,"tags":["Fundamentals"],"languages":["python","javascript","java","cpp","scala","kotlin","groovy","csharp","shell","rust","haskell","ruby","haxe","dart","pascal","lua","perl","raku","elm","d","erlang","prolog","php"],"rank_name":"6 kyu","description":"Suppose we know the process by which a string `s` was encoded to a string `r` (see explanation below). The aim of the kata is to decode this string `r` to get back the original string `s`.\n\n\n#### Explanation of the encoding process:\n\n- input: a string `s` composed of lowercase le"},{"id":"5da1df6d8b0f6c0026e6d58d","name":"Sections","rank":-5,"tags":["Fundamentals"],"languages":["python","javascript","java","haskell","dart","clojure","cpp","c","php","csharp","scala","kotlin","groovy","ruby","prolog","fortran","rust","haxe","commonlisp","racket","pascal","raku","perl","lua","cobol","elm","d","erlang","go"],"rank_name":"5 kyu","description":"Consider the following equation of a surface `S`: `z*z*z = x*x * y*y`.  \nTake a cross section of `S` by a plane `P: z = k` where `k` is a positive integer `(k > 0)`.  \nCall this cross section `C(k)`.\n\n#### Task\n\nFind the *number* of points of `C(k)` whose coordinates are positive"},{"id":"5d98b6b38b0f6c001a461198","name":"Binaries","rank":-6,"tags":["Fundamentals"],"languages":["python","javascript","haskell","java","csharp","ruby","clojure","cpp","c","scala","kotlin","shell","rust","dart","pascal","coffeescript","lua","perl","raku","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"Let us take a string composed of decimal digits: `\"10111213\"`. We want to code this string as a string of `0` and `1` and after that be able to decode it.\n\nTo code we decompose the given string in its decimal digits (in the above example: `1 0 1 1 1 2 1 3`) and we will code each "},{"id":"5d95b7644a336600271f52ba","name":"Robinson Crusoe","rank":-7,"tags":["Fundamentals"],"languages":["python","javascript","java","scala","rust","haxe","lua","pascal","perl","raku","d","erlang","prolog"],"rank_name":"7 kyu","description":"Robinson Crusoe decides to explore his isle. On a sheet of paper he plans the following process.\n\nHis hut has coordinates `origin = [0, 0]`. From that origin he walks a given distance `d` on a line\nthat has a given angle `ang` with the x-axis. He gets to a point A.\n(Angles are me"},{"id":"5d838fa2f204c10021a88f1c","name":"Forth Array","rank":-6,"tags":["Fundamentals"],"languages":["forth"],"rank_name":"6 kyu","description":"Task:\n\n- write a word `{}` which given a \"size\" on the stack and a \"name\" from the input stream create an array of integers of size \"size\" and name \"name\"\n    \n    Example : `100 {} arr` will give an array of size `100` and name `arr`. \n    \n    Index elements go from `0` to `siz"},{"id":"5d68d05e7a60ba002b0053f6","name":"Bonuses","rank":-6,"tags":["Fundamentals"],"languages":["python","coffeescript","crystal","dart","java","haskell","c","javascript","pascal","raku","lua","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"John wants to give a total bonus of `$851` to his three employees taking *fairly as possible* into account their number of days of absence during the period under consideration.\nEmployee A was absent `18` days, B `15` days, and C `12` days.\n\n**The more absences, the lower the bon"},{"id":"5d444d05ba9956002785c14a","name":"Easy Forth (or Factor)","rank":-8,"tags":["Fundamentals"],"languages":["forth","factor"],"rank_name":"8 kyu","description":"It's one of the first Forth or Factor kata. \n\nThe aim is to calculate the value of `a * x * x + b * x + c`\nwhere `a, b, c, x` are given integers on the stack in the order: `c b a x (< top of the stack)`.\n\n### Example:\n`4 3 2 5 trino` should return `69` (a = 2; b = 3; c = 4; x = 5"},{"id":"5ce399e0047a45001c853c2b","name":"Sums of Parts","rank":-6,"tags":["Fundamentals","Performance","Algorithms"],"languages":["racket","python","cpp","crystal","java","javascript","scala","haskell","r","clojure","ruby","csharp","php","powershell","rust","typescript","shell","ocaml","reason","c","elixir","fsharp","vb","kotlin","groovy","prolog","fortran","dart","commonlisp","julia","nim","pascal","raku","perl","lua","elm","cobol","d","erlang","go","nasm"],"rank_name":"6 kyu","description":"Let us consider this example (array written in general format):\n\n`ls = [0, 1, 3, 6, 10]`\n\nIts following parts:\n```\nls = [0, 1, 3, 6, 10]\nls = [1, 3, 6, 10]\nls = [3, 6, 10]\nls = [6, 10]\nls = [10]\nls = []\n```\nThe corresponding sums are (put together in a list):\n`[20, 20, 19, 16, 10"},{"id":"5cc70653658d6f002ab170b5","name":"Magnitude","rank":-6,"tags":["Fundamentals"],"languages":["racket","python","csharp","ruby","shell","rust","pascal","lua","perl","raku","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"We will represent complex numbers in either cartesian or polar form as an array/list, using the first element as a type tag; the **normal** tags are `\"cart\"` (for cartesian) and `\"polar\"`. The forms of the tags depend on the language.\n                                           \n-"},{"id":"5ca3ae9bb7de3a0025c5c740","name":"Change your Points of View","rank":-6,"tags":["Fundamentals"],"languages":["racket","python","clojure","ruby","javascript","scala","fsharp","csharp","vb","java","kotlin"],"rank_name":"6 kyu","description":"We want to define the location `x`, `y` of a `point` on a two-dimensional plane where `x` and `y` are positive integers.\n\nOur definition of such a `point` will return a function (procedure). There are several possible functions to do that.\n\nPossible form of `point`:\n\n```if:racket"},{"id":"5b40b666dfb4291ad9000049","name":"The Walker","rank":-6,"tags":["Fundamentals","Geometry"],"languages":["python","javascript","java","ruby","csharp","c","cpp","clojure","r","fsharp","php","kotlin","groovy","coffeescript","lua","go","rust","nim","crystal","swift","elixir","scala","fortran","julia","powershell","ocaml","haskell","reason","racket","typescript","vb","haxe","dart","pascal","perl","raku","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"![alternative text][the_image]\n\nThe walker\n\nThe walker starts from point O, walks along OA, AB and BC. When he is in C (C will be in the upper half-plane), what is the distance `CO`? What is the angle `tOC` in positive degrees, minutes, seconds?\n\nAngle `tOA` is `alpha` (here 45 d"},{"id":"5b1cd19fcd206af728000056","name":"Which x for that sum?","rank":-5,"tags":["Fundamentals","Mathematics"],"languages":["python","javascript","java","csharp","c","cpp","ruby","fsharp","clojure","kotlin","go","rust","php","r","fortran","nim","groovy","lua","coffeescript","crystal","scala","swift","powershell","julia","ocaml","elixir","haskell","reason","racket","typescript","vb","forth","factor","shell","prolog","haxe","dart","commonlisp","pascal","raku","perl","elm","cobol","d","erlang"],"rank_name":"5 kyu","description":"Consider the sequence `U(n, x) = x + 2x**2 + 3x**3 + .. + nx**n` where x is a real number and n a positive integer.\n\nWhen `n` goes to infinity and `x` has a correct value (ie `x` is in its domain of convergence `D`), `U(n, x)` goes to a finite limit `m` depending on `x`.\n\nUsually"},{"id":"5b0c0ec907756ffcff00006e","name":"Floating-point Approximation (III)","rank":-7,"tags":["Fundamentals"],"languages":["python","ruby","javascript","java","csharp","c","cpp","clojure","fsharp","fortran","rust","r","go","kotlin","php","nim","groovy","coffeescript","crystal","lua","scala","ocaml","elixir","swift","julia","powershell","reason","racket","vb","dart","shell","haxe","pascal","perl","raku"],"rank_name":"7 kyu","description":"Professor Chambouliard has just completed an experiment on gravitational waves.\nHe measures their effects on small magnetic particles. This effect is very small and negative. In his first experiment the effect satisfies the equation:\n\n`x**2 + 1e9 * x + 1 = 0`. \n\nProfessor C. know"},{"id":"5b06c990908b7eea73000069","name":"Experimenting with a sequence of complex numbers","rank":-6,"tags":["Fundamentals","Puzzles"],"languages":["fortran","python","ruby","c","cpp","csharp","r","fsharp","rust","groovy","java","javascript","kotlin","lua","php","nim","go","clojure","coffeescript","crystal","scala","swift","powershell","julia","ocaml","haskell","elixir","reason","racket","typescript","vb","forth","shell","prolog","haxe","pascal","raku","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"Consider the sequence `S(n, z) = (1 - z)(z + z**2 + z**3 + ... + z**n)` where `z` is a complex number\n and `n` a positive integer (n > 0).\n\nWhen `n` goes to infinity and `z` has a correct value (ie `z` is in its domain of convergence `D`), `S(n, z)` goes to a finite limit\n `lim` "},{"id":"5ae0324f5bc35a0742001284","name":"Fortran for beginners: splitting","tags":["Fundamentals"],"languages":["fortran"],"description":"You are given strings all of same length and of the same form.\nThey contain numeric and non-numeric substrings. \nEach numeric substring is formatted in a 10-width field and has 2 decimals (some are in scientific format)\nand is followed by a letter which represents a unit, except "},{"id":"5adc571c88a0b777160000c8","name":"Fortran for beginners: formatting","rank":-7,"tags":["Fundamentals"],"languages":["fortran"],"rank_name":"7 kyu","description":"A capacitor is an electrical device that stores electric charges. It essentially consists of \ntwo flat plates with an insulating material (the dielectric) between them.\n\nThe capacitance of a capacitor is defined as \n`Capacitance = Charge / Volts`\n\nwhere Charge is the amount of ch"},{"id":"5aaea7a25084d71006000082","name":"Undirected  weighted graph","rank":-4,"tags":["Fundamentals","Lists","Matrix","Graph Theory"],"languages":["python"],"rank_name":"4 kyu","description":"## Some graph theory definitions:\n\n* A *graph* consists of *nodes*, also known as *vertices* (singular: *vertex*).\n* The number of vertices in a graph is called the *order* of this graph.\n* In the kata nodes will be numbered from A0 to A(n-1) for a graph with n nodes.\n* Nodes may"},{"id":"5a48948e145c46820b00002f","name":"Steps in k-primes","rank":-6,"tags":["Mathematics","Number Theory"],"languages":["ruby","python","javascript","java","csharp","cpp","c","php","clojure","haskell","fsharp","go","rust","elixir","ocaml","swift","coffeescript","typescript","kotlin","crystal","groovy","scala","julia","r","powershell","nim","reason","racket","vb","prolog","fortran","dart","pascal","lua","perl","raku","elm","d","erlang"],"rank_name":"6 kyu","description":"A natural number is called **k-prime** if it has exactly k prime factors, counted with multiplicity.\n\nA natural number is thus prime if and only if it is 1-prime.\n```\nExamples of k-primes:\nk = 2 -> 4, 6, 9, 10, 14, 15, 21, 22, …\nk = 3 -> 8, 12, 18, 20, 27, 28, 30, …\nk = 5 -> 32, "},{"id":"5a420163b6cfd7cde5000077","name":"Ranking NBA teams","rank":-6,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","java","csharp","coffeescript","clojure","groovy","r","powershell","go","nim","php","rust","pascal","lua","perl","elm","d"],"rank_name":"6 kyu","description":"You are given a string with results of NBA teams (see the data in \"Sample Tests\") separated by commas e.g:\n\nr = \n`Los Angeles Clippers 104 Dallas Mavericks 88,New York Knicks 101 Atlanta Hawks 112,Indiana Pacers 103 Memphis Grizzlies 112,\n Los Angeles Clippers 100 Boston Celtics "},{"id":"5a057ec846d843c81a0000ad","name":"1/n- Cycle","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["shell","python","javascript","ruby","php","java","csharp","cpp","c","coffeescript","typescript","r","crystal","rust","go","nim","objc","clojure","swift","fsharp","ocaml","haskell","elixir","kotlin","fortran","julia","nasm","groovy","scala","powershell","reason","racket","vb","forth","prolog","haxe","commonlisp","dart","pascal","raku","perl","lua","elm","d","cobol","erlang"],"rank_name":"6 kyu","description":"Let `n` be an integer coprime with `10`, e.g. `7`.\n\n`1/7 = 0.142857 142857 142857 ...`.\n\nWe see that the decimal part has a cycle: `142857`. The length of this cycle is `6`. In the same way:\n\n`1/11 = 0.09 09 09 ...`. Cycle length is `2`.\n\n#### Task\n\nGiven an integer `n (n > 1)`, "},{"id":"5a045fee46d843effa000070","name":"Factorial decomposition","rank":-5,"tags":["Fundamentals"],"languages":["shell","javascript","haskell","ruby","coffeescript","crystal","cpp","python","java","csharp","fortran","groovy","scala","swift","r","php","julia","go","powershell","kotlin","nim","fsharp","elixir","rust","racket","clojure","typescript","vb","haxe","commonlisp","c","dart","pascal","lua","perl","raku","elm","d","cobol","erlang","prolog"],"rank_name":"5 kyu","description":"The aim of the kata is to decompose `n!` (factorial n) into its prime factors.\n\nExamples:\n```\nn = 12; decomp(12) -> \"2^10 * 3^5 * 5^2 * 7 * 11\"\nsince 12! is divisible by 2 ten times, by 3 five times, by 5 two times and by 7 and 11 only once.\n\nn = 22; decomp(22) -> \"2^19 * 3^9 * 5"},{"id":"5a02cf76c9fc0ee71d0000d5","name":"Getting along with Bernoulli's numbers","rank":-5,"tags":["Fundamentals","Mathematics"],"languages":["shell","python","javascript","julia","java","csharp","cpp","scala","ruby","clojure","racket","fsharp","fortran","haskell","lua","pascal","perl","raku"],"rank_name":"5 kyu","description":"Let us define a function `f`such as:\n\n- (1) for k positive odd integer > 2 : \n\n<img src=\"https://latex.codecogs.com/gif.latex?\\bg_green&space;f(k)&space;=&space;\\sum_{n=1}^{nb}1/n^{k}\" title=\"\\bg_green f(k) = \\sum_{n=1}^{nb}1/n^{k}\"\n     />\n\n- (2) for k positive even integer >= 2"},{"id":"59f4a0acbee84576800000af","name":"Positions Average","rank":-6,"tags":["Fundamentals","Strings"],"languages":["shell","python","javascript","java","csharp","cpp","julia","c","scala","ruby","r","powershell","go","nim","php","rust","clojure","racket","typescript","fsharp","vb","kotlin","groovy","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"Suppose you have 4 numbers: `0, 9, 6, 4` and 3 strings composed with them:\n```\ns1 = \"6900690040\"\ns2 = \"4690606946\"\ns3 = \"9990494604\"\n```\n\nCompare `s1` and `s2` to see how many positions they have in common:\n`0` at index 3, `6` at index 4, `4` at index 8 : 3 common positions out o"},{"id":"59f44c7bd4b36946fd000052","name":"Errors : histogram","rank":-6,"tags":["Fundamentals","Strings"],"languages":["shell","ruby","java","python","c","csharp","cpp","scala","julia","r","powershell","go","javascript","nim","php","rust","clojure","racket","typescript","fsharp","vb","kotlin","groovy","pascal","perl","lua","elm","d"],"rank_name":"6 kyu","description":"In a factory a printer prints labels for boxes. The printer uses colors which, for the sake of simplicity, are named with letters from a to z (except letters `u`, `w`, `x` or `z` that are for errors).\n\nThe colors used by the printer are recorded in a control string. For example a"},{"id":"59f3956825d575e3330000a3","name":"Positions of a substring in a string","rank":-5,"tags":["Fundamentals","Strings"],"languages":["shell","python","perl"],"rank_name":"5 kyu","description":"Let us go  through an example.\n\nYou have a string (here a short one):\n\n`s = \"GCAGCaGCTGCgatggcggcgctgaggggtcttgggggctctaggccggccacctactgg\"`,\nwith only upper or lower cases letters A, C, G, T.\n\nYou want to find substrings in this string.  Each substring to find has a label.\nThe di"},{"id":"59df2f8f08c6cec835000012","name":"Meeting","rank":-6,"tags":["Fundamentals"],"languages":["shell","javascript","python","java","csharp","scala","julia","r","kotlin","powershell","go","ruby","nim","php","clojure","racket","typescript","fsharp","rust","coffeescript","crystal","dart","groovy","haxe","commonlisp","pascal","perl","lua","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"John has invited some friends. His list is:\n```\ns = \"Fred:Corwill;Wilfred:Corwill;Barney:Tornbull;Betty:Tornbull;Bjon:Tornbull;Raphael:Corwill;Alfred:Corwill\";\n```\n\nCould you make a program that \n- makes this string uppercase\n- gives it sorted in alphabetical order by last name. "},{"id":"59de1e2fe50813a046000124","name":"Matching And Substituting","rank":-5,"tags":["Fundamentals"],"languages":["shell","python","javascript","julia","ruby","r","powershell","go","nim","php","java","csharp","rust","clojure","racket","typescript","fsharp","scala","kotlin","perl","pascal","d"],"rank_name":"5 kyu","description":"I got lots of files beginning like this:\n```\nProgram title: Primes\nAuthor: Kern\nCorporation: Gold\nPhone: +1-503-555-0091\nDate: Tues April 9, 2005\nVersion: 6.7\nLevel: Alpha\n```\nHere we will work with strings like the string data above and not with files.\n\nThe function `change(s, p"},{"id":"59d9d8cb27ee005972000045","name":"Catalog","rank":-6,"tags":["Fundamentals","Strings"],"languages":["shell","python","javascript","ruby","java","julia","scala","r","kotlin","powershell","go","nim","php","csharp","rust","clojure","racket","typescript","fsharp","pascal","lua","perl","elm","d","prolog"],"rank_name":"6 kyu","description":"You are given a *small* extract of a catalog:\n\n```\ns = \"<prod><name>drill</name><prx>99</prx><qty>5</qty></prod>\n\n<prod><name>hammer</name><prx>10</prx><qty>50</qty></prod>\n\n<prod><name>screwdriver</name><prx>5</prx><qty>51</qty></prod>\n\n<prod><name>table saw</name><prx>1099.99</"},{"id":"59d727d40e8c9dd2dd00009f","name":"Easy Balance Checking","rank":-6,"tags":["Fundamentals","Strings"],"languages":["shell","python","javascript","ruby","java","julia","scala","r","powershell","go","nim","php","rust","csharp","clojure","racket","typescript","fsharp","kotlin","pascal","perl","elm","d","prolog"],"rank_name":"6 kyu","description":"You are given a (small) check book as a - sometimes - cluttered (by non-alphanumeric characters) string:\n\n```\n\"1000.00\n125 Market 125.45\n126 Hardware 34.95\n127 Video 7.45\n128 Book 14.32\n129 Gasoline 16.10\"\n```\nThe first line shows the original balance. \nEach other line (when not "},{"id":"59d0ee709f0cbcf65400003b","name":"Address Book by State","rank":-6,"tags":["Fundamentals","Strings"],"languages":["shell","javascript","python","ruby","powershell","go","nim","php","java","csharp","rust","clojure","typescript","fsharp","scala","kotlin","racket","perl","d"],"rank_name":"6 kyu","description":"Given a string with friends to visit in different states:\n```\nad3=\"John Daggett, 341 King Road, Plymouth MA\nAlice Ford, 22 East Broadway, Richmond VA\nSal Carpenter, 73 6th Street, Boston MA\"\n```\nwe want to produce a result that sorts the names by state and lists the name of the s"},{"id":"59ccf051dcc4050f7800008f","name":"Buddy Pairs","rank":-5,"tags":["Fundamentals","Mathematics"],"languages":["shell","javascript","coffeescript","ruby","julia","java","csharp","cpp","c","fortran","groovy","scala","python","r","php","go","ocaml","clojure","elixir","haskell","fsharp","powershell","nim","rust","reason","racket","typescript","vb","forth","haxe","kotlin","commonlisp","dart","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"5 kyu","description":"### Buddy pairs\n\nYou know what divisors of a number are. The divisors of a positive integer `n` are said to be `proper` when you consider only the divisors other than `n` itself. In the following description, divisors will mean `proper` divisors.  For example for  `100` they are "},{"id":"59c68ea2aeb2843e18000109","name":"Financing a purchase","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["shell","python","javascript","coffeescript","ruby","java","csharp","groovy","scala","r","powershell","swift","fsharp","julia","go","cpp","nim","php","rust","clojure","racket","typescript","kotlin","commonlisp","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"The description is rather long but it tries to explain what a financing plan is. \n\nThe fixed monthly payment for a fixed rate mortgage is the amount paid by the borrower every month that ensures \nthat the loan is paid off in full with interest at the end of its term. \n\nThe monthl"},{"id":"59bf943cafcda28e31000130","name":"Around Fibonacci: chunks and counts","rank":-5,"tags":["Strings","Fundamentals"],"languages":["shell","python","javascript","ruby","racket","raku","perl","d","erlang","prolog"],"rank_name":"5 kyu","description":"Another Fibonacci... yes but with other kinds of result.\nThe function is named `aroundFib` or `around_fib`, depending of the language.\nIts parameter is `n` (positive integer).\n\nFirst you have to calculate `f` the value of `fibonacci(n)` with `fibonacci(0) --> 0` and\n`fibonacci(1)"},{"id":"58ce8725c835848ad6000007","name":"Drying Potatoes","rank":-7,"tags":["Fundamentals","Puzzles"],"languages":["ruby","python","javascript","coffeescript","java","csharp","cpp","c","php","haskell","fsharp","clojure","elixir","ocaml","swift","crystal","typescript","shell","go","rust","r","nim","kotlin","fortran","julia","nasm","groovy","scala","powershell","lua","reason","racket","vb","forth","factor","dart","elm","prolog","cfml","haxe","commonlisp","pascal","raku","perl","d","cobol","erlang"],"rank_name":"7 kyu","description":"All we eat is water and dry matter.\n\nLet us begin with an example:\n\nJohn bought potatoes: their weight is 100 kilograms. Potatoes contain water and dry matter. The water content is 99 percent of the total weight. He thinks they are too wet and puts them in an oven - at low temper"},{"id":"5879f95892074d769f000272","name":"Easy Cyclist's Training","rank":-5,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","java","csharp","clojure","cpp","c","elixir","fsharp","php","crystal","ocaml","typescript","haskell","rust","r","kotlin","groovy","go","nim","scala"],"rank_name":"5 kyu","description":"The description is rather long but you are given all needed formulas (almost:-)\n\nJohn has bought a bike but before going moutain biking he wants us to do a few simulations.\n\nHe gathered information:\n\n- His trip will consist of an ascent of `dTot` kilometers with an average slope "},{"id":"5868b2de442e3fb2bb000119","name":"Closest and Smallest","rank":-5,"tags":["Fundamentals","Sorting"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","elixir","fsharp","crystal","php","typescript","cpp","c","ocaml","r","shell","groovy","scala","go","nim","racket","vb","kotlin","rust","pascal","perl","elm","d","erlang"],"rank_name":"5 kyu","description":"#### Input\n\n- a string `strng` of n positive numbers (n = 0 or n >= 2)\n\nLet us call weight of a number the sum of its digits. \nFor example `99` will have \"weight\" `18`, `100` will have \"weight\" `1`.\n\nTwo numbers are \"close\" if the difference of their weights is small.\n\n#### Task:"},{"id":"581ee0db1bbdd04e010002fd","name":"Floating-point Approximation (II)","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","php","java","csharp","clojure","cpp","fsharp","elixir","haskell","crystal","ocaml","typescript","c","r","shell","kotlin","groovy","scala","julia","powershell","go","nim","rust","reason","racket","vb","prolog","haxe","commonlisp","pascal","perl","raku","erlang"],"rank_name":"6 kyu","description":"Given \n\n- a semi-inclusive interval `I = [l, u)` (l is in interval I but u is not)\n`l` and `u` being floating numbers `(0 <= l < u)`, \n\n- an integer `n (n > 0)`\n- a function `f: x (float number) -> f(x) (float number)` \n\nwe want to return as a list the `n` values:\n\n`f(l), f(l + 1"},{"id":"58184387d14fc32f2b0012b2","name":"Floating-point Approximation (I)","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","javascript","coffeescript","php","crystal","csharp","cpp","fsharp","java","clojure","haskell","elixir","ocaml","typescript","c","rust","swift","go","shell","r","kotlin","fortran","julia","groovy","scala","powershell","lua","nim","reason","racket","vb","forth","prolog","haxe","pascal","perl","raku","elm","cobol","d","erlang"],"rank_name":"6 kyu","description":"Consider the function \n\n`f: x -> sqrt(1 + x) - 1` at `x = 1e-15`. \n\nWe get:\n`f(x) = 4.44089209850062616e-16` \n\nor something around that, depending on the language.\n\nThis function involves the subtraction of a pair of similar numbers when x is near 0\nand the results are significan"},{"id":"5772382d509c65de7e000982","name":"Fibo akin","rank":-5,"tags":["Algorithms","Recursion"],"languages":["ruby","python","java","csharp","elixir","clojure","javascript","coffeescript","typescript","haskell","cpp","php","fsharp","c","crystal","ocaml","rust","swift","go","r","shell","kotlin","fortran","groovy","julia","scala","powershell","nim","reason","lua","pascal","perl","cobol","d","erlang"],"rank_name":"5 kyu","description":"Be u(n) a sequence beginning with:\n```\nu[1]  = 1,  u[2]  = 1,  u[3]  = 2,  u[4]  = 3,  u[5]  = 3,  u[6] = 4,\n\nu[7]  = 5,  u[8]  = 5,  u[9]  = 6,  u[10] = 6,  u[11] = 6,  u[12] = 8,\n\nu[13] = 8,  u[14] = 8,  u[15] = 10, u[16] = 9,  u[17] = 10, u[18] = 11,\n\nu[19] = 11, u[20] = 12, u"},{"id":"57591ef494aba64d14000526","name":"John and Ann sign up for Codewars","rank":-5,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","javascript","coffeescript","typescript","java","csharp","haskell","clojure","elixir","cpp","php","crystal","fsharp","c","ocaml","rust","swift","go","r","shell","kotlin","fortran","julia","nasm","groovy","scala","powershell","nim","reason","racket","vb","dart","pascal","lua","perl","elm","d","erlang"],"rank_name":"5 kyu","description":"John and his wife Ann have decided to go to Codewars.  On the first day Ann will do one kata and John - he wants to know how it is working - 0 kata.\n\nLet us call `a(n)` - and `j(n)` - the number of katas done by Ann - and John - at day `n`. We have `a(0) = 1` and in the same mann"},{"id":"573992c724fc289553000e95","name":"Find the smallest","rank":-5,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","elixir","cpp","typescript","php","crystal","fsharp","c","swift","r","shell","ocaml","groovy","scala","julia","go","nim","racket","reason","vb","kotlin","rust","pascal","perl","elm","d","cobol","erlang","prolog"],"rank_name":"5 kyu","description":"You have a positive number `n` consisting of digits. \nYou can do **at most** one operation: \nChoosing the index of a digit in the number, remove this digit at that index and insert it back to another or at the same place in the number in order to find the smallest number you can "},{"id":"573182c405d14db0da00064e","name":"Consecutive k-Primes","rank":-5,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","elixir","crystal","fsharp","c","typescript","ocaml","rust","swift","go","r","shell","kotlin","groovy","scala","julia","powershell","nim","racket","reason","vb","haxe","pascal","perl","d","prolog"],"rank_name":"5 kyu","description":"A natural number is called **k-prime** if it has exactly k prime factors, counted with multiplicity. A natural number is thus prime if and only if it is 1-prime.\n```\nExamples:\nk = 2 -> 4, 6, 9, 10, 14, 15, 21, 22, …\nk = 3 -> 8, 12, 18, 20, 27, 28, 30, …\nk = 5 -> 32, 48, 72, 80, 1"},{"id":"5726f813c8dcebf5ed000a6b","name":"k-Primes","rank":-5,"tags":["Number Theory","Mathematics","Algorithms"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","elixir","crystal","fsharp","c","typescript","ocaml","rust","swift","go","shell","r","kotlin","scala","groovy","julia","powershell","nim","reason","racket","vb","prolog","fortran","haxe","dart","pascal","lua","perl","raku","elm","d","erlang"],"rank_name":"5 kyu","description":"A natural number is called **k-prime** if it has exactly `k` prime factors, counted with multiplicity. For example:\n```\nk = 2  -->  4, 6, 9, 10, 14, 15, 21, 22, ...\nk = 3  -->  8, 12, 18, 20, 27, 28, 30, ...\nk = 5  -->  32, 48, 72, 80, 108, 112, ...\n```\nA natural number is thus p"},{"id":"5700c9acc1555755be00027e","name":"All Inclusive?","rank":-7,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","r","shell","kotlin","scala","julia","powershell","go","nim","rust","racket","vb","perl","d","prolog"],"rank_name":"7 kyu","description":"Input: \n\n- a string `strng`\n- an array of strings `arr`\n\nOutput of function `contain_all_rots(strng, arr) (or containAllRots or contain-all-rots)`:\n\n- a boolean `true` if all rotations of `strng` are included in `arr`\n- `false` otherwise\n\n#### Examples:\n```\ncontain_all_rots(\n  \"b"},{"id":"56fe17fcc25bf3e19a000292","name":"Disguised sequences (II)","rank":-6,"tags":["Puzzles","Discrete Mathematics","Mathematics"],"languages":["ruby","python","javascript","coffeescript","java","csharp","clojure","haskell","cpp","php","typescript","elixir","crystal","fsharp","c","ocaml","rust","swift","go","shell","r","nim","kotlin","objc","fortran","nasm","julia","scala","powershell","racket","forth","factor","haxe","pascal","lua","perl","d","cobol","erlang","prolog"],"rank_name":"6 kyu","description":"Let us define two sums `v(n, p)` and `u(n, p)`:\n\n```math\nv(n,p) = \\sum_{k=0}^n (-1)^k \\times p \\times 4^{n-k} \\times {2n - k \\choose k}\n```\n\n```math\nu(n,p) = \\sum_{k=0}^n (-1)^k \\times p \\times 4^{n-k} \\times {2n - k + 1 \\choose k}\n```\n\n#### Task:\n- 1) Calculate `v(n, p)` and `u("},{"id":"56fcc393c5957c666900024d","name":"Coding with Squared Strings","rank":-5,"tags":["Fundamentals","Strings","Ciphers","Cryptography"],"languages":["ruby","python","javascript","haskell","clojure","java","csharp","coffeescript","php","cpp","crystal","c","typescript","swift","fsharp","ocaml","fortran","scala","julia","r","go","nim","racket","rust","perl","erlang","prolog"],"rank_name":"5 kyu","description":"A squared string has n lines, each substring being n characters long: For example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"` is a squared string of size `4`.\n\nWe will use squared strings to code and decode texts. To make things easier\nwe suppose that our original text doesn't include the c"},{"id":"56f3a1e899b386da78000732","name":"Parts of a list","rank":-7,"tags":["Arrays","Lists","Data Structures","Algorithms"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","java","csharp","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","shell","kotlin","julia","powershell","go","nim","rust","reason","racket","scala","vb","dart","perl","d","erlang","prolog"],"rank_name":"7 kyu","description":"Write a function `partlist` that gives all the ways to divide a list (an array) of at least two elements into two non-empty parts.\n\n- Each two non empty parts will be in a pair (or an array for languages without tuples or a `struct`in C - C: see Examples test Cases - ) \n- Each pa"},{"id":"56f253dd75e340ff670002ac","name":"Composing squared strings","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","php","cpp","crystal","c","typescript","fsharp","ocaml","julia","go","nim","reason","racket","scala","perl","cobol"],"rank_name":"7 kyu","description":"A squared string is a string of `n` lines, each substring being `n` characters long.\nWe are given two n-squared strings.\n\nFor example:\n\n`s1 = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\n`s2 = \"qrst\\nuvwx\\nyz12\\n3456\"`\n\n\nLet us build a new string `strng` of size `(n + 1) x n` in the following way:"},{"id":"56efab15740d301ab40002ee","name":"Reducing by steps","rank":-6,"tags":["Mathematics","Arrays","Functional Programming","Lists","Data Structures"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","java","csharp","elixir","cpp","php","typescript","crystal","fsharp","c","ocaml","rust","swift","go","r","nim","shell","kotlin","julia","scala","reason","racket","vb","prolog","pascal","lua","perl","raku","elm","d","erlang","factor"],"rank_name":"6 kyu","description":"Data: an array of integers, a function f of two variables and an init value.\n\n`Example: a = [2, 4, 6, 8, 10, 20], f(x, y) = x + y; init = 0`\n\nOutput: an array of integers, say r, such that\n\n`r = [r[0] = f(init, a[0]), r[1] = f(r[0], a[1]), r[2] = f(r[1], a[2]), ...]`\n\nWith our ex"},{"id":"56ed20a2c4e5d69155000301","name":"Scaling Squared Strings","rank":-7,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","php","cpp","crystal","c","typescript","fsharp","ocaml","julia","go","nim","racket","scala","reason","pascal","perl","elm","cobol","erlang","rust"],"rank_name":"7 kyu","description":"You are given a string of `n` lines, each substring being `n` characters long. \nFor example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\nWe will study the \"horizontal\" and the \"vertical\" **scaling** of this square of strings.\n\nA k-horizontal scaling of a string consists of replicating `k` t"},{"id":"56e7d40129035aed6c000632","name":"Easy Line","rank":-7,"tags":["Fundamentals","Mathematics"],"languages":["clojure","ruby","python","javascript","coffeescript","haskell","java","csharp","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","r","nim","shell","kotlin","julia","go","racket","vb","scala","fortran","perl","d","erlang"],"rank_name":"7 kyu","description":"In the drawing below we have a part of the Pascal's triangle, horizontal lines are numbered from **zero** (top).\n\nWe want to calculate the sum of the squares of the binomial coefficients on a given horizontal line with a function called `easyline` (or easyLine or easy-line).\n\nCan"},{"id":"56e3cd1d93c3d940e50006a4","name":"How Green Is My Valley?","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","elixir","cpp","php","typescript","crystal","fsharp","c","shell","ocaml","kotlin","julia","r","go","nim","rust","racket","reason","vb","scala","pascal","perl","cobol","d","erlang"],"rank_name":"7 kyu","description":"-  Input : an array of integers.\n-  Output : this array, but sorted in such a way that there are two wings:\n -  the left wing with numbers decreasing, \n -  the right wing with numbers increasing. \n -  the two wings have the same length. If the length of the array is odd\n   the wi"},{"id":"56dbf59b0a10feb08c000227","name":"Moves in squared strings (IV)","rank":-6,"tags":["Algorithms","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","php","typescript","cpp","c","fsharp","rust","crystal","swift","r","shell","objc","ocaml","scala","julia","go","nim","racket","perl","elm","erlang","prolog"],"rank_name":"6 kyu","description":"You are given a string of `n` lines, each substring being `n` characters long: For example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\nWe will study some transformations of this square of strings.\n\n- Symmetry with respect to the [antidiagonal](https://en.wikipedia.org/wiki/Main_diagonal#An"},{"id":"56dbeec613c2f63be4000be6","name":"Moves in squared strings (III)","rank":-6,"tags":["Algorithms","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","php","typescript","cpp","fsharp","c","crystal","rust","swift","r","shell","objc","ocaml","scala","julia","go","nim","racket","dart","pascal","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"You are given a string of `n` lines, each substring being `n` characters long: For example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\nWe will study some transformations of this square of strings.\n\nLet's now transform this string!\n\n- Symmetry with respect to the main diagonal: diag_1_sym ("},{"id":"56dbe7f113c2f63570000b86","name":"Moves in squared strings (II)","rank":-6,"tags":["Algorithms","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","typescript","fsharp","c","crystal","rust","swift","r","shell","objc","ocaml","scala","julia","go","nim","racket","kotlin","prolog","dart","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"You are given a string of `n` lines, each substring being `n` characters long: For example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\nWe will study some transformations of this square of strings.\n\n- rot(s):\\\nClock rotation 180 degrees.\n```\nrot(s) => \"ponm\\nlkji\\nhgfe\\ndcba\"\n```\n- selfie_a"},{"id":"56dbe0e313c2f63be4000b25","name":"Moves in squared strings (I)","rank":-7,"tags":["Fundamentals","Algorithms","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","typescript","fsharp","c","crystal","rust","swift","r","shell","objc","ocaml","julia","scala","go","nim","racket","reason","kotlin","elixir","prolog","pascal","dart","lua","perl","elm","d","erlang"],"rank_name":"7 kyu","description":"This kata is the first of a sequence of four about \"Squared Strings\".\n\nYou are given a string of `n` lines, each substring being `n` characters long: For example:\n\n`s = \"abcd\\nefgh\\nijkl\\nmnop\"`\n\nWe will study some transformations of this square of strings.\n\n- Vertical mirror:\nve"},{"id":"56cac350145912e68b0006f0","name":"up AND down","rank":-6,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","elixir","cpp","php","typescript","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","kotlin","scala","julia","powershell","nim","reason","racket","vb","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"*Don't be afraid, the description is rather long but - hopefully - it is in order that the process be well understood*.\n\nYou are given a string `s` made up of substring `s(1), s(2), ..., s(n)` separated by whitespaces.\nExample:\n`\"after be arrived two My so\"`\n\n#### Task\nReturn a s"},{"id":"56c04261c3fcf33f2d000534","name":"Magnet particules in boxes","rank":-4,"tags":["Mathematics","Matrix","Algorithms"],"languages":["ruby","python","javascript","coffeescript","csharp","clojure","haskell","java","cpp","php","typescript","elixir","crystal","fsharp","c","rust","swift","go","shell","r","nim","ocaml","kotlin","fortran","powershell","julia","scala","reason","racket","vb","forth","prolog","haxe","lua","pascal","perl","elm","cobol","d","erlang","nasm"],"rank_name":"4 kyu","description":"Professor Chambouliard hast just discovered a new type of magnet material. He put particles of this material in a box made of small boxes arranged \nin K rows and N columns as a kind of **2D matrix** `K x N` where `K` and `N` are postive integers.\nHe thinks that his calculations s"},{"id":"56baeae7022c16dd7400086e","name":"Phone Directory","rank":-5,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","csharp","java","cpp","php","typescript","swift","r","go","crystal","julia","powershell","nim","rust","racket","fsharp","vb","scala","kotlin","pascal","perl","elm","d"],"rank_name":"5 kyu","description":"John keeps a backup of his old personal phone book as a text file. On each line of the file\nhe can find the phone number (formated as `+X-abc-def-ghij` where X stands for one or two digits), the corresponding name\nbetween `<` and `>` and the address. \n\nUnfortunately everything is"},{"id":"56b5afb4ed1f6d5fb0000991","name":"Reverse or rotate?","rank":-6,"tags":["Algorithms","Strings"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","csharp","java","elixir","cpp","php","typescript","crystal","fsharp","c","rust","swift","r","shell","ocaml","kotlin","scala","julia","powershell","go","nim","racket","reason","vb","lua","pascal","perl","elm","d","cobol"],"rank_name":"6 kyu","description":"The input is a string `str` of digits. Cut the string into chunks (a chunk here is a substring of the initial string) of size `sz` (ignore the last chunk if its size is less than `sz`).\n\nIf the sum of a chunk's digits is divisible by `2`, reverse that chunk; \notherwise rotate it "},{"id":"56af1a20509ce5b9b000001e","name":"Salesman's Travel","rank":-6,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","csharp","java","cpp","php","c","typescript","swift","elixir","r","shell","ocaml","kotlin","fsharp","scala","julia","powershell","go","nim","rust","pascal","perl","elm","d"],"rank_name":"6 kyu","description":"A traveling salesman has to visit clients. He got each client's address e.g. `\"432 Main Long Road St. Louisville OH 43071\"` as a list.\n\nThe basic zipcode format usually consists of two capital letters followed by a white space and five digits.\nThe list of clients to visit was giv"},{"id":"56a5d994ac971f1ac500003e","name":"Consecutive strings","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","csharp","java","elixir","cpp","php","typescript","crystal","fsharp","c","ocaml","rust","swift","go","r","shell","kotlin","powershell","julia","scala","nim","reason","racket","dart","haxe","pascal","raku","lua","perl","elm","cobol","d","erlang","prolog"],"rank_name":"6 kyu","description":"You are given an array(list) `strarr` of strings and an integer `k`. Your task is to return the **first** longest string\nconsisting of k **consecutive** strings taken in the array.\n\n#### Examples:\n```\nstrarr = [\"tree\", \"foling\", \"trashy\", \"blue\", \"abcdef\", \"uvwxyz\"], k = 2\n\nConca"},{"id":"56a4872cbb65f3a610000026","name":"Rotate for a Max","rank":-7,"tags":["Algorithms"],"languages":["ruby","python","javascript","coffeescript","haskell","clojure","csharp","java","elixir","cpp","php","typescript","crystal","fsharp","c","shell","ocaml","kotlin","julia","r","powershell","go","nim","racket","reason","scala","perl","prolog","rust","lua","factor","dart"],"rank_name":"7 kyu","description":"Let us begin with an example:\n\nTake a number: `56789`. Rotate left, you get `67895`. \n\nKeep the first digit in place and rotate left the other digits: `68957`. \n\nKeep the first two digits in place and rotate the other ones: `68579`. \n\nKeep the first three digits and rotate left t"},{"id":"56a32dd6e4f4748cc3000006","name":"Rainfall","rank":-6,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","coffeescript","csharp","haskell","clojure","java","cpp","php","c","typescript","swift","crystal","r","shell","ocaml","scala","kotlin","fsharp","julia","powershell","go","nim","rust","racket","fortran","pascal","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"`data`and `data1` are two strings with rainfall records of a few cities for months from January to December.\nThe records of towns are separated by `\\n`. The name of each town is followed by `:`. \n\n`data` and `towns` can be seen in \"Your Test Cases:\".\n\n#### Task:\n- function: `mean"},{"id":"569b5cec755dd3534d00000f","name":"Looking for a benefactor","rank":-7,"tags":["Fundamentals","Arrays"],"languages":["ruby","python","javascript","coffeescript","java","csharp","clojure","haskell","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","rust","r","nim","shell","kotlin","fortran","julia","powershell","go","reason","racket","scala","prolog","lua","pascal","perl","elm","d","erlang"],"rank_name":"7 kyu","description":"The accounts of the \"Fat to Fit Club (FFC)\" association are supervised by John as a volunteered accountant.\nThe association is funded through financial donations from generous benefactors. John has a list of\nthe first `n` donations: `[14, 30, 5, 7, 9, 11, 15]`\nHe wants to know ho"},{"id":"569218bc919ccba77000000b","name":"Target Date","rank":-7,"tags":["Fundamentals","Mathematics","Date Time"],"languages":["java","csharp","ruby","python","javascript","coffeescript","haskell","clojure","typescript","cpp","php","crystal","fsharp","c","ocaml","shell","r","kotlin","julia","elixir","powershell","go","rust","reason","scala","pascal","raku","perl","d","cobol","erlang"],"rank_name":"7 kyu","description":"You have an amount of money `a0 > 0` and you deposit it with an interest rate of `p percent divided by 360` *per day* on the `1st of January 2016`. You want to have an amount `a >= a0`.\n\n#### Task:\nThe function `date_nb_days` (or dateNbDays...) with parameters `a0, a, p` will ret"},{"id":"567501aec64b81e252000003","name":"Easy wallpaper","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","haskell","csharp","clojure","java","elixir","typescript","cpp","php","crystal","fsharp","ocaml","c","r","nim","shell","kotlin","fortran","groovy","swift","julia","powershell","go","rust","reason","racket","forth","scala","pascal","dart","raku","perl","lua","elm","d","erlang"],"rank_name":"7 kyu","description":"John wants to decorate the walls of a room with wallpaper.\nHe wants a fool-proof method for getting it right.\n\nJohn knows that the rectangular room has a length of `l` meters, a width of `w` meters, a height of `h` meters.\nThe standard width of the rolls he wants to buy is `52` c"},{"id":"5672682212c8ecf83e000050","name":"Twice linear","rank":-4,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","typescript","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","objc","kotlin","julia","fortran","nasm","elixir","scala","powershell","nim","reason","racket","prolog","haxe","dart","commonlisp","pascal","factor","raku","perl","lua","elm","cobol","d","erlang"],"rank_name":"4 kyu","description":"Consider a sequence `u` where u is defined as follows:\n\n1. The number `u(0) = 1` is the first one in `u`.\n2. For each `x` in `u`, then `y = 2 * x + 1` and `z = 3 * x + 1` must be in `u` too.\n3. There are no other numbers in `u`.\n\nEx: \n`u = [1, 3, 4, 7, 9, 10, 13, 15, 19, 21, 22, "},{"id":"566fc12495810954b1000030","name":"Count the Digit","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","elixir","cpp","php","crystal","fsharp","typescript","c","shell","ocaml","kotlin","fortran","swift","nasm","julia","r","powershell","go","nim","rust","reason","racket","scala","groovy","haxe","pascal","dart","perl","prolog","lua","elm","cobol","d","erlang"],"rank_name":"7 kyu","description":"Take an integer `n (n >= 0)` and a digit `d (0 <= d <= 9)` as an integer. \n\nSquare all numbers `k (0 <= k <= n)` between 0 and n. \n\nCount the numbers of digits `d` used in the writing of all the `k**2`. \n\nImplement the function taking `n` and `d` as parameters and returning this "},{"id":"566be96bb3174e155300001b","name":"Ball Upwards","rank":-6,"tags":["Fundamentals"],"languages":["python","javascript","java","csharp","coffeescript","haskell","clojure","ruby","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","rust","swift","go","shell","r","nim","objc","kotlin","fortran","julia","nasm","scala","powershell","reason","racket","forth","prolog","haxe","commonlisp","dart","pascal","raku","lua","perl","cobol","elm","d","erlang"],"rank_name":"6 kyu","description":"You throw a ball vertically upwards with an initial speed `v0 (in km per hour)`.\n\nThe height `h` of the ball at each time `t` is given by `$\\; h = v_0 \\cdot t - 0.5 \\cdot g \\cdot t \\cdot t \\;$`, where `g` is the Earth's gravity `$( g \\approx 9.81 \\, m/s^2 )$`.\n\nA device is record"},{"id":"5667e8f4e3f572a8f2000039","name":"Mumbling","rank":-7,"tags":["Fundamentals","Strings","Puzzles"],"languages":["ruby","python","javascript","haskell","csharp","java","clojure","coffeescript","elixir","typescript","cpp","php","crystal","fsharp","c","swift","go","rust","r","shell","ocaml","kotlin","scala","groovy","julia","powershell","nim","reason","racket","dart","elm","pascal","lua","perl","d","erlang","factor"],"rank_name":"7 kyu","description":"This time no story, no theory. The examples below show you how to write function `accum`:\n\n#### Examples:\n```\naccum(\"abcd\") -> \"A-Bb-Ccc-Dddd\"\naccum(\"RqaEzty\") -> \"R-Qq-Aaa-Eeee-Zzzzz-Tttttt-Yyyyyyy\"\naccum(\"cwAt\") -> \"C-Ww-Aaa-Tttt\"\n```\n\nThe parameter of accum is a string which i"},{"id":"566543703c72200f0b0000c9","name":"Disease Spread","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","csharp","java","haskell","clojure","cpp","php","typescript","elixir","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","kotlin","fortran","julia","scala","powershell","nim","reason","racket","prolog","haxe","dart","pascal","raku","vb","lua","perl","d","elm","erlang"],"rank_name":"6 kyu","description":"In 1978 the British Medical Journal reported on an outbreak of influenza at a British boarding school. There were `1000` students. The outbreak began with one infected student.\n\nWe want to study the spread of the disease through the population of this school. The total population"},{"id":"5663f5305102699bad000056","name":"Maximum Length Difference","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","csharp","haskell","java","clojure","cpp","php","crystal","c","typescript","fsharp","shell","ocaml","kotlin","elixir","julia","r","scala","powershell","go","nim","rust","reason","racket","haxe","pascal","perl","d","cobol","erlang"],"rank_name":"7 kyu","description":"You are given two arrays `a1` and `a2` of strings. Each string is composed with letters from `a` to `z`.\nLet `x` be any string in the first array and `y` be any string in the second array. \n\n  `Find max(abs(length(x) − length(y)))`\n\nIf `a1` and/or `a2` are empty return `-1` in ea"},{"id":"565c0fa6e3a7d39dee000125","name":"Braking well","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","javascript","java","csharp","coffeescript","haskell","clojure","typescript","cpp","php","elixir","crystal","fsharp","c","ocaml","rust","swift","go","shell","r","kotlin","fortran","julia","scala","powershell","nim","reason","racket","forth","prolog","haxe","dart","pascal","lua","perl","cobol","elm","d","erlang"],"rank_name":"6 kyu","description":"Braking distance `d1` is the distance a vehicle will go from the point when it brakes to when it comes to a complete stop. \nIt depends on the original speed `v` and on the coefficient of friction `mu` between the tires and the road surface.\n\nThe braking distance is one of two pri"},{"id":"565abd876ed46506d600000d","name":"Simpson's Rule - Approximate Integration","rank":-6,"tags":["Mathematics"],"languages":["ruby","python","javascript","coffeescript","java","csharp","haskell","clojure","cpp","php","crystal","elixir","fsharp","c","typescript","rust","swift","go","r","shell","ocaml","kotlin","fortran","julia","scala","powershell","nim","reason","racket","forth","prolog","haxe","dart","pascal","lua","perl","d","elm","cobol","erlang"],"rank_name":"6 kyu","description":"An integral:\n\n```math\n\\int_{a}^{b}f(x)dx\n```\ncan be approximated by the so-called Simpson’s rule:\n\n```math\n\\dfrac{b-a}{3n}(f(a)+f(b)+4\\sum_{i=1}^{n/2}f(a+(2i-1)h)+2\\sum_{i=1}^{n/2-1}f(a+2ih))\n```\nHere \n`h = (b - a) / n`, `n` being an even integer and `a <= b`. \n\nWe want to try Si"},{"id":"5656b6906de340bd1b0000ac","name":"Two to One","rank":-7,"tags":["Fundamentals"],"languages":["java","csharp","ruby","python","javascript","coffeescript","haskell","clojure","cpp","php","crystal","fsharp","c","elixir","typescript","shell","ocaml","kotlin","julia","go","r","rust","scala","powershell","nim","reason","racket","dart","pascal","perl","cobol","d","erlang"],"rank_name":"7 kyu","description":"Take 2 strings `s1` and `s2` including only letters from `a` to `z`.\nReturn a new **sorted** string (alphabetical ascending), the longest possible, containing distinct letters - each taken only once - coming from s1 or s2.\n\n#### Examples:\n```\na = \"xyaabbbccccdefww\"\nb = \"xxxxyyyya"},{"id":"56541980fa08ab47a0000040","name":"Printer Errors","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","csharp","java","haskell","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","shell","ocaml","groovy","nasm","julia","go","r","kotlin","powershell","nim","reason","racket","rust","scala","dart","swift","haxe","raku","pascal","perl","elm","cobol","d","erlang"],"rank_name":"7 kyu","description":"In a factory a printer prints labels for boxes. For one kind of boxes\nthe printer has to use colors which, for the sake of simplicity,\nare named with letters from `a to m`. \n\nThe colors used by the printer are\nrecorded in a control string. For example a \"good\" control string woul"},{"id":"56484848ba95170a8000004d","name":"Speed Control","rank":-7,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","javascript","haskell","csharp","java","coffeescript","clojure","cpp","php","elixir","crystal","fsharp","c","typescript","ocaml","shell","kotlin","julia","r","powershell","go","nim","rust","reason","racket","scala","dart","lua","perl","d","erlang","nasm"],"rank_name":"7 kyu","description":"In John's car the GPS records every `s` seconds the distance travelled from an origin (distances are measured in an arbitrary but consistent unit).\nFor example, below is part of a record with `s = 15`:\n\n    x = [0.0, 0.19, 0.5, 0.75, 1.0, 1.25, 1.5, 1.75, 2.0, 2.25]\nThe sections "},{"id":"56445c4755d0e45b8c00010a","name":"Banker's Plan","rank":-6,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","javascript","java","csharp","haskell","coffeescript","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","rust","swift","go","shell","r","ocaml","kotlin","fortran","julia","scala","powershell","nim","reason","racket","forth","prolog","haxe","dart","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"John has some amount of money of which he wants to deposit a part `f0` to the bank at the beginning\nof year `1`. He wants to withdraw each year for his living an amount `c0`.\n\nHere is his banker plan:\n\n- deposit `f0` at beginning of year 1\n- his bank account has an interest rate "},{"id":"564057bc348c7200bd0000ff","name":"A Rule of Divisibility by 13","rank":-6,"tags":["Fundamentals","Algorithms","Mathematics"],"languages":["ruby","python","javascript","haskell","csharp","java","coffeescript","clojure","elixir","cpp","typescript","php","crystal","fsharp","c","rust","swift","go","shell","r","ocaml","kotlin","julia","fortran","scala","powershell","nim","reason","racket","forth","prolog","haxe","dart","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"From Wikipedia:\n\n\"A divisibility rule is a shorthand way of determining whether a given integer is divisible by a fixed divisor without performing the division, usually by examining its digits.\"\n\nWhen you divide the successive powers of `10` by `13` you get the following remainde"},{"id":"563f0c54a22b9345bf000053","name":"A disguised sequence (I)","rank":-6,"tags":["Algorithms","Mathematics"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","rust","swift","go","shell","r","nim","kotlin","objc","fortran","nasm","julia","scala","lua","powershell","racket","forth","factor","prolog","haxe","dart","pascal","perl","cobol","d","erlang"],"rank_name":"6 kyu","description":"Given `$u_0 = 1, u_1 = 2$` \n\nAnd the relation `$6 u_n u_{n+1} - 5 u_n u_{n+2} + u_{n+1} u_{n+2} = 0$`\n\nCalculate `$u_n$` for any integer `$n \\ge 0$`.\n\n\n### Examples:\n\n`$n = 17, u_{17} = 131072$`\n\n`$n = 21, u_{21} = 2097152$`\n\n\n### Remark:\n\nYou can take two points of view to do th"},{"id":"563b662a59afc2b5120000c6","name":"Growth of a Population","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","cpp","php","crystal","fsharp","c","typescript","r","nim","shell","ocaml","lua","kotlin","fortran","elixir","julia","powershell","go","rust","reason","racket","forth","factor","dart","elm","scala","prolog","haxe","raku","pascal","perl","d","cobol"],"rank_name":"7 kyu","description":"In a small town the population is `p0 = 1000` at the beginning of a year. The population\nregularly increases by `2 percent` per year and moreover `50` new inhabitants per year come to live in the town. \nHow many years does the town need to see its population\ngreater than or equal"},{"id":"56347fcfd086de8f11000014","name":"Euler's method for a first-order ODE","rank":-5,"tags":["Algorithms"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","cpp","php","crystal","c","typescript","fsharp","r","shell","ocaml","swift","powershell","julia","go","nim","rust","reason","forth","scala","kotlin","prolog","fortran","haxe","pascal","lua","perl","elm","d","erlang"],"rank_name":"5 kyu","description":"## Euler's Method\n\nWe want to calculate the shape of an unknown curve which starts at a given point with a given slope. This curve satisfies an ordinary differential equation (ODE):\n\n```math\n\\frac{dy}{dx} = f(x, y);\\\\\ny(x_0) = y_0\n```\n\nThe starting point `$ A_0 (x_0, y_0) $` is k"},{"id":"562f91ff6a8b77dfe900006e","name":"Going to the cinema","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","cpp","elixir","typescript","php","crystal","fsharp","c","shell","ocaml","kotlin","fortran","scala","julia","r","powershell","go","nim","rust","reason","racket","forth","dart","haxe","swift","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"7 kyu","description":"My friend John likes to go to the cinema. He can choose between system A and system B.\n```\nSystem A : he buys a ticket (15 dollars) every time\nSystem B : he buys a card (500 dollars) and a first ticket for 0.90 times the ticket price, \nthen for each additional ticket he pays 0.90"},{"id":"562e274ceca15ca6e70000d3","name":"Parabolic Arc Length","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","shell","ocaml","kotlin","fortran","elixir","julia","scala","powershell","nim","purescript","reason","racket","forth","prolog","haxe","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"We want to approximate the length of a curve representing a function `y = f(x)` with  ` a <= x <= b`.\nFirst, we split the interval `[a, b]` into n sub-intervals with widths \n<code>h<sub>1</sub>, h<sub>2</sub>, ... , h<sub>n</sub></code> \nby defining points \n<code>x<sub>1</sub>, x"},{"id":"562b384167350ac93b00010c","name":"Weird prime generator","rank":-5,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","javascript","coffeescript","haskell","csharp","java","clojure","cpp","php","c","typescript","rust","swift","crystal","fsharp","shell","ocaml","go","nim","scala"],"rank_name":"5 kyu","description":"Consider the sequence `a(1) = 7, a(n) = a(n-1) + gcd(n, a(n-1)) for n >= 2`: \n\n`7, 8, 9, 10, 15, 18, 19, 20, 21, 22, 33, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 69, 72, 73...`.\n\nLet us take the differences between successive elements of the sequence and\nget a second sequence "},{"id":"5629db57620258aa9d000014","name":"Strings Mix","rank":-4,"tags":["Fundamentals","Strings"],"languages":["ruby","python","javascript","haskell","java","clojure","coffeescript","csharp","cpp","php","crystal","c","typescript","rust","swift","shell","ocaml","r","kotlin","fsharp","scala","julia","powershell","go","nim","racket","reason","elixir","pascal","perl","lua","elm","cobol","d","prolog"],"rank_name":"4 kyu","description":"Given two strings s1 and s2, we want to visualize how different the two strings are.\nWe will only take into account the *lowercase* letters (a to z).\nFirst let us count the frequency of each *lowercase* letters in s1 and s2.\n\n`s1 = \"A aaaa bb c\"`\n\n`s2 = \"& aaa bbb c d\"`\n\n`s1 has "},{"id":"561e9c843a2ef5a40c0000a4","name":"Gap in Primes","rank":-5,"tags":["Fundamentals"],"languages":["ruby","python","javascript","coffeescript","csharp","java","haskell","clojure","cpp","php","crystal","c","typescript","rust","swift","go","shell","fsharp","r","ocaml","kotlin","scala","julia","powershell","nim","reason","racket","forth","fortran","dart","prolog","pascal","lua","perl","elm","cobol","d"],"rank_name":"5 kyu","description":"The prime numbers are not regularly spaced. For example from `2` to `3` the gap is `1`.\nFrom `3` to `5` the gap is `2`. From `7` to `11` it is `4`.\nBetween 2 and 50 we have the following pairs of 2-gaps primes:\n`3-5, 5-7, 11-13, 17-19, 29-31, 41-43`\n\nA prime gap of length n is a "},{"id":"5616868c81a0f281e500005c","name":"Prize Draw","rank":-6,"tags":["Fundamentals","Strings","Sorting"],"languages":["ruby","python","javascript","coffeescript","haskell","java","csharp","clojure","cpp","php","crystal","c","typescript","rust","swift","r","shell","fsharp","ocaml","scala","julia","powershell","go","nim","reason","racket","kotlin","pascal","perl","lua","elm","d","prolog"],"rank_name":"6 kyu","description":"To participate in a prize draw each one gives his/her firstname. \n\nEach letter of a firstname\nhas a value which is its rank in the English alphabet. `A` and `a` have rank `1`, `B` and `b` rank `2` and so on. \n\nThe *length* of the firstname is added to the *sum* of these ranks hen"},{"id":"5613d06cee1e7da6d5000055","name":"Steps in Primes","rank":-6,"tags":["Mathematics","Number Theory"],"languages":["ruby","python","javascript","haskell","csharp","java","clojure","coffeescript","cpp","php","crystal","c","ocaml","fsharp","typescript","elixir","rust","swift","go","shell","r","kotlin","scala","julia","powershell","nim","reason","racket","forth","prolog","fortran","dart","pascal","lua","perl","elm","d"],"rank_name":"6 kyu","description":"The prime numbers are not regularly spaced. For example from `2` to `3` the step is `1`.\nFrom `3` to `5` the step is `2`. From `7` to `11` it is `4`.\nBetween 2 and 50 we have the following pairs of 2-steps primes:\n\n`3, 5 - 5, 7, - 11, 13, - 17, 19, - 29, 31, - 41, 43`\n\nWe will wr"},{"id":"55f3da49e83ca1ddae0000ad","name":"Tank Truck","rank":-6,"tags":["Mathematics","Geometry"],"languages":["ruby","python","javascript","coffeescript","haskell","csharp","java","clojure","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","shell","ocaml","kotlin","fortran","elixir","julia","scala","powershell","nim","reason","racket","forth","lua","pascal","perl","haxe","elm","d","cobol","erlang","prolog"],"rank_name":"6 kyu","description":"To introduce the problem think to my neighbor who drives a tanker truck. \nThe level indicator is down and he is worried\nbecause he does not know if he will be able to make deliveries. \nWe put the truck on a horizontal ground and measured the height of the liquid in the tank.\n\nFor"},{"id":"55efecb8680f47654c000095","name":"Hero's root","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","shell","ocaml","kotlin","fortran","julia","r","powershell","cobol","go"],"rank_name":"7 kyu","description":"One of the first algorithm used for approximating the integer square root of a positive integer `n` is known as \"Hero's method\", \nnamed after the first-century Greek mathematician Hero of Alexandria who gave the first description\nof the method. Hero's method can be obtained from "},{"id":"55e86e212fce2aae75000060","name":"Integers: Recreation Two","rank":-6,"tags":["Fundamentals","Mathematics","Puzzles"],"languages":["ruby","python","javascript","java","csharp","haskell","clojure","coffeescript","cpp","php","crystal","c","typescript","rust","swift","go","fsharp","r","shell","ocaml","kotlin","elixir","julia","powershell","nim","reason","racket","scala"],"rank_name":"6 kyu","description":"We are still with squared integers.\n\nGiven 4 integers `a, b, c, d` we form the sum of the squares of `a` and `b`\nand then the sum of the squares of `c` and `d`. We multiply the two sums hence a number `n` and we try to\ndecompose `n` in a sum of two squares `e` and `f` (e and f in"},{"id":"55e7280b40e1c4a06d0000aa","name":"Best travel","rank":-5,"tags":["Fundamentals"],"languages":["ruby","python","haskell","java","csharp","clojure","javascript","coffeescript","cpp","php","c","rust","swift","crystal","typescript","go","fsharp","r","shell","ocaml","kotlin","elixir","scala","julia","powershell","nim","reason","racket","fortran","dart","pascal","perl","elm","d","erlang","prolog"],"rank_name":"5 kyu","description":"John and Mary want to travel between a few towns A, B, C ... Mary has on a sheet of paper a list of distances between these towns.\n`ls = [50, 55, 57, 58, 60]`.\nJohn is tired of driving and he says to Mary that he doesn't want to drive more than `t = 174 miles` and he\nwill visit o"},{"id":"55e6f5e58f7817808e00002e","name":"A Rule of Divisibility by 7","rank":-7,"tags":["Fundamentals"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","typescript","elixir","cpp","php","crystal","fsharp","c","shell","ocaml","kotlin","nasm","julia","r","powershell","go","nim","rust","reason","racket","forth","factor","scala","prolog","fortran","haxe","dart","pascal","lua","perl","cobol","d","erlang"],"rank_name":"7 kyu","description":"A number m of the form 10x + y is divisible by 7 if and only if x − 2y is divisible by 7. In other words, subtract twice the last digit \nfrom the number formed by the remaining digits. Continue to do this until a number known to be divisible by 7 is obtained; \nyou can stop when t"},{"id":"55e2adece53b4cdcb900006c","name":"Tortoise racing","rank":-6,"tags":["Fundamentals","Mathematics","Algorithms"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","nim","shell","ocaml","kotlin","groovy","fortran","elixir","julia","scala","powershell","reason","racket","pascal","lua","perl","elm","cobol","d","erlang","prolog"],"rank_name":"6 kyu","description":"Two tortoises named ***A*** and ***B*** must run a race. ***A*** starts with an average speed of ```720 feet per hour```.\nYoung ***B*** knows she runs faster than ***A***, and furthermore has not finished her cabbage.\n\nWhen she starts, at last, she can see that ***A*** has a `70 "},{"id":"55cf3b567fc0e02b0b00000b","name":"Getting along with Integer Partitions","rank":-4,"tags":["Fundamentals","Algorithms"],"languages":["ruby","python","javascript","haskell","java","csharp","coffeescript","clojure","cpp","php","rust","c","crystal","swift","typescript","go","r","shell","ocaml","fsharp","scala","julia","nim","racket","reason","fortran","dart","perl","lua","pascal","prolog"],"rank_name":"4 kyu","description":"From wikipedia <https://en.wikipedia.org/wiki/Partition_(number_theory)> \n\nIn number theory and combinatorics, a partition of a positive integer n, also called an integer partition, \nis a way of writing n as a sum of positive integers. \nTwo sums that differ only in the order of t"},{"id":"55c6126177c9441a570000cc","name":"Weight for weight","rank":-5,"tags":["Algorithms"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","cpp","php","crystal","c","typescript","rust","swift","fsharp","r","shell","ocaml","kotlin","objc","lua","scala","elixir","julia","powershell","go","nim","reason","racket","pascal","perl","elm","cobol","d","prolog","dart"],"rank_name":"5 kyu","description":"My friend John and I are members of the \"Fat to Fit Club (FFC)\". John is worried because\neach month a list with the weights of members is published and each month he is the last on the list\nwhich means he is the heaviest. \n\nI am the one who establishes the list so I told him:\n\"Do"},{"id":"55be10de92aad5ef28000023","name":"Color Choice","rank":-6,"tags":["Combinatorics","Mathematics"],"languages":["ruby","python","javascript","java","csharp","haskell","clojure","coffeescript","elixir","typescript","cpp","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","kotlin","fortran","julia","scala","powershell","nim","racket","prolog","dart","pascal","lua","perl","cobol","elm","d","erlang"],"rank_name":"6 kyu","description":"You know combinations: for example, \nif you take `5` cards from a `52` cards deck you have `2,598,960` different combinations.\n\nIn mathematics the number of `x` combinations you can take from a set of `n` elements\nis called the *binomial coefficient of n and x*, or more often `n "},{"id":"55b4d87a3766d9873a0000d4","name":"How Much?","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","kotlin","fortran","julia","scala","powershell","nim","reason","racket","prolog","pascal","factor","lua","dart","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"I always thought that my old friend John was rather richer than he looked, but I never knew exactly how much money he actually had. One day (as I was plying him with questions) he said:\n\n* \"Imagine I have between `m` and `n` Zloty...\" (or did he say Quetzal? I can't remember!)\n* "},{"id":"55b3425df71c1201a800009c","name":"Statistics for an Athletic Association","rank":-6,"tags":["Fundamentals","Strings","Statistics","Mathematics","Data Science"],"languages":["ruby","python","javascript","haskell","java","csharp","clojure","coffeescript","cpp","php","c","swift","crystal","typescript","r","shell","ocaml","elixir","fsharp","julia","scala","powershell","go","nim","rust","reason","racket","kotlin","pascal","perl","lua","elm","d","prolog"],"rank_name":"6 kyu","description":"You are the \"computer expert\" of a local Athletic Association (C.A.A.).\nMany teams of runners come to compete. Each time you get a string of \nall race results of every team who has run.\nFor example here is a string showing the individual results of a team of 5 runners:\n\n` \"01|15|"},{"id":"55ab4f980f2d576c070000f4","name":"Playing on a chessboard","rank":-6,"tags":["Puzzles","Fundamentals"],"languages":["ruby","python","javascript","java","csharp","haskell","clojure","coffeescript","cpp","elixir","typescript","php","crystal","fsharp","c","rust","swift","go","r","nim","shell","ocaml","fortran","julia","scala","powershell","reason","racket","forth","kotlin","prolog","pascal","lua","perl","elm","d","cobol","erlang"],"rank_name":"6 kyu","description":"With a friend we used to play the following game on a chessboard\n(8, rows, 8 columns).\nOn the first row at the *bottom* we put numbers:\n\n`1/2, 2/3, 3/4, 4/5, 5/6, 6/7, 7/8, 8/9`\n\nOn row 2 (2nd row from the bottom) we have:\n\n`1/3, 2/4, 3/5, 4/6, 5/7, 6/8, 7/9, 8/10`\n\nOn row 3:\n\n`1"},{"id":"55aa075506463dac6600010d","name":"Integers: Recreation One","rank":-5,"tags":["Fundamentals","Algorithms"],"languages":["ruby","python","javascript","java","csharp","coffeescript","haskell","clojure","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","shell","ocaml","elixir","fortran","julia","scala","powershell","nim","purescript","reason","racket","kotlin","prolog","pascal","factor","raku","vb","lua","perl","elm","d","erlang"],"rank_name":"5 kyu","description":"`1, 246, 2, 123, 3, 82, 6, 41` are the divisors of number `246`. \n\nSquaring these divisors we get: `1, 60516, 4, 15129, 9, 6724, 36, 1681`. \n\nThe sum of these squares is `84100` which is `290 * 290`.\n\n### Task\nFind all integers between `m` and `n` (m and n are integers with 1 <= "},{"id":"55a29405bc7d2efaff00007c","name":"Going to zero or to infinity?","rank":-5,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","javascript","haskell","csharp","java","coffeescript","clojure","typescript","cpp","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","fortran","elixir","julia","scala","powershell","nim","reason","racket","forth","kotlin","prolog","haxe","cobol","elm","erlang","nasm","d"],"rank_name":"5 kyu","description":"Consider the following numbers (where `n!` is `factorial(n)`):\n```\nu1 = (1 / 1!) * (1!)\nu2 = (1 / 2!) * (1! + 2!)\nu3 = (1 / 3!) * (1! + 2! + 3!)\n...\nun = (1 / n!) * (1! + 2! + 3! + ... + n!)\n```\n\nWhich will win: `1 / n!` or `(1! + 2! + 3! + ... + n!)`?\n\nAre these numbers going to"},{"id":"559e3224324a2b6e66000046","name":"Functions of Integers on Cartesian Plane","rank":-7,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","java","haskell","clojure","javascript","coffeescript","csharp","typescript","cpp","elixir","php","crystal","fsharp","c","ocaml","r","powershell","go","julia","nim","racket","forth","dart","scala","elm","factor","perl","cobol","d"],"rank_name":"7 kyu","description":"Let us consider integer coordinates x, y in the Cartesian plane and three functions f, g, h\ndefined by:\n```\nf: 1 <= x <= n, 1 <= y <= n --> f(x, y) = min(x, y)\ng: 1 <= x <= n, 1 <= y <= n --> g(x, y) = max(x, y)\nh: 1 <= x <= n, 1 <= y <= n --> h(x, y) = x + y\n``` \nwhere `n` is a "},{"id":"559ce00b70041bc7b600013d","name":"Financing Plan on Planet XY140Z-n","rank":-6,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","haskell","java","clojure","javascript","coffeescript","csharp","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","nim","r","shell","ocaml","fortran","julia","scala","powershell","reason","racket","forth","factor","kotlin","prolog","pascal","raku","perl","cobol","elm","d","erlang"],"rank_name":"6 kyu","description":"I need to save some money to buy a gift. I think I can do something like that:\n\nFirst week (W0) I save nothing on Sunday, 1 on Monday, 2 on Tuesday... 6 on Saturday,\nsecond week (W1) 2 on Monday... 7 on Saturday and so on according to the table below where the days are numbered f"},{"id":"559b8e46fa060b2c6a0000bf","name":"Easy Diagonal","rank":-6,"tags":["Fundamentals"],"languages":["ruby","python","haskell","clojure","java","csharp","javascript","coffeescript","elixir","typescript","cpp","php","fsharp","c","crystal","ocaml","rust","swift","go","r","nim","shell","fortran","julia","scala","powershell","racket","vb","forth","kotlin","prolog","pascal","raku","perl","cobol","d","erlang"],"rank_name":"6 kyu","description":"In the drawing below we have a part of the Pascal's triangle, lines are numbered from **zero** (top).\nThe left diagonal in pale blue with only numbers equal to 1 is diagonal **zero**, then in dark green \n(1, 2, 3, 4, 5, 6, 7) is diagonal 1, then in pale green (1, 3, 6, 10, 15, 21"},{"id":"559a28007caad2ac4e000083","name":"Perimeter of squares in a rectangle","rank":-5,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","haskell","clojure","java","csharp","coffeescript","javascript","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","shell","objc","ocaml","fortran","elixir","julia","scala","powershell","nim","racket","reason","forth","kotlin","prolog","dart","pascal","raku","lua","perl","elm","cobol","d","erlang","nasm"],"rank_name":"5 kyu","description":"The drawing shows 6 squares the sides of which have a length of 1, 1, 2, 3, 5, 8.\nIt's easy to see that the sum of the perimeters of these squares is :\n` 4 * (1 + 1 + 2 + 3 + 5 + 8) = 4 * 20 = 80  `                                        \n\nCould you give the sum of the perimeters"},{"id":"559536379512a64472000053","name":"Playing with passphrases","rank":-6,"tags":["Strings","Algorithms"],"languages":["ruby","python","csharp","java","javascript","haskell","coffeescript","clojure","typescript","cpp","php","crystal","c","swift","fsharp","shell","ocaml","julia","scala","r","nasm","powershell","go","nim","rust","racket","kotlin","pascal","perl","elm","d","prolog","cobol"],"rank_name":"6 kyu","description":"Everyone knows passphrases. One can choose passphrases from poems, songs, movies names and so on but frequently\nthey can be guessed due to common cultural references.\nYou  can get your passphrases stronger by different means. One is the following:\n\nchoose a text in capital letter"},{"id":"5592e3bd57b64d00f3000047","name":"Build a pile of Cubes","rank":-6,"tags":["Mathematics","Algorithms"],"languages":["csharp","java","ruby","python","javascript","coffeescript","haskell","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","swift","rust","go","r","shell","ocaml","fortran","julia","nasm","nim","scala","kotlin","groovy","dart","pascal","raku","perl","cobol","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"Your task is to construct a building which will be a pile of n cubes.\nThe cube at the bottom will have a volume of `$ n^3 $`, the cube above \nwill have  volume of `$ (n-1)^3 $` and so on until the top which will have a volume of `$ 1^3 $`.\n\nYou are given the total volume m of the"},{"id":"5552101f47fc5178b1000050","name":"Playing with digits","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","csharp","java","javascript","haskell","clojure","coffeescript","cpp","php","crystal","fsharp","swift","c","typescript","go","shell","ocaml","julia","scala","r","powershell","kotlin","nasm","nim","rust","racket","reason","lua","commonlisp","pascal","perl","raku","elm","d","cobol","prolog","factor"],"rank_name":"6 kyu","description":"Some numbers have funny properties. For example:\n\n* 89 --> 8¹ + 9² = 89 * 1\n* 695 --> 6² + 9³ + 5⁴= 1390 = 695 * 2\n* 46288 --> 4³ + 6⁴+ 2⁵ + 8⁶ + 8⁷ = 2360688 = 46288 * 51\n\nGiven two positive integers `n` and `p`, we want to find a positive integer `k`, if it exists, such that th"},{"id":"554f76dca89983cc400000bb","name":"Diophantine Equation","rank":-5,"tags":["Fundamentals","Mathematics","Algebra"],"languages":["ruby","python","clojure","java","csharp","haskell","javascript","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","shell","ocaml","kotlin","fortran","julia","scala","r","powershell","nim","racket","reason","prolog","dart","pascal","factor","raku","lua","perl","elm","d","cobol","erlang"],"rank_name":"5 kyu","description":"In mathematics, a [Diophantine equation](https://en.wikipedia.org/wiki/Diophantine_equation) is a polynomial equation, usually with two or more unknowns, such that only the integer solutions are sought or studied.\n\nIn this kata we want to find all integers `x, y` (`x >= 0, y >= 0"},{"id":"554a44516729e4d80b000012","name":"Buying a car","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["ruby","python","csharp","java","clojure","javascript","haskell","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","fortran","julia","scala","powershell","nim","reason","racket","kotlin","prolog","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"Let us begin with an example:\n\nA man has a rather old car being worth $2000. \nHe saw a secondhand car being worth $8000. He wants to keep his old car until he can buy the secondhand one.\n\nHe thinks he can save $1000 each month but the prices of his old \ncar and of the new one dec"},{"id":"5547cc7dcad755e480000004","name":"Is  my friend cheating?","rank":-5,"tags":["Fundamentals","Mathematics","Puzzles"],"languages":["python","ruby","csharp","java","clojure","javascript","haskell","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","fortran","julia","scala","powershell","nim","racket","reason","kotlin","prolog","pascal","factor","raku","perl","elm","cobol","d","erlang"],"rank_name":"5 kyu","description":"- A friend of mine takes the sequence of all numbers from 1 to n (where n > 0).\n- Within that sequence, he chooses two numbers, a and b.\n- He says that the product of a and b should be equal to the sum of all numbers in the sequence, excluding a and b.\n- Given a number n, could y"},{"id":"55466989aeecab5aac00003e","name":"Rectangle into Squares","rank":-6,"tags":["Fundamentals","Geometry","Puzzles"],"languages":["python","ruby","java","csharp","clojure","javascript","haskell","coffeescript","cpp","elixir","typescript","php","crystal","fsharp","c","rust","swift","r","shell","ocaml","fortran","julia","scala","powershell","go","nim","kotlin","racket","reason","pascal","factor","raku","perl","elm","d","cobol","erlang","prolog"],"rank_name":"6 kyu","description":"The drawing below gives an idea of how to cut a given \"true\" rectangle into squares (\"true\" rectangle meaning that the two dimensions are different).\n\n<svg style=\"max-width: 500px\" xmlns=\"http://www.w3.org/2000/svg\" viewbox=\"0 0 600 400\" xmlns:bx=\"https://boxy-svg.com\">\n  <defs/>"},{"id":"5544c7a5cb454edb3c000047","name":"Bouncing Balls","rank":-6,"tags":["Puzzles","Algorithms","Mathematics"],"languages":["ruby","python","clojure","java","csharp","javascript","haskell","coffeescript","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","go","r","shell","ocaml","kotlin","fortran","julia","scala","powershell","nim","racket","reason","prolog","pascal","factor","raku","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"A child is playing with a ball on the nth floor of a tall building.\nThe height of this floor above ground level, *h*, is known. \n\nHe drops the ball out of the window. The ball bounces (for example), to two-thirds of its height (a bounce of 0.66).\n \nHis mother looks out of a windo"},{"id":"5541f58a944b85ce6d00006a","name":"Product of consecutive Fib numbers","rank":-5,"tags":["Algorithms","Mathematics"],"languages":["ruby","javascript","csharp","haskell","python","java","clojure","coffeescript","cpp","php","crystal","fsharp","c","typescript","rust","swift","go","r","shell","ocaml","kotlin","elixir","julia","scala","powershell","nim","racket","reason","forth","prolog","fortran","elm","cobol","d","erlang","factor","nasm"],"rank_name":"5 kyu","description":"The Fibonacci numbers are the numbers in the following integer sequence (`Fn`):\n`0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...`\n\nsuch that:\n\n```math\nF(0) = 0\\\\F(1) = 1\\\\F(n) = F(n-1) + F(n-2)\n```\n\nGiven a number, say `prod` (for product), we search two Fibonacci numbers "},{"id":"5539fecef69c483c5a000015","name":"Backwards Read Primes","rank":-6,"tags":["Mathematics","Algorithms"],"languages":["ruby","python","clojure","haskell","javascript","csharp","java","coffeescript","cpp","php","crystal","fsharp","c","typescript","rust","swift","r","shell","ocaml","scala","kotlin","elixir","nasm","julia","powershell","go","nim","racket","forth","prolog","fortran","pascal","raku","perl","elm","d"],"rank_name":"6 kyu","description":"Backwards-read-primes are primes that when read backwards in base 10 (from right to left) are a different prime. (This rules out primes which are palindromes.)\n\nExamples:\n```\n13 17 31 37 71 73\n```\n\n`13` is such because it's prime and read from right to left writes `31` which is p"},{"id":"5536a85b6ed4ee5a78000035","name":"Help your granny!","rank":-5,"tags":["Fundamentals","Mathematics"],"languages":["csharp","python","java","ruby","haskell","clojure","javascript","coffeescript","cpp","php","crystal","c","typescript","rust","swift","fsharp","shell","ocaml","julia","scala","go","racket","kotlin","lua","perl","elm","d"],"rank_name":"5 kyu","description":"Your granny, who lives in town X0, has friends. \nThese friends are given in an array, for example: \narray of friends is `[\"A1\", \"A2\", \"A3\", \"A4\", \"A5\"]`.\n\n**The order of friends in this array must *not be changed* since this order gives the order in which they will be visited.**\n"},{"id":"5517fcb0236c8826940003c9","name":"Irreducible Sum of Rationals","rank":-6,"tags":["Fundamentals"],"languages":["ruby","haskell","python","clojure","javascript","coffeescript","java","csharp","typescript","cpp","elixir","php","crystal","fsharp","c","rust","swift","r","ocaml","julia","scala","powershell","go","nim","purescript","racket","kotlin","prolog","pascal","lua","perl","elm","d","erlang"],"rank_name":"6 kyu","description":"You will have a list of rationals in the form\n```\nlst = [ [numer_1, denom_1] , ... , [numer_n, denom_n] ]\n```\nor\n```\nlst = [ (numer_1, denom_1) , ... , (numer_n, denom_n) ]\n```\nwhere all numbers are positive integers. You have to produce their sum `N / D` in an irreducible form: "},{"id":"550f22f4d758534c1100025a","name":"Directions Reduction","rank":-5,"tags":["Fundamentals"],"languages":["ruby","javascript","haskell","python","java","coffeescript","csharp","clojure","cpp","php","crystal","fsharp","rust","c","typescript","swift","shell","r","objc","ocaml","elixir","lua","julia","scala","powershell","go","nim","racket","reason","kotlin","prolog","haxe","pascal","perl","elm","cobol","d","erlang"],"rank_name":"5 kyu","description":"#### Once upon a time, on a way through the old wild *mountainous* west,…\n\n… a man was given directions to go from one point to another. The directions were \"NORTH\", \"SOUTH\", \"WEST\", \"EAST\". Clearly \"NORTH\" and \"SOUTH\" are opposite, \"WEST\" and \"EAST\" too. \n\nGoing to one direction"},{"id":"55084d3898b323f0aa000546","name":"Second Variation on Caesar Cipher","rank":-5,"tags":["Fundamentals","Ciphers","Cryptography"],"languages":["ruby","python","java","javascript","coffeescript","csharp","haskell","clojure","cpp","php","c","typescript","swift","crystal","r","ocaml","go","fsharp","scala","d"],"rank_name":"5 kyu","description":"In this country soldiers are poor but they need a certain level of secrecy for their communications so, though they do not know Caesar cypher, they reinvent it in the following way.\n\nThe action of a Caesar cipher is to replace each plaintext letter (plaintext letters are from 'a'"},{"id":"5508249a98b3234f420000fb","name":"First Variation on Caesar Cipher","rank":-5,"tags":["Fundamentals","Ciphers","Strings"],"languages":["java","csharp","ruby","python","javascript","coffeescript","clojure","haskell","cpp","php","c","typescript","swift","crystal","r","shell","ocaml","go","nim","racket","fsharp","scala","fortran","d"],"rank_name":"5 kyu","description":"The action of a Caesar cipher is to replace each plaintext letter (plaintext letters are from 'a' to 'z' or from 'A' to 'Z') with a different one a fixed number of places up or down the alphabet.\n\nThis program performs a variation of the Caesar shift. The shift increases by 1 for"},{"id":"5506b230a11c0aeab3000c1f","name":"Deodorant Evaporator","rank":-7,"tags":["Mathematics"],"languages":["ruby","python","java","csharp","clojure","javascript","haskell","coffeescript","elixir","typescript","cpp","php","crystal","fsharp","c","r","shell","ocaml","fortran","julia","scala","powershell","kotlin","go","nim","rust","racket","dart","forth","haxe","pascal","perl","elm","d","erlang","prolog"],"rank_name":"7 kyu","description":"This program tests the life of an evaporator containing a gas. \n\nWe know the content of the evaporator (content in ml),\nthe percentage of foam or gas lost every day (evap_per_day) and the threshold (threshold) in percentage beyond which the evaporator is no longer useful.\nAll num"},{"id":"550554fd08b86f84fe000a58","name":"Which are  in?","rank":-6,"tags":["Arrays","Lists","Strings","Refactoring"],"languages":["ruby","csharp","python","java","clojure","haskell","javascript","coffeescript","elixir","typescript","cpp","php","crystal","fsharp","c","swift","r","shell","ocaml","julia","scala","powershell","kotlin","go","nim","racket","rust","lua","pascal","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"Given two arrays of strings `a1` and `a2` return a sorted array `r` in lexicographical order of the strings of `a1` which are substrings of strings of `a2`.\n\n#### Example 1:\n`a1 = [\"arp\", \"live\", \"strong\"]`\n\n`a2 = [\"lively\", \"alive\", \"harp\", \"sharp\", \"armstrong\"]`\n\nreturns `[\"arp"},{"id":"550527b108b86f700000073f","name":"PI approximation ","rank":-6,"tags":["Arrays","Mathematics","Fundamentals"],"languages":["ruby","csharp","haskell","java","python","javascript","coffeescript","clojure","elixir","typescript","cpp","php","crystal","fsharp","c","ocaml","rust","swift","go","r","shell","julia","scala","powershell","nim","racket","forth","kotlin","groovy","fortran","dart","lua","elm","d","prolog"],"rank_name":"6 kyu","description":"The aim of the kata is to try to show how difficult it can be to calculate decimals of an irrational number with a certain precision. We have chosen to get a few decimals of the number \"pi\" using\nthe following infinite series (Leibniz 1646–1716): \n\nPI / 4 = 1 - 1/3 + 1/5 - 1/7 + "},{"id":"550498447451fbbd7600041c","name":"Are they the \"same\"?","rank":-6,"tags":["Fundamentals"],"languages":["ruby","csharp","python","java","clojure","haskell","javascript","coffeescript","elixir","typescript","cpp","php","crystal","fsharp","c","rust","swift","r","scala","shell","ocaml","julia","kotlin","powershell","go","nim","purescript","nasm","racket","groovy","prolog","cfml","fortran","haxe","dart","pascal","lua","perl","d","elm","cobol","erlang"],"rank_name":"6 kyu","description":"Given two arrays `a` and `b` write a function `comp(a, b)` (or`compSame(a, b)`) that checks whether the two arrays have the \"same\" elements, with the same *multiplicities* (the multiplicity of a member is the number of times it appears). \"Same\" means, here, that the elements in `"},{"id":"55031bba8cba40ada90011c4","name":"Hidden \"Cubic\" numbers","rank":-6,"tags":["Algorithms","Strings"],"languages":["java","csharp","python","javascript","ruby","haskell","coffeescript","clojure","cpp","php","crystal","c","typescript","swift","r","shell","fsharp","julia","scala","go","nim","rust","racket","kotlin","groovy","pascal","lua","perl","elm","d","prolog"],"rank_name":"6 kyu","description":"We search non-negative integer numbers, with at **most** 3 digits, such as the sum of the cubes of their digits is the number itself; we will call them \"cubic\" numbers.\n```\n153 is such a \"cubic\" number : 1^3 + 5^3 + 3^3 = 153\n```\nThese \"cubic\" numbers of at most 3 digits are easy"},{"id":"54f8693ea58bce689100065f","name":"Some Egyptian fractions","rank":-5,"tags":["Algorithms","Mathematics"],"languages":["ruby","python","clojure","haskell","javascript","coffeescript","java","csharp","elixir","typescript","cpp","php","crystal","c","swift","r","julia","scala","go","nim","racket","fsharp","vb","kotlin","groovy","fortran","rust","dart","pascal","lua","perl","elm","d","prolog"],"rank_name":"5 kyu","description":"Given a rational number n\n\n``` n >= 0, with denominator strictly positive```  \n\n- as a string (example: \"2/3\" in Ruby, Python, Clojure, JS, CS, Go) \n- or as two strings (example: \"2\" \"3\" in Haskell, Java, CSharp, C++, Swift, Dart) \n- or as a rational or decimal number (example: 3"},{"id":"54f5f22a00ecc4184c000034","name":"Exponentials as fractions","rank":-4,"tags":["Fundamentals"],"languages":["ruby","python","haskell","clojure","r"],"rank_name":"4 kyu","description":"The aim is to calculate `exponential(x)` (written `exp(x)` in most math libraries) as an irreducible fraction, the numerator of this fraction having a given number of digits.\n\nWe call this function `expand`, it takes two parameters, `x` of which we want to evaluate the exponentia"},{"id":"54eb33e5bc1a25440d000891","name":"Square into Squares. Protect trees!","rank":-4,"tags":["Mathematics","Algorithms"],"languages":["ruby","java","csharp","python","clojure","haskell","javascript","coffeescript","cpp","php","typescript","rust","swift","c","fsharp","shell","ocaml","r","crystal","nasm","julia","scala","go","nim","racket","kotlin","groovy","fortran"],"rank_name":"4 kyu","description":"My little sister came back home from school with the following task:\ngiven a squared sheet of paper she has to cut it in pieces\nwhich, when assembled, give squares the sides of which form\nan increasing sequence of numbers.\nAt the beginning it was lot of fun but little by little w"},{"id":"54e320dcebe1e583250008fd","name":"Decimal to Factorial and Back","rank":-5,"tags":["Algorithms"],"languages":["ruby","python","java","csharp","clojure","haskell","javascript","coffeescript","cpp","php","crystal","c","typescript","rust","swift","r","shell","ocaml","julia","scala","go","nim","racket","fsharp","kotlin","groovy","elixir","dart","pascal","perl","cobol","d","prolog"],"rank_name":"5 kyu","description":"Coding decimal numbers with factorials is a way of writing out numbers \nin a base system that depends on factorials, rather than powers of numbers.\n\nIn this system, the last digit is always `0` and is in base 0!. The digit before that is either `0 or 1` and is in base 1!.  The di"},{"id":"54de3257f565801d96001200","name":"Ease the StockBroker","rank":-6,"tags":["Fundamentals","Strings"],"languages":["java","csharp","javascript","python","ruby","coffeescript","clojure","haskell","cpp","php","c","typescript","swift","crystal","r","shell","ocaml","julia","scala","go","rust","fsharp","kotlin","groovy","lua","pascal","perl","d"],"rank_name":"6 kyu","description":"Clients place orders to a stockbroker as strings. The order can be simple or multiple or empty.\n  \n  Type of a simple order: Quote/white-space/Quantity/white-space/Price/white-space/Status\n  \n  where Quote is formed of non-whitespace character, \n  Quantity is an int, \n  Price a d"},{"id":"54dc6f5a224c26032800005c","name":"Help the bookseller !","rank":-6,"tags":["Fundamentals","Algorithms"],"languages":["java","ruby","python","csharp","javascript","clojure","haskell","coffeescript","cpp","php","c","typescript","swift","crystal","r","shell","ocaml","fsharp","julia","scala","go","nim","rust","racket","kotlin","groovy","dart","pascal","lua","perl","elm","d","erlang","prolog"],"rank_name":"6 kyu","description":"A bookseller has lots of books classified in 26 categories labeled `A, B, C, ..., Z`. Each book has a *code* of at least 3 characters. The **1st character** of a code is a capital letter which **defines the book category**.\n  \nIn the bookseller's stocklist each code is followed b"},{"id":"54db15b003e88a6a480000b9","name":"Moduli number system","rank":-6,"tags":["Fundamentals","Mathematics"],"languages":["java","csharp","ruby","python","clojure","javascript","haskell","coffeescript","cpp","php","crystal","c","typescript","rust","swift","r","shell","ocaml","fsharp","julia","scala","go","nim","racket","reason","kotlin","groovy","prolog","haxe","dart","pascal","lua","perl","elm","d","cobol","erlang"],"rank_name":"6 kyu","description":"A number system with moduli is defined by a vector of k moduli, `[m1,m2, ···,mk]`. \n  \nThe moduli must be `pairwise co-prime`, which means that, for any pair of moduli, the only common factor is `1`. \n\nIn such a system each number `n` is represented by a string `\"-x1--x2-- ... --x"},{"id":"54d7660d2daf68c619000d95","name":"Common Denominators","rank":-5,"tags":["Fundamentals","Algorithms","Mathematics"],"languages":["java","ruby","csharp","python","clojure","haskell","javascript","coffeescript","cpp","php","crystal","c","typescript","rust","swift","r","shell","ocaml","elixir","fsharp","julia","scala","powershell","go","nim","purescript","racket","reason","kotlin","groovy","dart","lua","pascal","perl","elm","d","cobol","erlang","prolog"],"rank_name":"5 kyu","description":"Common denominators\n\nYou will have a list of rationals in the form \n ```\n{ {numer_1, denom_1} , ... {numer_n, denom_n} } \nor\n[ [numer_1, denom_1] , ... [numer_n, denom_n] ] \nor\n[ (numer_1, denom_1) , ... (numer_n, denom_n) ] \n ```\n \n where all numbers are positive ints.\n You have"},{"id":"54d512e62a5e54c96200019e","name":"Primes in numbers","rank":-5,"tags":["Mathematics"],"languages":["java","ruby","python","csharp","clojure","javascript","haskell","coffeescript","cpp","php","crystal","swift","c","typescript","rust","r","shell","fsharp","ocaml","elixir","groovy","julia","scala","powershell","go","nim","racket","reason","kotlin","prolog","haxe","dart","pascal","lua","perl","elm","d","cobol","erlang"],"rank_name":"5 kyu","description":"Given a positive number n > 1 find the prime factor decomposition of n.\nThe result will be a string with the following form :\n```\n \"(p1**n1)(p2**n2)...(pk**nk)\"\n```\nwith the p(i) in increasing order and n(i) empty if\nn(i) is 1.\n```\nExample: n = 86240 should return \"(2**5)(5)(7**2"},{"id":"54d496788776e49e6b00052f","name":"Sum by Factors","rank":-4,"tags":["Arrays","Algorithms","Mathematics"],"languages":["java","python","csharp","ruby","clojure","haskell","javascript","coffeescript","cpp","typescript","elixir","php","crystal","c","rust","swift","fsharp","r","shell","ocaml","kotlin","fortran","groovy","julia","scala","powershell","go","nim","reason","racket","vb","haxe","commonlisp","dart","lua","pascal","perl","elm","cobol","d","erlang","prolog"],"rank_name":"4 kyu","description":"Given an array of positive or negative integers \n\n<code> I= [i<sub>1</sub>,..,i<sub>n</sub>]</code>\n\nyou have to produce a sorted array P of the form \n\n<code>[ [p, sum of all i<sub>j</sub> of I for which p is a prime factor (p positive) of i<sub>j</sub>] ...]</code>\n\nP will be so"}],"username":"g964"},"meta":{"timestamp":"2026-06-09T20:24:33.015Z","request_id":"157c9d98-f129-428f-b20f-91da59e67fc7"},"status":"ok","message":"Authored kata retrieved successfully","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}},"/v1/completed":{"get":{"operationId":"get_v1_completed","tags":["Members"],"summary":"Kata a member has solved","description":"","parameters":[{"name":"username","in":"query","required":true,"description":"Codewars username","schema":{"type":"string"},"example":"g964"},{"name":"page","in":"query","required":false,"description":"Page (0-based)","schema":{"type":"string"},"example":"0"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"page":0,"count":200,"source":"Codewars","username":"g964","completed":[{"id":"56948e24b510d4e1d3000022","name":"AOP - Before","slug":"aop-before","completed_at":"2022-12-27T09:13:54.388Z","completed_languages":["javascript"]},{"id":"56bac4c34537cf1e270005a1","name":"Sorting Arrays ... wait, what?!","slug":"sorting-arrays-dot-dot-dot-wait-what","completed_at":"2022-12-13T13:42:01.222Z","completed_languages":["javascript"]},{"id":"56ba8a9b022c16017d0001f3","name":"Sequence generator","slug":"sequence-generator-1","completed_at":"2022-12-13T09:42:44.109Z","completed_languages":["javascript"]},{"id":"56b84da91d36bbfd7a0006e0","name":"Timmy Time","slug":"timmy-time","completed_at":"2022-12-13T09:35:37.682Z","completed_languages":["javascript"]},{"id":"56b71b1dbd06e6d88100092a","name":"Understanding closures - the basics","slug":"understanding-closures-the-basics","completed_at":"2022-12-13T09:19:45.024Z","completed_languages":["javascript"]},{"id":"56b5ebaa26fd54188b000018","name":"The Most Amicable of Numbers","slug":"the-most-amicable-of-numbers","completed_at":"2022-12-13T08:56:08.674Z","completed_languages":["csharp"]},{"id":"56b4bae128644b5613000037","name":"Sum the Repeats","slug":"sum-the-repeats","completed_at":"2022-12-13T08:44:43.278Z","completed_languages":["python"]},{"id":"56b18992240660a97c00000a","name":"Permutation Average","slug":"permutation-average","completed_at":"2022-12-11T08:49:29.515Z","completed_languages":["javascript"]},{"id":"56aea73c2283945da300004b","name":"Create 10x10 array and randomly fill each cell with \"A\", \"B\", \"C\", or \"D\"","slug":"create-10x10-array-and-randomly-fill-each-cell-with-a-b-c-or-d","completed_at":"2022-12-06T14:44:46.773Z","completed_languages":["javascript"]},{"id":"55e762cb8d89416b4300007c","name":"We need these data immediately!","slug":"we-need-these-data-immediately","completed_at":"2022-12-06T09:55:36.438Z","completed_languages":["javascript"]},{"id":"56971747aa359bdbf800004d","name":"Tricky Doubles","slug":"tricky-doubles","completed_at":"2022-12-05T14:26:48.621Z","completed_languages":["javascript"]},{"id":"5696c8b5fddc42058b000032","name":"Configure an express server","slug":"configure-an-express-server","completed_at":"2022-12-05T14:19:22.491Z","completed_languages":["javascript"]},{"id":"56951add53eccacf44000030","name":"Doggy Daycare","slug":"doggy-daycare","completed_at":"2022-12-05T14:12:16.449Z","completed_languages":["javascript"]},{"id":"56919e637b2b971492000036","name":"PatternCraft  - Adapter","slug":"patterncraft-adapter","completed_at":"2022-12-05T14:04:42.914Z","completed_languages":["javascript"]},{"id":"568ade64cfd7a55d9300003e","name":"Tube strike options calculator","slug":"tube-strike-options-calculator","completed_at":"2022-12-04T13:43:49.339Z","completed_languages":["javascript"]},{"id":"5681bc8d17af37f50e000015","name":"Array of Primes","slug":"array-of-primes","completed_at":"2022-12-04T09:19:34.946Z","completed_languages":["javascript"]},{"id":"56808724e7784d220c00003f","name":"RuplesJS #3: String EachChar","slug":"ruplesjs-number-3-string-eachchar","completed_at":"2022-12-04T09:15:30.535Z","completed_languages":["javascript"]},{"id":"567ed73340895395c100002e","name":"Regexp Basics - is it a eight bit signed number?","slug":"regexp-basics-is-it-a-eight-bit-signed-number","completed_at":"2022-12-03T15:01:38.063Z","completed_languages":["csharp"]},{"id":"567de8823fa5eee02100002a","name":"Regexp Basics - is it all whitespace?","slug":"regexp-basics-is-it-all-whitespace","completed_at":"2022-12-03T12:47:24.362Z","completed_languages":["javascript"]},{"id":"567c9f56d83baeed8300000f","name":"Regexp Basics - is it a hexadecimal number?","slug":"regexp-basics-is-it-a-hexadecimal-number","completed_at":"2022-12-03T12:45:46.786Z","completed_languages":["javascript"]},{"id":"5676f07029da352ba2000065","name":"Largest prime number containing n digit","slug":"largest-prime-number-containing-n-digit","completed_at":"2022-12-03T09:23:16.503Z","completed_languages":["javascript","python"]},{"id":"566f571ed78037c7b6000036","name":"Get Length","slug":"get-length","completed_at":"2022-12-03T09:06:28.807Z","completed_languages":["csharp"]},{"id":"56644a421b7c94c622000056","name":"Most Likely","slug":"most-likely","completed_at":"2022-12-03T09:02:49.877Z","completed_languages":["javascript"]},{"id":"566b51166f88d7560c00001a","name":"Shuffle an Array","slug":"shuffle-an-array-1","completed_at":"2022-12-01T14:59:58.519Z","completed_languages":["javascript"]},{"id":"5662b14e0a1fb8320a00005c","name":"Naughty or Nice","slug":"naughty-or-nice-1","completed_at":"2022-12-01T14:49:13.652Z","completed_languages":["python"]},{"id":"565b3542af398bfb50000003","name":"Count strings in objects","slug":"count-strings-in-objects","completed_at":"2022-12-01T14:09:21.906Z","completed_languages":["javascript"]},{"id":"56562b12044fa538b0000010","name":"Image Files Only","slug":"image-files-only","completed_at":"2022-12-01T09:44:08.104Z","completed_languages":["javascript"]},{"id":"56536e45bd4717003a000056","name":"Convert number to  sequence of bits","slug":"convert-number-to-sequence-of-bits","completed_at":"2022-12-01T09:20:00.458Z","completed_languages":["javascript","coffeescript"]},{"id":"564e22e30e686c7f7e00005d","name":"Knight vs Rook","slug":"knight-vs-rook","completed_at":"2022-12-01T09:07:53.121Z","completed_languages":["csharp"]},{"id":"56523ec6fc8ac62677000005","name":"Create sequence containing all allowed characters","slug":"create-sequence-containing-all-allowed-characters","completed_at":"2022-11-30T10:27:22.633Z","completed_languages":["javascript","csharp"]},{"id":"5641b3f737b248b8840000b0","name":"Simple Equation 2","slug":"simple-equation-2","completed_at":"2022-11-30T09:57:59.123Z","completed_languages":["csharp"]},{"id":"563fd46f2a1863685f000052","name":"Simple Equation","slug":"simple-equation","completed_at":"2022-11-30T08:35:46.175Z","completed_languages":["csharp"]},{"id":"563fb342f47611dae800003c","name":"Trimming a string","slug":"trimming-a-string","completed_at":"2022-11-29T15:22:13.205Z","completed_languages":["javascript"]},{"id":"563c823393305ec84e000048","name":"The Arpeggiator","slug":"the-arpeggiator","completed_at":"2022-11-29T15:01:09.128Z","completed_languages":["javascript","coffeescript"]},{"id":"563cc8c1a3895d7d30000049","name":"Reimplement Multiplication Part 1","slug":"reimplement-multiplication-part-1","completed_at":"2022-11-28T14:18:06.795Z","completed_languages":["javascript"]},{"id":"561fe8dbd50efaa2e9000075","name":"Sparse array this is?","slug":"sparse-array-this-is","completed_at":"2022-11-28T13:57:53.215Z","completed_languages":["javascript"]},{"id":"56143efa9d32b3aa65000016","name":"Some Circles","slug":"some-circles","completed_at":"2022-11-28T07:58:38.799Z","completed_languages":["javascript"]},{"id":"560fbc2d636966b21e00009e","name":"Map function  issue","slug":"map-function-issue","completed_at":"2022-11-27T13:31:54.238Z","completed_languages":["javascript"]},{"id":"5610a8eeb9a84d624b000005","name":"The sortReloaded() method","slug":"the-sortreloaded-method","completed_at":"2022-11-27T13:18:05.348Z","completed_languages":["javascript"]},{"id":"55f2f64faa2ffb24f6000005","name":"Big number problem","slug":"big-number-problem","completed_at":"2022-11-27T12:56:29.411Z","completed_languages":["javascript"]},{"id":"55f416b2019f552cb0000086","name":"Color of the moment","slug":"color-of-the-moment","completed_at":"2022-11-27T09:07:50.081Z","completed_languages":["csharp"]},{"id":"55efee33bd91ae75ac00003c","name":"htmlify my text","slug":"htmlify-my-text","completed_at":"2022-11-26T15:15:20.123Z","completed_languages":["javascript"]},{"id":"55e7650c8d894146be000095","name":"Error Throwing - Error Handling #2","slug":"error-throwing-error-handling-number-2","completed_at":"2022-11-26T10:23:38.516Z","completed_languages":["javascript"]},{"id":"55ddb0ea5a133623b6000043","name":"Python's Dynamic Classes #1","slug":"pythons-dynamic-classes-number-1","completed_at":"2022-11-26T09:08:05.595Z","completed_languages":["python"]},{"id":"55da49c166949c319200003e","name":"Basic method","slug":"basic-method","completed_at":"2022-11-26T08:57:26.703Z","completed_languages":["javascript"]},{"id":"55c1d030da313ed05100005d","name":"Building Spheres","slug":"building-spheres","completed_at":"2022-11-26T08:42:19.767Z","completed_languages":["csharp"]},{"id":"55c098aa8468f3b9030000f1","name":"Move Zeros","slug":"move-zeros","completed_at":"2022-11-26T08:19:16.333Z","completed_languages":["javascript"]},{"id":"55b8c0276a7930249e00003c","name":"International Morse Code Encryption","slug":"international-morse-code-encryption","completed_at":"2022-11-25T12:53:00.198Z","completed_languages":["javascript","coffeescript"]},{"id":"55b4f9906ac454650900007d","name":"String chunks","slug":"string-chunks","completed_at":"2022-11-25T08:26:22.264Z","completed_languages":["javascript"]},{"id":"55aeee88ecebc5c9230000a0","name":"Iterator Basics","slug":"iterator-basics","completed_at":"2022-11-25T08:18:39.007Z","completed_languages":["javascript"]},{"id":"55a98fbbe9760cf5af00003f","name":"Pluck data from Wikipedia lists","slug":"pluck-data-from-wikipedia-lists","completed_at":"2022-11-25T08:09:32.095Z","completed_languages":["javascript"]},{"id":"55a89dd69fdfb0d5ce0000ac","name":"Back to Basics","slug":"back-to-basics","completed_at":"2022-11-25T08:05:55.464Z","completed_languages":["python"]},{"id":"55a710b462afc49a540000b9","name":"More than Zero?","slug":"more-than-zero","completed_at":"2022-11-25T07:58:08.344Z","completed_languages":["python"]},{"id":"55a5bef147d6be698b0000cd","name":"Flatten Me","slug":"flatten-me","completed_at":"2022-11-25T07:57:16.049Z","completed_languages":["python"]},{"id":"55a1528cca4a6d4c5a0000e3","name":"Default + Rest + Spread","slug":"default-plus-rest-plus-spread","completed_at":"2022-11-24T16:44:10.587Z","completed_languages":["javascript"]},{"id":"544e2c60908f2da03600022a","name":"Convert between radians and degrees","slug":"convert-between-radians-and-degrees","completed_at":"2022-11-24T16:27:11.106Z","completed_languages":["javascript"]},{"id":"555de49a04b7d1c13c00000e","name":"Decreasing  Inputs","slug":"decreasing-inputs","completed_at":"2022-11-24T13:04:19.220Z","completed_languages":["javascript"]},{"id":"5535572c1de94ba2db0000f6","name":"Make them bark!","slug":"make-them-bark","completed_at":"2022-11-24T09:45:29.774Z","completed_languages":["javascript","coffeescript"]},{"id":"5533c2a50c4fea6832000101","name":"Dictionary from two lists","slug":"dictionary-from-two-lists","completed_at":"2022-11-24T09:39:47.688Z","completed_languages":["javascript"]},{"id":"552cd8624a414ec2b2000086","name":"Deutschstunde","slug":"deutschstunde","completed_at":"2022-11-24T09:34:27.775Z","completed_languages":["javascript"]},{"id":"559f8d487fa8511c43000118","name":"Is this working?","slug":"is-this-working","completed_at":"2022-11-23T15:28:50.148Z","completed_languages":["javascript"]},{"id":"559f89598c0d6c9b31000125","name":"Every archer has its arrows","slug":"every-archer-has-its-arrows","completed_at":"2022-11-23T15:22:25.505Z","completed_languages":["javascript"]},{"id":"559f3e20f4f29869cf0000ea","name":"Sort with Arrow Functions","slug":"sort-with-arrow-functions","completed_at":"2022-11-23T15:15:31.568Z","completed_languages":["javascript"]},{"id":"557dd2a061f099504a000088","name":"LinkedList -> Array","slug":"linkedlist-array","completed_at":"2022-11-23T15:02:14.509Z","completed_languages":["javascript"]},{"id":"557810cf791bbfd5ff00008f","name":"Integer Primitive Data Types","slug":"integer-primitive-data-types","completed_at":"2022-11-23T14:49:47.494Z","completed_languages":["java"]},{"id":"55186c0f4149dd08a7000006","name":"Overflowing with joy","slug":"overflowing-with-joy","completed_at":"2022-11-23T14:26:20.602Z","completed_languages":["java"]},{"id":"551204b7509063d9ba000b45","name":"Product of the main diagonal of a square matrix.","slug":"product-of-the-main-diagonal-of-a-square-matrix","completed_at":"2022-11-23T14:15:54.668Z","completed_languages":["javascript","coffeescript"]},{"id":"550fac5249073256380002c0","name":"Reverse fibonacci series","slug":"reverse-fibonacci-series","completed_at":"2022-11-23T14:09:24.268Z","completed_languages":["javascript"]},{"id":"550aea365951383698000727","name":"Split an array","slug":"split-an-array","completed_at":"2022-11-23T10:42:33.579Z","completed_languages":["javascript","coffeescript"]},{"id":"54f5c1b000ecc46de6000e4c","name":"Something 's fishy...","slug":"something-s-fishy-dot-dot-dot","completed_at":"2022-11-23T09:27:30.620Z","completed_languages":["javascript"]},{"id":"54e8c3e89e2ae6f4900005a1","name":"Add property to every object in array ","slug":"add-property-to-every-object-in-array","completed_at":"2022-11-23T09:25:26.751Z","completed_languages":["javascript"]},{"id":"54cefc8c975ca613d4000d7f","name":"Greed","slug":"greed","completed_at":"2022-11-22T15:38:40.713Z","completed_languages":["javascript","coffeescript"]},{"id":"5483930b98aa44a34d000e54","name":"Price VAT Calculator","slug":"price-vat-calculator","completed_at":"2022-11-22T14:11:39.563Z","completed_languages":["javascript"]},{"id":"547336f44481cf5ecc000dde","name":"Next birth-day of the week finder","slug":"next-birth-day-of-the-week-finder","completed_at":"2022-11-22T12:52:50.499Z","completed_languages":["javascript"]},{"id":"5434d8487abffa2f64000db6","name":"Who let the dogs out?","slug":"who-let-the-dogs-out","completed_at":"2022-11-22T09:15:44.163Z","completed_languages":["javascript","coffeescript"]},{"id":"541db50c259d9c55c00007b9","name":"Node.js Intro","slug":"node-dot-js-intro","completed_at":"2022-11-22T09:04:12.885Z","completed_languages":["javascript"]},{"id":"53b2f6934a240823f4000abc","name":"uniquePush - No Dupes!","slug":"uniquepush-no-dupes","completed_at":"2022-11-22T08:48:37.924Z","completed_languages":["javascript"]},{"id":"53a257d83cacabb1fd0007d3","name":"Dangerous Dates","slug":"dangerous-dates","completed_at":"2022-11-21T15:18:45.770Z","completed_languages":["javascript"]},{"id":"535d118ccdbf501816001101","name":"[JS] Parse integers in array","slug":"js-parse-integers-in-array","completed_at":"2022-11-21T15:05:24.843Z","completed_languages":["javascript"]},{"id":"53270633b7320eeb0500031d","name":"The Power of Exponents","slug":"the-power-of-exponents","completed_at":"2022-11-21T15:00:58.661Z","completed_languages":["javascript"]},{"id":"5313b713bb244a0eb20001fe","name":"Number-like counter","slug":"number-like-counter","completed_at":"2022-11-21T14:41:19.857Z","completed_languages":["javascript"]},{"id":"52f29bab392fb83e0d000656","name":"splicing","slug":"splicing","completed_at":"2022-11-21T14:29:55.227Z","completed_languages":["javascript","coffeescript"]},{"id":"52437f32636a67edb00002f7","name":"Honey to the Bee","slug":"honey-to-the-bee","completed_at":"2022-11-21T14:22:02.604Z","completed_languages":["javascript","coffeescript"]},{"id":"52b74e0936d582d9210005ff","name":"esreveR gnirtS","slug":"esrever-gnirts","completed_at":"2022-11-18T15:40:01.444Z","completed_languages":["javascript","coffeescript"]},{"id":"529f2d1c403a58f660000656","name":"Basic JS - Building a calculator","slug":"basic-js-building-a-calculator","completed_at":"2022-11-18T15:15:14.296Z","completed_languages":["javascript"]},{"id":"524c6a2e55025e3fba00020f","name":"Javascript Namespacing","slug":"javascript-namespacing","completed_at":"2022-11-18T15:08:42.157Z","completed_languages":["javascript"]},{"id":"52195c9bb576caf14200007f","name":"Adding useful functional functionality to JavaScript arrays  ","slug":"adding-useful-functional-functionality-to-javascript-arrays","completed_at":"2022-11-18T14:54:53.904Z","completed_languages":["javascript"]},{"id":"525d9b1a037b7a9da7000905","name":"Javascript filter - 1","slug":"javascript-filter-1","completed_at":"2022-11-18T14:34:25.847Z","completed_languages":["javascript"]},{"id":"513e1e47c600c93cef000001","name":"simple class","slug":"simple-class","completed_at":"2022-11-18T14:26:42.395Z","completed_languages":["javascript"]},{"id":"52378b3ee72f21e1ea000045","name":"True Min","slug":"true-min","completed_at":"2022-11-18T14:12:47.286Z","completed_languages":["javascript"]},{"id":"62c93765cef6f10030dfa92b","name":"Cats and shelves","slug":"cats-and-shelves","completed_at":"2022-11-17T10:33:03.810Z","completed_languages":["python"]},{"id":"56bc1acf66a2abc891000561","name":"Greek Sort","slug":"greek-sort","completed_at":"2022-11-17T10:23:51.609Z","completed_languages":["python"]},{"id":"57080f21d531cd94950007eb","name":"Not so black box","slug":"not-so-black-box","completed_at":"2022-11-17T10:19:32.241Z","completed_languages":["javascript"]},{"id":"593ed37c93350098d600001d","name":"Easy SQL - Ordering","slug":"easy-sql-ordering","completed_at":"2022-11-17T10:14:51.367Z","completed_languages":["sql"]},{"id":"636f26f52aae8fcf3fa35819","name":"Byte me!","slug":"byte-me","completed_at":"2022-11-16T10:37:54.081Z","completed_languages":["python"]},{"id":"5951d30ce99cf2467e000013","name":"Pythagorean Triple","slug":"pythagorean-triple","completed_at":"2022-11-16T10:30:10.529Z","completed_languages":["python"]},{"id":"5a026a9cffe75fbace00007f","name":"Circles in Polygons","slug":"circles-in-polygons","completed_at":"2022-11-16T10:18:53.735Z","completed_languages":["python"]},{"id":"5f9f43328a6bff002fa29eb8","name":"Floating point comparison","slug":"floating-point-comparison","completed_at":"2022-11-14T15:30:31.452Z","completed_languages":["python"]},{"id":"570184a95594a091150000a0","name":"Ghost code?!","slug":"ghost-code","completed_at":"2022-11-14T15:24:14.676Z","completed_languages":["java","groovy"]},{"id":"59fee4e680171f01f200008a","name":"Lua is easy: Lesson 1 - The basics","slug":"lua-is-easy-lesson-1-the-basics","completed_at":"2022-11-14T15:18:46.165Z","completed_languages":["lua"]},{"id":"596c55fc7bd5476bf60000d5","name":"FIXME: Static electrickery","slug":"fixme-static-electrickery","completed_at":"2022-11-14T15:00:45.083Z","completed_languages":["java"]},{"id":"59d582eec12fa001b60000d0","name":"Expand a string ","slug":"expand-a-string","completed_at":"2022-11-14T14:43:41.038Z","completed_languages":["r"]},{"id":"594a9592704e4d21bc000131","name":"SQL Basics: Mod","slug":"sql-basics-mod","completed_at":"2022-11-14T14:21:00.803Z","completed_languages":["sql"]},{"id":"594a691720ac16a544000075","name":"Easy SQL: Square Root and Log","slug":"easy-sql-square-root-and-log","completed_at":"2022-11-14T13:28:15.550Z","completed_languages":["sql"]},{"id":"594a6133704e4daf5d00003d","name":"Easy SQL: Rounding Decimals","slug":"easy-sql-rounding-decimals","completed_at":"2022-11-14T13:25:48.015Z","completed_languages":["sql"]},{"id":"594a50bafd3b7031c1000013","name":"Easy SQL: Convert to Hexadecimal","slug":"easy-sql-convert-to-hexadecimal","completed_at":"2022-11-13T14:44:05.186Z","completed_languages":["sql"]},{"id":"594800ba6fb152624300006d","name":"Easy SQL: LowerCase","slug":"easy-sql-lowercase","completed_at":"2022-11-13T14:37:08.443Z","completed_languages":["sql"]},{"id":"5916b952e76dc9cbcb000066","name":"Learning TypeScript. Basic Types. Type Assertions","slug":"learning-typescript-basic-types-type-assertions","completed_at":"2022-11-13T12:47:40.280Z","completed_languages":["typescript"]},{"id":"5914c6ee51f1d39b5600001c","name":"Learning TypeScript. Basic Types","slug":"learning-typescript-basic-types","completed_at":"2022-11-13T10:33:08.099Z","completed_languages":["typescript"]},{"id":"581113dce10b531b1d0000bd","name":"SQL Basics: Simple MIN / MAX","slug":"sql-basics-simple-min-slash-max","completed_at":"2022-11-13T08:46:38.428Z","completed_languages":["sql"]},{"id":"58110da0009b4f7ef80000ad","name":"SQL Basics: Simple SUM","slug":"sql-basics-simple-sum","completed_at":"2022-11-13T08:43:54.438Z","completed_languages":["sql"]},{"id":"57d29627c98a52d1630009c0","name":"PHP Functions - Pass By Reference","slug":"php-functions-pass-by-reference","completed_at":"2022-11-13T08:33:16.647Z","completed_languages":["php"]},{"id":"5721c189cdd71194c1000b9b","name":"Training JS #11: loop statement --break,continue","slug":"training-js-number-11-loop-statement-break-continue","completed_at":"2022-11-13T08:28:41.674Z","completed_languages":["javascript"]},{"id":"55ca43fb05c5f2f97f0000fd","name":"Fix the loop!","slug":"fix-the-loop","completed_at":"2022-11-13T08:18:37.612Z","completed_languages":["python"]},{"id":"58ee4db3e479611e6f000086","name":"Odd March  Bits 8 bits","slug":"odd-march-bits-8-bits-1","completed_at":"2022-11-11T08:55:40.542Z","completed_languages":["prolog"]},{"id":"58e3ea29a33b52c1dc0000c0","name":"Geometry Basics: Dot Product in  3D","slug":"geometry-basics-dot-product-in-3d","completed_at":"2022-11-09T14:29:36.284Z","completed_languages":["java"]},{"id":"62ad72443809a4006998218a","name":"Likes Vs Dislikes","slug":"likes-vs-dislikes","completed_at":"2022-11-09T08:26:41.927Z","completed_languages":["prolog"]},{"id":"61ce25e92ca4fb000f689fb0","name":"Convert ISBN-10 to ISBN-13","slug":"convert-isbn-10-to-isbn-13","completed_at":"2022-11-08T15:53:48.400Z","completed_languages":["prolog"]},{"id":"5a4e3782880385ba68000018","name":"Balanced Number (Special Numbers Series #1 ) ","slug":"balanced-number-special-numbers-series-number-1","completed_at":"2022-11-08T08:44:11.378Z","completed_languages":["prolog"]},{"id":"5e030f77cec18900322c535d","name":"Minimum to multiple","slug":"minimum-to-multiple","completed_at":"2022-11-07T14:14:03.154Z","completed_languages":["prolog"]},{"id":"59a9919107157a45220000e1","name":"Find all occurrences of an element in an array","slug":"find-all-occurrences-of-an-element-in-an-array","completed_at":"2022-11-07T13:40:03.306Z","completed_languages":["prolog"]},{"id":"5f55ecd770692e001484af7d","name":"Mirror, mirror, on the wall...","slug":"mirror-mirror-on-the-wall-dot-dot-dot","completed_at":"2022-11-07T12:56:35.564Z","completed_languages":["prolog"]},{"id":"5efae11e2d12df00331f91a6","name":"Crack the PIN","slug":"crack-the-pin","completed_at":"2022-11-06T14:24:43.360Z","completed_languages":["prolog"]},{"id":"604287495a72ae00131685c7","name":"Doubleton number","slug":"doubleton-number","completed_at":"2022-11-04T07:40:50.317Z","completed_languages":["prolog"]},{"id":"536c00e21da4dc0a0700128b","name":"Find Your Villain Name","slug":"find-your-villain-name","completed_at":"2022-11-03T15:19:14.708Z","completed_languages":["prolog"]},{"id":"5a54e796b3bfa8932c0000ed","name":"Jumping  Number (Special Numbers Series  #4)","slug":"jumping-number-special-numbers-series-number-4","completed_at":"2022-11-02T14:19:31.241Z","completed_languages":["prolog"]},{"id":"58a5aeb893b79949eb0000f1","name":"Shared Bit Counter","slug":"shared-bit-counter","completed_at":"2022-11-02T13:34:35.384Z","completed_languages":["prolog"]},{"id":"5fc4349ddb878a0017838d0f","name":"Red Knight","slug":"red-knight","completed_at":"2022-11-01T09:46:11.124Z","completed_languages":["prolog"]},{"id":"5effa412233ac3002a9e471d","name":"16+18=214","slug":"16-plus-18-equals-214","completed_at":"2022-11-01T07:58:47.989Z","completed_languages":["prolog"]},{"id":"54fb853b2c8785dd5e000957","name":"Chain me","slug":"chain-me","completed_at":"2022-10-29T14:18:22.593Z","completed_languages":["javascript","prolog"]},{"id":"57d06663eca260fe630001cc","name":"Olympic Rings","slug":"olympic-rings","completed_at":"2022-10-27T14:18:43.354Z","completed_languages":["prolog"]},{"id":"5bd776533a7e2720c40000e5","name":"The Poet And The Pendulum","slug":"the-poet-and-the-pendulum","completed_at":"2022-10-26T08:08:22.096Z","completed_languages":["prolog"]},{"id":"58ad09d6154165a1c80000d1","name":"Simple Fun #154: Zero And One","slug":"simple-fun-number-154-zero-and-one","completed_at":"2022-10-25T11:54:50.978Z","completed_languages":["prolog"]},{"id":"586beb5ba44cfc44ed0006c3","name":"Sum even numbers","slug":"sum-even-numbers","completed_at":"2022-10-25T08:04:39.994Z","completed_languages":["prolog"]},{"id":"594adadee075005308000122","name":"Even and Odd !","slug":"even-and-odd","completed_at":"2022-06-16T08:20:42.198Z","completed_languages":["python"]},{"id":"583ade15666df5a64e000058","name":"Evens and Odds","slug":"evens-and-odds","completed_at":"2022-06-16T08:10:47.666Z","completed_languages":["python"]},{"id":"624f1456881dac005273df53","name":"Bug Problem #2","slug":"bug-problem-number-2","completed_at":"2022-04-08T06:51:40.194Z","completed_languages":["java"]},{"id":"624f0a65c0da4c00174b7a31","name":"Bug Problem #1","slug":"bug-problem-number-1","completed_at":"2022-04-08T06:41:11.530Z","completed_languages":["java"]},{"id":"623101f66e8da000239650f0","name":"Power Calculator","slug":"power-calculator","completed_at":"2022-03-16T06:47:59.284Z","completed_languages":["python"]},{"id":"61e922feaf1452001b104246","name":"Lowest positive integer","slug":"lowest-positive-integer","completed_at":"2022-01-20T09:59:54.123Z","completed_languages":["javascript"]},{"id":"596776fbb4f24d0d82000141","name":"Alternating between three values","slug":"alternating-between-three-values","completed_at":"2022-01-09T17:06:38.648Z","completed_languages":["javascript"]},{"id":"57a62154cf1fa5b25200031e","name":"Alternate case","slug":"alternate-case","completed_at":"2022-01-06T16:16:32.262Z","completed_languages":["javascript"]},{"id":"563700da1ac8be8f1e0000dc","name":"Rearrange Number to Get its Maximum","slug":"rearrange-number-to-get-its-maximum","completed_at":"2021-12-29T08:55:22.439Z","completed_languages":["python"]},{"id":"5a1a9e5032b8b98477000004","name":"Evens times last","slug":"evens-times-last","completed_at":"2021-12-27T09:51:42.042Z","completed_languages":["javascript","prolog"]},{"id":"5531abe4855bcc8d1f00004c","name":"Ten-Pin Bowling","slug":"ten-pin-bowling","completed_at":"2021-12-26T13:50:48.401Z","completed_languages":["java"]},{"id":"53c92d34689f84a2d5000e48","name":"Carmichael function","slug":"carmichael-function","completed_at":"2021-12-25T15:47:20.340Z","completed_languages":["cpp"]},{"id":"532b4057484b0e58e8000766","name":"Use reduce() to calculate the sum of the values in an array","slug":"use-reduce-to-calculate-the-sum-of-the-values-in-an-array","completed_at":"2021-12-25T06:55:07.509Z","completed_languages":["javascript"]},{"id":"599474846ca73bde2f000004","name":"Pocket money","slug":"pocket-money","completed_at":"2021-12-25T06:48:39.615Z","completed_languages":["javascript"]},{"id":"5a08b22b32b8b96f4700001c","name":"Power tower modulo m","slug":"power-tower-modulo-m","completed_at":"2021-12-24T14:28:35.931Z","completed_languages":["python","csharp"]},{"id":"614dfc4ce78d31004a9c1276","name":"Electronics #1. Ohm's Law","slug":"electronics-number-1-ohms-law","completed_at":"2021-12-23T09:01:43.319Z","completed_languages":["python"]},{"id":"5864eb8039c5ab9cd400005c","name":"All Star Code Challenge #14 - Find the median","slug":"all-star-code-challenge-number-14-find-the-median","completed_at":"2021-12-23T08:31:06.233Z","completed_languages":["python"]},{"id":"52210226578afb73bd0000f1","name":"Game - Electrons around the cores","slug":"game-electrons-around-the-cores","completed_at":"2021-12-22T16:37:18.269Z","completed_languages":["javascript"]},{"id":"5dd462a573ee6d0014ce715b","name":"Check same case","slug":"check-same-case","completed_at":"2021-12-22T16:16:55.269Z","completed_languages":["python"]},{"id":"5b76a34ff71e5de9db0000f2","name":"Simple time difference","slug":"simple-time-difference","completed_at":"2021-12-22T16:00:16.315Z","completed_languages":["python"]},{"id":"5a61a846cadebf9738000076","name":"Peak array index","slug":"peak-array-index","completed_at":"2021-12-22T15:10:36.768Z","completed_languages":["python"]},{"id":"57ed40e3bd793e9c92000fcb","name":"Chicken Sexing","slug":"chicken-sexing","completed_at":"2021-12-22T15:01:55.523Z","completed_languages":["javascript"]},{"id":"59a1cdde9f922b83ee00003b","name":"Stanton measure","slug":"stanton-measure","completed_at":"2021-12-22T14:02:47.420Z","completed_languages":["java"]},{"id":"53c945d750fe7094ee00016b","name":"Modular Multiplicative Inverse","slug":"modular-multiplicative-inverse","completed_at":"2021-12-22T13:42:19.424Z","completed_languages":["python"]},{"id":"5809c661f15835266900010a","name":"Double Every Other","slug":"double-every-other","completed_at":"2021-12-22T09:53:06.922Z","completed_languages":["python"]},{"id":"57f7796697d62fc93d0001b8","name":"Double Trouble","slug":"double-trouble","completed_at":"2021-12-19T10:21:37.234Z","completed_languages":["python"]},{"id":"572caa2672a38ba648001dcd","name":"Transformation of a Number Through Prime Factorization","slug":"transformation-of-a-number-through-prime-factorization","completed_at":"2021-12-15T13:42:42.617Z","completed_languages":["python"]},{"id":"57bf7fae3b3164dcac000352","name":"Prime Sextuplets","slug":"prime-sextuplets","completed_at":"2021-12-14T16:07:20.349Z","completed_languages":["python"]},{"id":"5805f0663f1f9c49be00011f","name":"Birthday II - Presents","slug":"birthday-ii-presents","completed_at":"2021-12-14T10:56:44.863Z","completed_languages":["javascript"]},{"id":"597ef546ee48603f7a000057","name":"Most profit from stock quotes","slug":"most-profit-from-stock-quotes","completed_at":"2021-12-13T08:55:57.477Z","completed_languages":["javascript"]},{"id":"57ed30dde7728215300005fa","name":"Bumps in the Road","slug":"bumps-in-the-road","completed_at":"2021-12-13T07:56:30.477Z","completed_languages":["python","ruby","crystal","javascript","coffeescript","java"]},{"id":"5887a6fe0cfe64850800161c","name":"Largest Square Inside A Circle","slug":"largest-square-inside-a-circle","completed_at":"2021-12-13T07:34:16.097Z","completed_languages":["python","javascript","coffeescript","cpp","csharp","haskell","r","ruby","typescript"]},{"id":"5b6b128783d648c4c4000129","name":"Smallest Product","slug":"smallest-product","completed_at":"2021-12-10T10:37:11.544Z","completed_languages":["python"]},{"id":"5f5daf1a209a64001183af9b","name":"Pack Some Chocolates","slug":"pack-some-chocolates","completed_at":"2021-12-09T13:15:56.135Z","completed_languages":["python"]},{"id":"5d16af632cf48200254a6244","name":"Strongest even number in an interval","slug":"strongest-even-number-in-an-interval","completed_at":"2021-12-07T16:25:45.802Z","completed_languages":["csharp"]},{"id":"5a58d889880385c2f40000aa","name":"Automorphic Number (Special Numbers Series  #6)","slug":"automorphic-number-special-numbers-series-number-6","completed_at":"2021-11-30T13:09:40.654Z","completed_languages":["dart","java","prolog"]},{"id":"5a55f04be6be383a50000187","name":"Special  Number (Special Numbers Series  #5)","slug":"special-number-special-numbers-series-number-5","completed_at":"2021-11-29T16:31:22.538Z","completed_languages":["python","prolog"]},{"id":"589b1c15081bcbfe6700017a","name":"Driving School Series #2","slug":"driving-school-series-number-2","completed_at":"2021-11-29T16:12:02.304Z","completed_languages":["javascript"]},{"id":"5bb3e299484fcd5dbb002912","name":"Billiards triangle","slug":"billiards-triangle","completed_at":"2021-11-26T13:37:31.785Z","completed_languages":["javascript"]},{"id":"591592b0f05d9a3019000087","name":"Simple Fun #274: Diplomas","slug":"simple-fun-number-274-diplomas","completed_at":"2021-11-26T10:38:15.544Z","completed_languages":["javascript"]},{"id":"53c9157c689f841d16000c03","name":"Euler Totient Function","slug":"euler-totient-function","completed_at":"2021-11-25T13:12:08.165Z","completed_languages":["python"]},{"id":"5dae2599a8f7d90025d2f15f","name":"Consecutive Digits To Form Sum","slug":"consecutive-digits-to-form-sum","completed_at":"2021-11-21T17:35:33.938Z","completed_languages":["javascript","prolog"]},{"id":"5cd4aec6abc7260028dcd942","name":"Shortest steps to a number","slug":"shortest-steps-to-a-number","completed_at":"2021-11-14T13:37:05.722Z","completed_languages":["csharp","c","haskell","javascript","julia","python","ruby"]},{"id":"59bd84b8a0640e7c49002398","name":"Triangle area","slug":"triangle-area","completed_at":"2021-11-11T13:56:18.393Z","completed_languages":["javascript","java","csharp","powershell","python"]},{"id":"5fde1ea66ba4060008ea5bd9","name":"⚠️Fusion  Chamber Shutdown⚠️","slug":"fusion-chamber-shutdown","completed_at":"2021-11-04T14:23:37.427Z","completed_languages":["elm","python","c","cpp","csharp","java","julia","javascript","coffeescript","dart","elixir","ruby","crystal","perl","raku","prolog"]},{"id":"5b609ebc8f47bd595e000627","name":"Find the force of gravity between two objects","slug":"find-the-force-of-gravity-between-two-objects","completed_at":"2021-11-04T10:24:40.804Z","completed_languages":["java","javascript","coffeescript","python"]},{"id":"588422ba4e8efb583d00007d","name":"Simple Fun #3: Late Ride","slug":"simple-fun-number-3-late-ride","completed_at":"2021-11-02T13:47:41.913Z","completed_languages":["python","elm","c","javascript","coffeescript","cpp","ruby","crystal","csharp","dart","elixir","go","haskell","julia","php","r"]},{"id":"5bb804397274c772b40000ca","name":"Stacked Balls - 2D","slug":"stacked-balls-2d","completed_at":"2021-11-01T15:14:49.325Z","completed_languages":["javascript","elm"]},{"id":"58865bfb41e04464240000b0","name":"World Bits War","slug":"world-bits-war","completed_at":"2021-10-31T16:28:56.536Z","completed_languages":["javascript","java","csharp","python","php","ruby","crystal"]},{"id":"5a54c56cb6be5311850014df","name":"Shorten Me: Array Declaration II (undefined)","slug":"shorten-me-array-declaration-ii-undefined","completed_at":"2021-10-31T14:01:03.813Z","completed_languages":["javascript"]},{"id":"5a6855c2e6be38cdbf000026","name":"Shorten Me: Mad Mathematician's Algorithm I (Addition)","slug":"shorten-me-mad-mathematicians-algorithm-i-addition","completed_at":"2021-10-31T09:41:39.313Z","completed_languages":["javascript"]},{"id":"56eff1e64794404a720002d2","name":"Thinking & Testing : How many \"word\"?","slug":"thinking-and-testing-how-many-word","completed_at":"2021-10-31T08:53:44.876Z","completed_languages":["python"]},{"id":"5a685705b3bfa870f6000024","name":"Shorten Me: Mad Mathematician's Algorithm II (Subtraction)","slug":"shorten-me-mad-mathematicians-algorithm-ii-subtraction","completed_at":"2021-10-30T06:52:27.752Z","completed_languages":["javascript"]},{"id":"584ebd7a044a1520f20000d5","name":"Range function","slug":"range-function","completed_at":"2021-10-29T13:42:34.637Z","completed_languages":["javascript"]},{"id":"5298961d9ce954d77b0003a6","name":"The range() function","slug":"the-range-function","completed_at":"2021-10-29T12:46:56.208Z","completed_languages":["javascript"]},{"id":"5298ad7cd0f550269500051b","name":"Ziiiiip!","slug":"ziiiiip","completed_at":"2021-10-29T12:01:08.131Z","completed_languages":["javascript"]},{"id":"58845748bd5733f1b300001f","name":"Simple Fun #10: Range Bit Counting","slug":"simple-fun-number-10-range-bit-counting","completed_at":"2021-10-29T08:24:30.211Z","completed_languages":["python"]},{"id":"57238ceaef9008adc7000603","name":"Training JS #14: Methods of Number object--toString() and toLocaleString()","slug":"training-js-number-14-methods-of-number-object-tostring-and-tolocalestring","completed_at":"2021-10-27T13:00:04.977Z","completed_languages":["javascript"]},{"id":"5722fd3ab7162a3a4500031f","name":"Training JS #13: Number object and  its properties","slug":"training-js-number-13-number-object-and-its-properties","completed_at":"2021-10-27T12:53:09.046Z","completed_languages":["javascript"]},{"id":"5721a78c283129e416000999","name":"Training JS #10: loop statement --for","slug":"training-js-number-10-loop-statement-for","completed_at":"2021-10-27T12:44:19.166Z","completed_languages":["javascript"]},{"id":"5722b3f0bd5583cf44001000","name":"Training JS #12: loop statement --for..in and for..of","slug":"training-js-number-12-loop-statement-for-dot-in-and-for-dot-of","completed_at":"2021-10-27T12:40:19.425Z","completed_languages":["javascript"]},{"id":"571ec274b1c8d4a61c0000c8","name":"Training JS #1: create your first JS function and print \"Hello World!\"","slug":"training-js-number-1-create-your-first-js-function-and-print-hello-world","completed_at":"2021-10-27T12:35:49.037Z","completed_languages":["javascript"]},{"id":"571edd157e8954bab500032d","name":"Training JS #2:  Basic data types--Number","slug":"training-js-number-2-basic-data-types-number","completed_at":"2021-10-27T12:31:37.036Z","completed_languages":["javascript"]},{"id":"571edea4b625edcb51000d8e","name":"Training JS #3:  Basic data types--String","slug":"training-js-number-3-basic-data-types-string","completed_at":"2021-10-27T12:27:35.147Z","completed_languages":["javascript"]},{"id":"571effabb625ed9b0600107a","name":"Training JS #4:  Basic data types--Array","slug":"training-js-number-4-basic-data-types-array","completed_at":"2021-10-27T12:09:06.647Z","completed_languages":["javascript"]},{"id":"57037ed25a7263ac35000c80","name":"Generate user links","slug":"generate-user-links","completed_at":"2021-10-27T09:33:32.568Z","completed_languages":["javascript"]}],"total_items":2644,"total_pages":14},"meta":{"timestamp":"2026-06-09T20:24:33.791Z","request_id":"053b7753-1a70-4a9c-a00b-98e9022ab76f"},"status":"ok","message":"Completed kata retrieved successfully","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}},"/v1/user":{"get":{"operationId":"get_v1_user","tags":["Members"],"summary":"Member reputation profile","description":"","parameters":[{"name":"username","in":"query","required":true,"description":"Codewars username","schema":{"type":"string"},"example":"g964"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"clan":"None","honor":486971,"skills":[],"source":"Codewars","username":"g964","overall_rank":{"id":-1,"name":"1 kyu","color":"purple","score":30497},"language_ranks":[{"id":-1,"name":"1 kyu","color":"purple","score":16799,"language":"javascript"},{"id":-1,"name":"1 kyu","color":"purple","score":13552,"language":"python"},{"id":-2,"name":"2 kyu","color":"purple","score":8963,"language":"ruby"},{"id":-2,"name":"2 kyu","color":"purple","score":6079,"language":"java"},{"id":-2,"name":"2 kyu","color":"purple","score":5325,"language":"csharp"},{"id":-2,"name":"2 kyu","color":"purple","score":4932,"language":"coffeescript"},{"id":-3,"name":"3 kyu","color":"blue","score":3944,"language":"haskell"},{"id":-3,"name":"3 kyu","color":"blue","score":3314,"language":"scala"},{"id":-3,"name":"3 kyu","color":"blue","score":3090,"language":"kotlin"},{"id":-3,"name":"3 kyu","color":"blue","score":3053,"language":"go"},{"id":-3,"name":"3 kyu","color":"blue","score":2606,"language":"typescript"},{"id":-3,"name":"3 kyu","color":"blue","score":2601,"language":"cpp"},{"id":-3,"name":"3 kyu","color":"blue","score":2470,"language":"racket"},{"id":-3,"name":"3 kyu","color":"blue","score":2370,"language":"nim"},{"id":-3,"name":"3 kyu","color":"blue","score":2297,"language":"clojure"},{"id":-3,"name":"3 kyu","color":"blue","score":2269,"language":"prolog"},{"id":-3,"name":"3 kyu","color":"blue","score":2254,"language":"php"},{"id":-3,"name":"3 kyu","color":"blue","score":2134,"language":"rust"},{"id":-3,"name":"3 kyu","color":"blue","score":2077,"language":"perl"},{"id":-3,"name":"3 kyu","color":"blue","score":1861,"language":"julia"},{"id":-3,"name":"3 kyu","color":"blue","score":1790,"language":"shell"},{"id":-4,"name":"4 kyu","color":"blue","score":1736,"language":"elm"},{"id":-4,"name":"4 kyu","color":"blue","score":1726,"language":"r"},{"id":-4,"name":"4 kyu","color":"blue","score":1721,"language":"pascal"},{"id":-4,"name":"4 kyu","color":"blue","score":1631,"language":"lua"},{"id":-4,"name":"4 kyu","color":"blue","score":1622,"language":"ocaml"},{"id":-4,"name":"4 kyu","color":"blue","score":1614,"language":"fsharp"},{"id":-4,"name":"4 kyu","color":"blue","score":1579,"language":"d"},{"id":-4,"name":"4 kyu","color":"blue","score":1523,"language":"c"},{"id":-4,"name":"4 kyu","color":"blue","score":1353,"language":"crystal"},{"id":-4,"name":"4 kyu","color":"blue","score":1328,"language":"dart"},{"id":-4,"name":"4 kyu","color":"blue","score":1298,"language":"reason"},{"id":-4,"name":"4 kyu","color":"blue","score":1284,"language":"powershell"},{"id":-4,"name":"4 kyu","color":"blue","score":1173,"language":"erlang"},{"id":-4,"name":"4 kyu","color":"blue","score":1015,"language":"groovy"},{"id":-4,"name":"4 kyu","color":"blue","score":1003,"language":"fortran"},{"id":-4,"name":"4 kyu","color":"blue","score":944,"language":"elixir"},{"id":-4,"name":"4 kyu","color":"blue","score":841,"language":"swift"},{"id":-4,"name":"4 kyu","color":"blue","score":709,"language":"haxe"},{"id":-5,"name":"5 kyu","color":"yellow","score":575,"language":"raku"},{"id":-5,"name":"5 kyu","color":"yellow","score":573,"language":"forth"},{"id":-5,"name":"5 kyu","color":"yellow","score":530,"language":"vb"},{"id":-5,"name":"5 kyu","color":"yellow","score":322,"language":"commonlisp"},{"id":-6,"name":"6 kyu","color":"yellow","score":203,"language":"sql"},{"id":-6,"name":"6 kyu","color":"yellow","score":203,"language":"objc"},{"id":-6,"name":"6 kyu","color":"yellow","score":121,"language":"factor"},{"id":-7,"name":"7 kyu","color":"white","score":31,"language":"cfml"},{"id":-8,"name":"8 kyu","color":"white","score":14,"language":"purescript"},{"id":-8,"name":"8 kyu","color":"white","score":13,"language":"solidity"},{"id":-8,"name":"8 kyu","color":"white","score":4,"language":"coq"},{"id":-8,"name":"8 kyu","color":"white","score":2,"language":"cobol"}],"total_authored":147,"total_completed":2644,"leaderboard_position":1},"meta":{"timestamp":"2026-06-09T20:24:34.124Z","request_id":"26ca4600-72f4-4611-9c53-3d470ab1a86e"},"status":"ok","message":"User retrieved successfully","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}},"/v1/kata":{"get":{"operationId":"get_v1_kata","tags":["Kata"],"summary":"Code challenge in full","description":"","parameters":[{"name":"id","in":"query","required":true,"description":"Kata id or slug","schema":{"type":"string"},"example":"valid-braces"}],"security":[{"oanorKey":[]}],"responses":{"200":{"description":"OK","content":{"application/json":{"example":{"data":{"id":"5277c8a221e209d3f6000b56","url":"https://www.codewars.com/kata/5277c8a221e209d3f6000b56","name":"Valid Braces","slug":"valid-braces","tags":["Algorithms"],"source":"Codewars","category":"algorithms","languages":["javascript","coffeescript","haskell","csharp","python","java","ruby","php","typescript","elixir","cpp","dart","rust","swift","go","lua","scala","c","julia","cobol"],"created_by":"xDranik","difficulty":{"id":-6,"name":"6 kyu","color":"yellow"},"vote_score":6273,"total_stars":3500,"published_at":"2013-11-05T00:07:31.399Z","total_attempts":490830,"total_completed":83255},"meta":{"timestamp":"2026-06-09T20:24:34.712Z","request_id":"04cf46d5-1daa-4196-811a-e8ca0b09ffe4"},"status":"ok","message":"Kata retrieved successfully","success":true}}}},"401":{"description":"Missing or invalid x-oanor-key header"},"402":{"description":"Active subscription required"},"429":{"description":"Rate-limit or monthly quota reached"},"502":{"description":"Upstream did not respond"}}}}},"x-oanor-pricing":[{"slug":"free","name":"Free","price_cents_month":0,"monthly_call_quota":9000,"rps_limit":2,"hard_limit":true},{"slug":"starter","name":"Starter","price_cents_month":500,"monthly_call_quota":170000,"rps_limit":6,"hard_limit":true},{"slug":"pro","name":"Pro","price_cents_month":1700,"monthly_call_quota":1100000,"rps_limit":15,"hard_limit":true},{"slug":"business","name":"Business","price_cents_month":4100,"monthly_call_quota":5600000,"rps_limit":35,"hard_limit":true}],"x-oanor-marketplace-url":"https://www.oanor.com/api/codewars-api"}