Skip to content

List of Possible Duplicate Kata

Caleb Miller edited this page Aug 5, 2019 · 52 revisions

Derived from #1315. This page is for possible duplicates.

Note that "duplicate" is not defined yet.
Please help collecting information to understand the problem better.

Usage

This page currently uses the following format:

## Topic/kata category

- [ ] link to kata
    - any notes on this specific kata
- [ ] :small_orange_diamond: link to beta kata
- [x] :small_orange_diamond: ~~link to beta kata~~, retired

Overall notes/summary on this topic, suggestions, ...
  • Notes will help later when we take action. Please try to keep them objective.
    Information like "this has X but not Y", what makes this different, etc will be useful.

  • the 🔸 denotes Beta kata


Arithmetic Expression Parser

related: Idea: Deduplicate "evaluate math expression" katas. #1563

Base Conversion

General

Hex/bin only

Befunge Interpreter

Suggestion: retire the beta (ruby only) version.

Big Integer: Sum

Big Integer: Multiply

Ceasar Cipher

Church Numerals

Count Words

Data Types à la Carte

Factorial

Factorial: Trailing Zeros

Fibonacci Numbers

Fibonacci Number Generators

Fibonacci Rectangle

Fibonacci Numbers: (Sum of Even Numbers)

Fizzbuzz

Goldbach Conjecture

Happy Numbers

Integer Factorization

Maximum Subarray Sum

N queens problem

  • 🔸 N queen problem
    • the easiest one, no additional constraints, 0 < size < 20, overranked as 4 kyu. Available only in JS. Since only one valid solution is requested, it can be easily generated and/or hardcoded. Candidate to retire or to make N much higher.
  • 🔸 Eight Queens Puzzle
    • size=8, one mandatory position. Nice intermediate problem, although no random tests. JS only.
  • 🔸 n Queens Problem
    • Like above, but meant to be difficult. 0 < size < 50, one mandatory position. Requires efficient approach (but see further note). Nice, advanced-ish level problem. C++ only, but I am going to translate it. It could have more tests or larger N, however the https://github.com/Codewars/codewars-runner-cli/issues/714 is a problem here, because without -O2 code just crawls while it runs much, much, much faster when optimizations are enabled. Without -O2, it's difficult to estimate good range for size and amount of tests.

Some ideas and discussion here.

Pascal Triangle

Primality Check

Prime Counting

Prime Generator

Primes (Sum of )

Rot-13:

Sieve

Sudoku Board Validation

Sudoku Solver

Suggestions:

  • retire all the sudoku-solver-number-N ("duplicates of themselves", according to Voile)
  • retire the mini-sudoku one (too much issues and no interest about reducing the size)
  • retire the easy sudoku one (issues/straight duplicate of the "not hard" 3 kyus
  • Keep the 2 kyus
  • Keep one of the published 3 kyus, but here is the trick:
    • the "hard one" is too close to the 2 kyus, but has homogeneous versions
    • the "not hard" is further so more interesting as a companion for the 2 kyus, but as more languages that aren't consistent with each others and have generally not the random tests.

Other


Resolved:

Divisibility Check with Regular Expression

Clone this wiki locally