Skip to content

Commit

Permalink
add secret-handshake
Browse files Browse the repository at this point in the history
  • Loading branch information
BNAndras committed Jul 4, 2024
1 parent 4938204 commit 057b51a
Show file tree
Hide file tree
Showing 8 changed files with 211 additions and 0 deletions.
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -243,6 +243,14 @@
"transforming"
]
},
{
"slug": "secret-handshake",
"name": "Secret Handshake",
"uuid": "7d762bca-0aac-4ba9-8035-157a93ab5df5",
"practices": [],
"prerequisites": [],
"difficulty": 2
},
{
"slug": "square-root",
"name": "Square Root",
Expand Down
48 changes: 48 additions & 0 deletions exercises/practice/secret-handshake/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
# Instructions

Your task is to convert a number between 1 and 31 to a sequence of actions in the secret handshake.

The sequence of actions is chosen by looking at the rightmost five digits of the number once it's been converted to binary.
Start at the right-most digit and move left.

The actions for each number place are:

```plaintext
00001 = wink
00010 = double blink
00100 = close your eyes
01000 = jump
10000 = Reverse the order of the operations in the secret handshake.
```

Let's use the number `9` as an example:

- 9 in binary is `1001`.
- The digit that is farthest to the right is 1, so the first action is `wink`.
- Going left, the next digit is 0, so there is no double-blink.
- Going left again, the next digit is 0, so you leave your eyes open.
- Going left again, the next digit is 1, so you jump.

That was the last digit, so the final code is:

```plaintext
wink, jump
```

Given the number 26, which is `11010` in binary, we get the following actions:

- double blink
- jump
- reverse actions

The secret handshake for 26 is therefore:

```plaintext
jump, double blink
```

~~~~exercism/note
If you aren't sure what binary is or how it works, check out [this binary tutorial][intro-to-binary].
[intro-to-binary]: https://medium.com/basecs/bits-bytes-building-with-binary-13cb4289aafa
~~~~
7 changes: 7 additions & 0 deletions exercises/practice/secret-handshake/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,7 @@
# Introduction

You are starting a secret coding club with some friends and friends-of-friends.
Not everyone knows each other, so you and your friends have decided to create a secret handshake that you can use to recognize that someone is a member.
You don't want anyone who isn't in the know to be able to crack the code.

You've designed the code so that one person says a number between 1 and 31, and the other person turns it into a series of actions.
19 changes: 19 additions & 0 deletions exercises/practice/secret-handshake/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"BNAndras"
],
"files": {
"solution": [
"source/secret_handshake.d"
],
"test": [
"source/secret_handshake.d"
],
"example": [
"example/secret_handshake.d"
]
},
"blurb": "Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.",
"source": "Bert, in Mary Poppins",
"source_url": "https://www.imdb.com/title/tt0058331/quotes/?item=qt0437047"
}
43 changes: 43 additions & 0 deletions exercises/practice/secret-handshake/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,43 @@
# 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.

[b8496fbd-6778-468c-8054-648d03c4bb23]
description = "wink for 1"

[83ec6c58-81a9-4fd1-bfaf-0160514fc0e3]
description = "double blink for 10"

[0e20e466-3519-4134-8082-5639d85fef71]
description = "close your eyes for 100"

[b339ddbb-88b7-4b7d-9b19-4134030d9ac0]
description = "jump for 1000"

[40499fb4-e60c-43d7-8b98-0de3ca44e0eb]
description = "combine two actions"

[9730cdd5-ef27-494b-afd3-5c91ad6c3d9d]
description = "reverse two actions"

[0b828205-51ca-45cd-90d5-f2506013f25f]
description = "reversing one action gives the same action"

[9949e2ac-6c9c-4330-b685-2089ab28b05f]
description = "reversing no actions still gives no actions"

[23fdca98-676b-4848-970d-cfed7be39f81]
description = "all possible actions"

[ae8fe006-d910-4d6f-be00-54b7c3799e79]
description = "reverse all possible actions"

[3d36da37-b31f-4cdb-a396-d93a2ee1c4a5]
description = "do nothing for zero"
2 changes: 2 additions & 0 deletions exercises/practice/secret-handshake/dub.sdl
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
name "secret-handshake"
buildRequirements "disallowDeprecations"
36 changes: 36 additions & 0 deletions exercises/practice/secret-handshake/example/secret_handshake.d
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
module secret_handshake;

import std.algorithm;

pure string[] commands(immutable int number)
{
string[] actions;

if (number & 1)
{
actions ~= "wink";
}

if (number & 2)
{
actions ~= "double blink";
}

if (number & 4)
{
actions ~= "close your eyes";
}

if (number & 8)
{
actions ~= "jump";
}

if (number & 16)
{
actions = actions.reverse;
}

return actions;
}

48 changes: 48 additions & 0 deletions exercises/practice/secret-handshake/source/secret_handshake.d
Original file line number Diff line number Diff line change
@@ -0,0 +1,48 @@
module secret_handshake;

pure string[] commands(immutable int number)
{
// implement this function
}

unittest
{
immutable int allTestsEnabled = 0;

// Wink for 1
assert(commands(1) == ["wink"]);

static if (allTestsEnabled)
{
// Double blink for 10
assert(commands(2) == ["double blink"]);

// Close your eyes for 100
assert(commands(4) == ["close your eyes"]);

// Jump for 1000
assert(commands(8) == ["jump"]);

// Combine two actions
assert(commands(3) == ["wink", "double blink"]);

// Reverse two actions
assert(commands(19) == ["double blink", "wink"]);

// Reversing one action gives the same action
assert(commands(24) == ["jump"]);

// Reversing no actions still gives no actions
assert(commands(16) == []);

// All possible actions
assert(commands(15) == ["wink", "double blink", "close your eyes", "jump"]);

// Reverse all possible actions
assert(commands(31) == ["jump", "close your eyes", "double blink", "wink"]);

// Do nothing for zero
assert(commands(0) == []);
}
}

0 comments on commit 057b51a

Please sign in to comment.