Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -79,6 +79,14 @@
"prerequisites": [],
"difficulty": 2
},
{
"slug": "all-your-base",
"name": "All Your Base",
"uuid": "a8eaf0dc-c5ff-46a2-9c47-86f738909db9",
"practices": [],
"prerequisites": [],
"difficulty": 4
},
{
"slug": "binary-search",
"name": "Binary Search",
Expand Down
28 changes: 28 additions & 0 deletions exercises/practice/all-your-base/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
# Instructions

Convert a sequence of digits in one base, representing a number, into a sequence of digits in another base, representing the same number.

~~~~exercism/note
Try to implement the conversion yourself.
Do not use something else to perform the conversion for you.
~~~~

## About [Positional Notation][positional-notation]

In positional notation, a number in base **b** can be understood as a linear combination of powers of **b**.

The number 42, _in base 10_, means:

`(4 × 10¹) + (2 × 10⁰)`

The number 101010, _in base 2_, means:

`(1 × 2⁵) + (0 × 2⁴) + (1 × 2³) + (0 × 2²) + (1 × 2¹) + (0 × 2⁰)`

The number 1120, _in base 3_, means:

`(1 × 3³) + (1 × 3²) + (2 × 3¹) + (0 × 3⁰)`

_Yes. Those three numbers above are exactly the same. Congratulations!_

[positional-notation]: https://en.wikipedia.org/wiki/Positional_notation
8 changes: 8 additions & 0 deletions exercises/practice/all-your-base/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
# Introduction

You've just been hired as professor of mathematics.
Your first week went well, but something is off in your second week.
The problem is that every answer given by your students is wrong!
Luckily, your math skills have allowed you to identify the problem: the student answers _are_ correct, but they're all in base 2 (binary)!
Amazingly, it turns out that each week, the students use a different base.
To help you quickly verify the student answers, you'll be building a tool to translate between bases.
2 changes: 2 additions & 0 deletions exercises/practice/all-your-base/.gitignore
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
node_modules
**/*.res.js
21 changes: 21 additions & 0 deletions exercises/practice/all-your-base/.meta/AllYourBase.res
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
let rebase = (inputBase, digits, outputBase) => {
let hasInvalidDigit = digits->Array.some(d => d < 0 || d >= inputBase)
let allZeros = digits->Array.every(d => d == 0)

switch (inputBase, outputBase) {
| (ib, _) if ib < 2 => None
| (_, ob) if ob < 2 => None
| _ if hasInvalidDigit => None
| _ if allZeros => Some([0])
| _ => {
let total = digits->Array.reduce(0, (acc, d) => acc * inputBase + d)

let rec generate = (acc, val) => {
val == 0 ? acc : generate(list{mod(val, outputBase), ...acc}, val / outputBase)
}

let resultList = generate(list{}, total)
Some(resultList->List.toArray)
}
}
}
1 change: 1 addition & 0 deletions exercises/practice/all-your-base/.meta/AllYourBase.resi
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
let rebase: (int, array<int>, int) => option<array<int>>
19 changes: 19 additions & 0 deletions exercises/practice/all-your-base/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"therealowenrees"
],
"files": {
"solution": [
"src/AllYourBase.res",
"src/AllYourBase.resi"
],
"test": [
"tests/AllYourBase_test.res"
],
"example": [
".meta/AllYourBase.res",
".meta/AllYourBase.resi"
]
},
"blurb": "Convert a number, represented as a sequence of digits in one base, to any other base."
}
25 changes: 25 additions & 0 deletions exercises/practice/all-your-base/.meta/testTemplate.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
import path from 'node:path';
import { fileURLToPath } from 'node:url';
import { assertEqual } from "../../../../test_generator/assertions.js";
import { generateTests } from '../../../../test_generator/testGenerator.js';

const __dirname = path.dirname(fileURLToPath(import.meta.url));
const slug = path.basename(path.resolve(__dirname, '..'))

// EDIT THIS WITH YOUR ASSERTIONS
export const assertionFunctions = [ assertEqual ]

// EDIT THIS WITH YOUR TEST TEMPLATES
export const template = (c) => {
const { inputBase, digits, outputBase } = c.input

const digitsArrStr = `[${digits.join(', ')}]`

const expectedStr = (Array.isArray(c.expected))
? `Some([${c.expected.join(', ')}])`
: "None"

return `assertEqual(~message="${c.description}", rebase(${inputBase}, ${digitsArrStr}, ${outputBase}), ${expectedStr})`
}

generateTests(__dirname, slug, assertionFunctions, template)
73 changes: 73 additions & 0 deletions exercises/practice/all-your-base/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,73 @@
# This is an auto-generated file.
#
# Regenerating this file via `configlet sync` will:
# - Recreate every `description` key/value pair
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
# - Preserve any other key/value pair
#
# As user-added comments (using the # character) will be removed when this file
# is regenerated, comments can be added via a `comment` key.

[5ce422f9-7a4b-4f44-ad29-49c67cb32d2c]
description = "single bit one to decimal"

[0cc3fea8-bb79-46ac-a2ab-5a2c93051033]
description = "binary to single decimal"

[f12db0f9-0d3d-42c2-b3ba-e38cb375a2b8]
description = "single decimal to binary"

[2c45cf54-6da3-4748-9733-5a3c765d925b]
description = "binary to multiple decimal"

[65ddb8b4-8899-4fcc-8618-181b2cf0002d]
description = "decimal to binary"

[8d418419-02a7-4824-8b7a-352d33c6987e]
description = "trinary to hexadecimal"

[d3901c80-8190-41b9-bd86-38d988efa956]
description = "hexadecimal to trinary"

[5d42f85e-21ad-41bd-b9be-a3e8e4258bbf]
description = "15-bit integer"

[d68788f7-66dd-43f8-a543-f15b6d233f83]
description = "empty list"

[5e27e8da-5862-4c5f-b2a9-26c0382b6be7]
description = "single zero"

[2e1c2573-77e4-4b9c-8517-6c56c5bcfdf2]
description = "multiple zeros"

[3530cd9f-8d6d-43f5-bc6e-b30b1db9629b]
description = "leading zeros"

[a6b476a1-1901-4f2a-92c4-4d91917ae023]
description = "input base is one"

[e21a693a-7a69-450b-b393-27415c26a016]
description = "input base is zero"

[54a23be5-d99e-41cc-88e0-a650ffe5fcc2]
description = "input base is negative"

[9eccf60c-dcc9-407b-95d8-c37b8be56bb6]
description = "negative digit"

[232fa4a5-e761-4939-ba0c-ed046cd0676a]
description = "invalid positive digit"

[14238f95-45da-41dc-95ce-18f860b30ad3]
description = "output base is one"

[73dac367-da5c-4a37-95fe-c87fad0a4047]
description = "output base is zero"

[13f81f42-ff53-4e24-89d9-37603a48ebd9]
description = "output base is negative"

[0e6c895d-8a5d-4868-a345-309d094cfe8d]
description = "both bases are negative"
21 changes: 21 additions & 0 deletions exercises/practice/all-your-base/LICENSE
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
MIT License

Copyright (c) 2026 Exercism

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Loading
Loading