Skip to content

Commit

Permalink
Add reverse-string
Browse files Browse the repository at this point in the history
  • Loading branch information
BNAndras committed Jan 24, 2024
1 parent deb10ca commit 83e5e66
Show file tree
Hide file tree
Showing 13 changed files with 191 additions and 58 deletions.
96 changes: 38 additions & 58 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,6 @@
]
},
"exercises": {
"concept": [],
"practice": [
{
"slug": "hello-world",
Expand All @@ -56,7 +55,6 @@
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null,
"status": "deprecated"
},
{
Expand All @@ -65,44 +63,39 @@
"uuid": "68eec796-a269-4e66-84b5-e26574ff614e",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "anagram",
"name": "Anagram",
"uuid": "9bc1f720-ccd0-449f-99a7-1790b30690f1",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "atbash-cipher",
"name": "Atbash Cipher",
"uuid": "78c7360b-1460-4f16-8efe-5efcbd2cb863",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "bank-account",
"name": "Bank Account",
"uuid": "b5091e1d-c950-4cad-b583-c6b90c50c02e",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "beer-song",
"name": "Beer Song",
"uuid": "b3581dfe-27c4-4356-a1d9-1e13759db736",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "binary",
Expand All @@ -121,26 +114,23 @@
"uuid": "58764b96-7033-45f2-90a6-dd5e41a27ede",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "circular-buffer",
"name": "Circular Buffer",
"uuid": "ea131235-e238-4c8a-98b2-bb6191a89312",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "clock",
"name": "Clock",
"uuid": "0a75c71e-b634-4b49-b374-718528e21075",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "difference-of-squares",
Expand All @@ -159,44 +149,39 @@
"uuid": "049c088d-a0e6-4a19-8040-0a470c838e42",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "gigasecond",
"name": "Gigasecond",
"uuid": "63099375-19fa-462f-9e82-960508c229a4",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "grade-school",
"name": "Grade School",
"uuid": "d9013304-cc50-4a56-a645-51c4a80f1c82",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "grains",
"name": "Grains",
"uuid": "0669f6eb-f740-431e-a4fc-70bc3d4cf498",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "hamming",
"name": "Hamming",
"uuid": "8583b88b-03e4-4bba-bc7b-767f2298d67e",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "largest-series-product",
Expand All @@ -215,98 +200,87 @@
"uuid": "5617bcf3-dc58-437a-8e56-56d04ff8ddfb",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "luhn",
"name": "Luhn",
"uuid": "ee67a9ed-aad7-49db-bb00-a09925e48ffa",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "meetup",
"name": "Meetup",
"uuid": "1a93aacc-160f-4121-b03a-742e20f7c073",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "nucleotide-count",
"name": "Nucleotide Count",
"uuid": "9b1ae897-b15d-4180-af45-1c69f98a8f34",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "parallel-letter-frequency",
"name": "Parallel Letter Frequency",
"uuid": "b41a9294-5d21-49f2-9c7e-9506662a80d2",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "phone-number",
"name": "Phone Number",
"uuid": "c1e07140-0566-4b50-aca1-3eddaa87d4d2",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "rna-transcription",
"name": "RNA Transcription",
"uuid": "8db0d097-9758-4671-81ff-fd8111c4fd7d",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "robot-simulator",
"name": "Robot Simulator",
"uuid": "88c6dbe6-f672-4dba-950c-483e55ebd252",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "series",
"name": "Series",
"uuid": "f2ca089e-66db-4b85-8275-5932952a36bf",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "space-age",
"name": "Space Age",
"uuid": "dfb7c4aa-dc52-4973-8c50-f5153ab51406",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "strain",
"name": "Strain",
"uuid": "fe975ff0-e374-44c9-910b-740cc3cff4ad",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "sum-of-multiples",
Expand Down Expand Up @@ -336,12 +310,18 @@
"uuid": "5fca0d45-2bf5-486e-9c57-25cff5e4a9c5",
"practices": [],
"prerequisites": [],
"difficulty": 1,
"topics": null
"difficulty": 1
},
{
"slug": "reverse-string",
"name": "Reverse String",
"uuid": "a6a5838c-f35c-4fd2-ab80-62d6a61dd6b3",
"practices": [],
"prerequisites": [],
"difficulty": 2
}
]
},
"concepts": [],
"key_features": [
{
"title": "Core Erlang Foundation",
Expand Down Expand Up @@ -375,14 +355,14 @@
}
],
"tags": [
"paradigm/functional",
"typing/dynamic",
"typing/strong",
"execution_mode/compiled",
"platform/windows",
"platform/mac",
"paradigm/functional",
"platform/linux",
"platform/mac",
"platform/windows",
"runtime/beam",
"typing/dynamic",
"typing/strong",
"used_for/backends",
"used_for/scripts"
]
Expand Down
9 changes: 9 additions & 0 deletions exercises/practice/reverse-string/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
# Instructions

Your task is to reverse a given string.

Some examples:

- Turn `"stressed"` into `"desserts"`.
- Turn `"strops"` into `"sports"`.
- Turn `"racecar"` into `"racecar"`.
5 changes: 5 additions & 0 deletions exercises/practice/reverse-string/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
# Introduction

Reversing strings (reading them from right to left, rather than from left to right) is a surprisingly common task in programming.

For example, in bioinformatics, reversing the sequence of DNA or RNA strings is often important for various analyses, such as finding complementary strands or identifying palindromic sequences that have biological significance.
11 changes: 11 additions & 0 deletions exercises/practice/reverse-string/.gitignore
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
## -*- conf -*-
.rebar3
_build/
ebin/
erl_crash.dump
rebar3.crashdump

tmp
bin/configlet
bin/configlet.exe
CHECKLIST
19 changes: 19 additions & 0 deletions exercises/practice/reverse-string/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"BNAndras"
],
"files": {
"solution": [
"src/reverse-string.lfe"
],
"test": [
"test/reverse-string-tests.lfe"
],
"example": [
"src/example.lfe"
]
},
"blurb": "Reverse a given string.",
"source": "Introductory challenge to reverse an input string",
"source_url": "https://medium.freecodecamp.org/how-to-reverse-a-string-in-javascript-in-3-different-ways-75e4763c68cb"
}
5 changes: 5 additions & 0 deletions exercises/practice/reverse-string/.meta/example.lfe
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
(defmodule reverse
(export (string 1)))

(defun string (str)
(lists:reverse str))
28 changes: 28 additions & 0 deletions exercises/practice/reverse-string/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
# 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.

[c3b7d806-dced-49ee-8543-933fd1719b1c]
description = "an empty string"

[01ebf55b-bebb-414e-9dec-06f7bb0bee3c]
description = "a word"

[0f7c07e4-efd1-4aaa-a07a-90b49ce0b746]
description = "a capitalized word"

[71854b9c-f200-4469-9f5c-1e8e5eff5614]
description = "a sentence with punctuation"

[1f8ed2f3-56f3-459b-8f3e-6d8d654a1f6c]
description = "a palindrome"

[b9e7dec1-c6df-40bd-9fa3-cd7ded010c4c]
description = "an even-sized word"
Loading

0 comments on commit 83e5e66

Please sign in to comment.