From e337c3ad27a80dab6bfcab5334d1d73ffc9f0c59 Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Wed, 23 Feb 2022 22:25:05 +0000 Subject: [PATCH 01/20] https://github.com/learnpack/learnpack/issues/722 --- exercises/021-integral/README.es.md | 19 ++++++++++++++ exercises/021-integral/README.md | 19 ++++++++++++++ .../{22-Integral => 021-integral}/app.py | 0 .../solution.hide.py | 0 exercises/022-list-and-tuple/README.es.md | 18 +++++++++++++ exercises/022-list-and-tuple/README.md | 18 +++++++++++++ .../app.py | 0 .../solution.hide.py | 0 .../023-class-with-two-methods/README.es.md | 13 ++++++++++ .../023-class-with-two-methods/README.md | 13 ++++++++++ .../app.py | 0 .../solution.hide.py | 13 ++++++++++ exercises/024-print-formula/README.es.md | 18 +++++++++++++ exercises/024-print-formula/README.md | 17 +++++++++++++ .../app.py | 0 .../solution.hide.py | 0 .../025-two-dimensional-array/README.es.md | 18 +++++++++++++ exercises/025-two-dimensional-array/README.md | 17 +++++++++++++ .../app.py | 0 .../solution.hide.py | 0 exercises/026-sequence-of-words/README.es.md | 15 +++++++++++ exercises/026-sequence-of-words/README.md | 15 +++++++++++ .../app.py | 0 .../solution.hide.py | 0 exercises/027-sequence-of-lines/README.es.md | 23 +++++++++++++++++ exercises/027-sequence-of-lines/README.md | 25 +++++++++++++++++++ .../app.py | 0 .../solution.hide.py | 0 .../028-remove-duplicate-words/README.es.md | 19 ++++++++++++++ .../028-remove-duplicate-words/README.md | 18 +++++++++++++ .../app.py | 0 .../solution.hide.py | 0 exercises/029-divisable-binary/README.md | 16 ++++++++++++ .../app.py | 0 .../solution.hide.py | 0 .../README.md | 0 .../app.py | 0 .../solution.hide.py | 0 exercises/22-Integral/README.es.md | 11 -------- exercises/22-Integral/README.md | 11 -------- exercises/23-list-and-tuple/README.es.md | 12 --------- exercises/23-list-and-tuple/README.md | 12 --------- .../24-class-with-two-methods/README.es.md | 10 -------- exercises/24-class-with-two-methods/README.md | 9 ------- .../solution.hide.py | 13 ---------- exercises/25-print-formula/README.es.md | 19 -------------- exercises/25-print-formula/README.md | 17 ------------- .../26-two-dimensional-array/README.es.md | 13 ---------- exercises/26-two-dimensional-array/README.md | 12 --------- exercises/27-sequence-of-words/README.es.md | 10 -------- exercises/27-sequence-of-words/README.md | 10 -------- exercises/28-sequence-of-lines/README.es.md | 13 ---------- exercises/28-sequence-of-lines/README.md | 14 ----------- .../29-remove-duplicate-words/README.es.md | 18 ------------- exercises/29-remove-duplicate-words/README.md | 12 --------- exercises/30-divisable-binary/README.md | 9 ------- 56 files changed, 314 insertions(+), 225 deletions(-) create mode 100644 exercises/021-integral/README.es.md create mode 100644 exercises/021-integral/README.md rename exercises/{22-Integral => 021-integral}/app.py (100%) rename exercises/{22-Integral => 021-integral}/solution.hide.py (100%) create mode 100644 exercises/022-list-and-tuple/README.es.md create mode 100644 exercises/022-list-and-tuple/README.md rename exercises/{23-list-and-tuple => 022-list-and-tuple}/app.py (100%) rename exercises/{23-list-and-tuple => 022-list-and-tuple}/solution.hide.py (100%) create mode 100644 exercises/023-class-with-two-methods/README.es.md create mode 100644 exercises/023-class-with-two-methods/README.md rename exercises/{24-class-with-two-methods => 023-class-with-two-methods}/app.py (100%) create mode 100644 exercises/023-class-with-two-methods/solution.hide.py create mode 100644 exercises/024-print-formula/README.es.md create mode 100644 exercises/024-print-formula/README.md rename exercises/{25-print-formula => 024-print-formula}/app.py (100%) rename exercises/{25-print-formula => 024-print-formula}/solution.hide.py (100%) create mode 100644 exercises/025-two-dimensional-array/README.es.md create mode 100644 exercises/025-two-dimensional-array/README.md rename exercises/{26-two-dimensional-array => 025-two-dimensional-array}/app.py (100%) rename exercises/{26-two-dimensional-array => 025-two-dimensional-array}/solution.hide.py (100%) create mode 100644 exercises/026-sequence-of-words/README.es.md create mode 100644 exercises/026-sequence-of-words/README.md rename exercises/{27-sequence-of-words => 026-sequence-of-words}/app.py (100%) rename exercises/{27-sequence-of-words => 026-sequence-of-words}/solution.hide.py (100%) create mode 100644 exercises/027-sequence-of-lines/README.es.md create mode 100644 exercises/027-sequence-of-lines/README.md rename exercises/{28-sequence-of-lines => 027-sequence-of-lines}/app.py (100%) rename exercises/{28-sequence-of-lines => 027-sequence-of-lines}/solution.hide.py (100%) create mode 100644 exercises/028-remove-duplicate-words/README.es.md create mode 100644 exercises/028-remove-duplicate-words/README.md rename exercises/{29-remove-duplicate-words => 028-remove-duplicate-words}/app.py (100%) rename exercises/{29-remove-duplicate-words => 028-remove-duplicate-words}/solution.hide.py (100%) create mode 100644 exercises/029-divisable-binary/README.md rename exercises/{30-divisable-binary => 029-divisable-binary}/app.py (100%) rename exercises/{30-divisable-binary => 029-divisable-binary}/solution.hide.py (100%) rename exercises/{31-sum-eigth-digit => 030-sum-eigth-digit}/README.md (100%) rename exercises/{31-sum-eigth-digit => 030-sum-eigth-digit}/app.py (100%) rename exercises/{31-sum-eigth-digit => 030-sum-eigth-digit}/solution.hide.py (100%) delete mode 100644 exercises/22-Integral/README.es.md delete mode 100644 exercises/22-Integral/README.md delete mode 100644 exercises/23-list-and-tuple/README.es.md delete mode 100644 exercises/23-list-and-tuple/README.md delete mode 100644 exercises/24-class-with-two-methods/README.es.md delete mode 100644 exercises/24-class-with-two-methods/README.md delete mode 100644 exercises/24-class-with-two-methods/solution.hide.py delete mode 100644 exercises/25-print-formula/README.es.md delete mode 100644 exercises/25-print-formula/README.md delete mode 100644 exercises/26-two-dimensional-array/README.es.md delete mode 100644 exercises/26-two-dimensional-array/README.md delete mode 100644 exercises/27-sequence-of-words/README.es.md delete mode 100644 exercises/27-sequence-of-words/README.md delete mode 100644 exercises/28-sequence-of-lines/README.es.md delete mode 100644 exercises/28-sequence-of-lines/README.md delete mode 100644 exercises/29-remove-duplicate-words/README.es.md delete mode 100644 exercises/29-remove-duplicate-words/README.md delete mode 100644 exercises/30-divisable-binary/README.md diff --git a/exercises/021-integral/README.es.md b/exercises/021-integral/README.es.md new file mode 100644 index 00000000..a9e3bfa1 --- /dev/null +++ b/exercises/021-integral/README.es.md @@ -0,0 +1,19 @@ +# `021` integral + +1. Dado un número integral `n`, escribe un programa para generar un diccionario que contenga `(i, i*i)` como un número entero entre 1 y n (ambos incluidos). + +2. Luego el programa debe imprimir el diccionario. + +## Ejemplo de entrada: + ++ 8 + +## Ejemplo de salida: + ++ {1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64} + +## 💡 Pistas: + ++ En el caso de que se le pasen datos a la cuestión, deben asumirse como entradas de la consola. + ++ Considera usar `dict()`. diff --git a/exercises/021-integral/README.md b/exercises/021-integral/README.md new file mode 100644 index 00000000..c99207da --- /dev/null +++ b/exercises/021-integral/README.md @@ -0,0 +1,19 @@ +# `021` Integral + +1. With a given integral number `n`, write a program to generate a dictionary that contains `(i, i*i)` that is an integral number between 1 and n (both included). + +2. Then the program should print the dictionary. + +## Example input: + ++ 8 + +## Example output: + ++ {1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64} + +## 💡 Hints: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. + ++ Consider use `dict()` \ No newline at end of file diff --git a/exercises/22-Integral/app.py b/exercises/021-integral/app.py similarity index 100% rename from exercises/22-Integral/app.py rename to exercises/021-integral/app.py diff --git a/exercises/22-Integral/solution.hide.py b/exercises/021-integral/solution.hide.py similarity index 100% rename from exercises/22-Integral/solution.hide.py rename to exercises/021-integral/solution.hide.py diff --git a/exercises/022-list-and-tuple/README.es.md b/exercises/022-list-and-tuple/README.es.md new file mode 100644 index 00000000..ef7007d9 --- /dev/null +++ b/exercises/022-list-and-tuple/README.es.md @@ -0,0 +1,18 @@ +# `022` list and tuple + +1. Escribe un programa que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. + +## Ejemplo de entrada: + ++ 34,67,55,33,12,98 + +## Ejemplo de salida: + ++ ['34', '67', '55', '33', '12', '98'] + ('34', '67', '55', '33', '12', '98') + +## 💡 Pistas: + ++ En el caso de que se le pasen entradas de datos a la cuestión, deben asumirse como entradas de la consola. + ++ Usa el método `tuple()` para convertir la lista en una tupla. diff --git a/exercises/022-list-and-tuple/README.md b/exercises/022-list-and-tuple/README.md new file mode 100644 index 00000000..68b9ae1f --- /dev/null +++ b/exercises/022-list-and-tuple/README.md @@ -0,0 +1,18 @@ +# `022` list and tuple + +1. Write a program which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. + +## Example input: + ++ 34,67,55,33,12,98 + +## Example output: + ++ ['34', '67', '55', '33', '12', '98'] + ('34', '67', '55', '33', '12', '98') + +## 💡 Hints: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. + ++ `tuple()` method may be used to convert the list into a tuple \ No newline at end of file diff --git a/exercises/23-list-and-tuple/app.py b/exercises/022-list-and-tuple/app.py similarity index 100% rename from exercises/23-list-and-tuple/app.py rename to exercises/022-list-and-tuple/app.py diff --git a/exercises/23-list-and-tuple/solution.hide.py b/exercises/022-list-and-tuple/solution.hide.py similarity index 100% rename from exercises/23-list-and-tuple/solution.hide.py rename to exercises/022-list-and-tuple/solution.hide.py diff --git a/exercises/023-class-with-two-methods/README.es.md b/exercises/023-class-with-two-methods/README.es.md new file mode 100644 index 00000000..c3a81478 --- /dev/null +++ b/exercises/023-class-with-two-methods/README.es.md @@ -0,0 +1,13 @@ +# `023` class with two methods + +1. Define una clase que tenga al menos dos métodos: + +- `get_string`: obtener un string desde la entrada de la consola. + +- `print_string`: imprimir el string en mayúscula. + +2. Por favor incluye una función de prueba simple para probar los métodos de la clase. + +## 💡 Pistas: + ++ Usa el método __init__ para construir algunos parámetros. \ No newline at end of file diff --git a/exercises/023-class-with-two-methods/README.md b/exercises/023-class-with-two-methods/README.md new file mode 100644 index 00000000..78d6e3d5 --- /dev/null +++ b/exercises/023-class-with-two-methods/README.md @@ -0,0 +1,13 @@ +# `24` class with two methods + +1. Define a class which has at least two methods: + +- `get_string`: to get a string from console input + +- `print_string`: to print the string in upper case. + +2. Please include simple test function to test the class methods. + +## 💡 Hint: + ++ Use __init__ method to construct some parameters \ No newline at end of file diff --git a/exercises/24-class-with-two-methods/app.py b/exercises/023-class-with-two-methods/app.py similarity index 100% rename from exercises/24-class-with-two-methods/app.py rename to exercises/023-class-with-two-methods/app.py diff --git a/exercises/023-class-with-two-methods/solution.hide.py b/exercises/023-class-with-two-methods/solution.hide.py new file mode 100644 index 00000000..bda4169b --- /dev/null +++ b/exercises/023-class-with-two-methods/solution.hide.py @@ -0,0 +1,13 @@ +class input_out_string(object): + def __init__(self): + self.s = "" + + def get_String(self): + self.s = raw_input() + + def print_String(self): + print self.s.upper() + +str_obj = input_out_string() +str_obj.get_string() +str_obj.print_String() \ No newline at end of file diff --git a/exercises/024-print-formula/README.es.md b/exercises/024-print-formula/README.es.md new file mode 100644 index 00000000..b51dd155 --- /dev/null +++ b/exercises/024-print-formula/README.es.md @@ -0,0 +1,18 @@ +# `024` print_formula + +1. Escribe un programa que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. EL valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores debiesen ser ingresados en tu programa en una secuencia separada por una coma (,). + +## Ejemplo de entrada: + ++ 100,150,180 + +## Ejemplo de salida_ + ++ 18,22,24 + +## 💡 Pistas: + ++ Si el resultado retornado es un decimal, debería rendondearse a su valor más cercano (por ejemplo, si el resultado es `26.0`, debería imprimirse como `26`) + ++ En el caso de que se le hayan entregado datos a la cuestión, deben asumirse como una entrada de la consola. + \ No newline at end of file diff --git a/exercises/024-print-formula/README.md b/exercises/024-print-formula/README.md new file mode 100644 index 00000000..f541dba5 --- /dev/null +++ b/exercises/024-print-formula/README.md @@ -0,0 +1,17 @@ +# `024` Print formula + +1. Write a program that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. + +## Example input: + ++ 100,150,180 + +## Example output: + ++ 18,22,24 + +## 💡 Hints: + ++ If the output received is in decimal form, it should be rounded off to its nearest value (for example, if the output received is `26.0`, it should be printed as `26`). + ++ In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/25-print-formula/app.py b/exercises/024-print-formula/app.py similarity index 100% rename from exercises/25-print-formula/app.py rename to exercises/024-print-formula/app.py diff --git a/exercises/25-print-formula/solution.hide.py b/exercises/024-print-formula/solution.hide.py similarity index 100% rename from exercises/25-print-formula/solution.hide.py rename to exercises/024-print-formula/solution.hide.py diff --git a/exercises/025-two-dimensional-array/README.es.md b/exercises/025-two-dimensional-array/README.es.md new file mode 100644 index 00000000..2c9fadbf --- /dev/null +++ b/exercises/025-two-dimensional-array/README.es.md @@ -0,0 +1,18 @@ +# `025` two dimensional array + +1. Escribe un programa que reciba dos dígitos `X,Y` como entrada y retorne un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debe ser `i*j`. + +## Example input: + ++ 3,5 + +## Example output: + ++ [[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] + + ## 💡 Pistas: + ++ i = 0,1.., X-1; j = 0,1, ­Y-1. + ++ En el caso de que se le entreguen datos a la cuestión, debe asumirse como una entrada de la consola en un formulario separado por comas. + diff --git a/exercises/025-two-dimensional-array/README.md b/exercises/025-two-dimensional-array/README.md new file mode 100644 index 00000000..42a33864 --- /dev/null +++ b/exercises/025-two-dimensional-array/README.md @@ -0,0 +1,17 @@ +# `025` two dimensional array + +1. Write a program which takes 2 digits, X,Y as input and generates a 2-dimensional array. The element value in the i-th row and j-th column of the array should be `i*j`. + +## Example input: + ++ 3,5 + +## Example: + ++ [[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] + +## 💡 Hints: + ++ i = 0,1.., X-1; j= 0,1, Y-1. + ++ In case of input data being supplied to the question, it should be assumed to be a console input in a comma-separated form. \ No newline at end of file diff --git a/exercises/26-two-dimensional-array/app.py b/exercises/025-two-dimensional-array/app.py similarity index 100% rename from exercises/26-two-dimensional-array/app.py rename to exercises/025-two-dimensional-array/app.py diff --git a/exercises/26-two-dimensional-array/solution.hide.py b/exercises/025-two-dimensional-array/solution.hide.py similarity index 100% rename from exercises/26-two-dimensional-array/solution.hide.py rename to exercises/025-two-dimensional-array/solution.hide.py diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence-of-words/README.es.md new file mode 100644 index 00000000..444b8b47 --- /dev/null +++ b/exercises/026-sequence-of-words/README.es.md @@ -0,0 +1,15 @@ +# `026` sequence of words + +1. Escribe un programa que reciba una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. + +## Ejemplo de entrada: + ++ without,hello,bag,world + +## Ejemplo de salida: + ++ bag,hello,without,world + +## 💡 Pistas: + ++ En el caso de que se le pasen datos a la cuestión, deben considerarse como entradas de la consola. diff --git a/exercises/026-sequence-of-words/README.md b/exercises/026-sequence-of-words/README.md new file mode 100644 index 00000000..08437d6a --- /dev/null +++ b/exercises/026-sequence-of-words/README.md @@ -0,0 +1,15 @@ +# `026` sequence of words + +1. Write a program that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. + +## Example input: + ++ without,hello,bag,world + +## Example output: + +bag,hello,without,world + +## 💡 Hints: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/27-sequence-of-words/app.py b/exercises/026-sequence-of-words/app.py similarity index 100% rename from exercises/27-sequence-of-words/app.py rename to exercises/026-sequence-of-words/app.py diff --git a/exercises/27-sequence-of-words/solution.hide.py b/exercises/026-sequence-of-words/solution.hide.py similarity index 100% rename from exercises/27-sequence-of-words/solution.hide.py rename to exercises/026-sequence-of-words/solution.hide.py diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence-of-lines/README.es.md new file mode 100644 index 00000000..aef61f9c --- /dev/null +++ b/exercises/027-sequence-of-lines/README.es.md @@ -0,0 +1,23 @@ +# `28` sequence of lines + +1. Escribe un programa que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. + +## Ejemplo de entrada 1: + ++ Hello world + +## Ejemplo de salida 1: + ++ HELLO WORLD + +## Ejemplo de entrada 2: + ++ Practice makes perfect + +## Ejemplo de salida: + ++ PRACTICE MAKES PERFECT + +## 💡 Pista: + ++ En caso de que se le pasen entradas de datos a la cuestión, deben asumirse como entradas de la consola. diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence-of-lines/README.md new file mode 100644 index 00000000..b3833cfd --- /dev/null +++ b/exercises/027-sequence-of-lines/README.md @@ -0,0 +1,25 @@ +# `027` Sequence of lines + +1. Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. + +## Example input 1: + ++ Hello world + +## Example output 1: + ++ HELLO WORLD + +## Example input 2: + ++ Practice makes perfect + +## Example output 2: + ++ PRACTICE MAKES PERFECT + + +## 💡 Hint: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. + diff --git a/exercises/28-sequence-of-lines/app.py b/exercises/027-sequence-of-lines/app.py similarity index 100% rename from exercises/28-sequence-of-lines/app.py rename to exercises/027-sequence-of-lines/app.py diff --git a/exercises/28-sequence-of-lines/solution.hide.py b/exercises/027-sequence-of-lines/solution.hide.py similarity index 100% rename from exercises/28-sequence-of-lines/solution.hide.py rename to exercises/027-sequence-of-lines/solution.hide.py diff --git a/exercises/028-remove-duplicate-words/README.es.md b/exercises/028-remove-duplicate-words/README.es.md new file mode 100644 index 00000000..58e81ade --- /dev/null +++ b/exercises/028-remove-duplicate-words/README.es.md @@ -0,0 +1,19 @@ +# `028` remove duplicate words + +1. Escribe un programa que reciba una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. + +## Ejemplo de entrada: + ++ hello world and practice makes perfect and hello world again + +## Ejemplo de salida: + ++ again and hello makes perfect practice world + +## 💡 Pistas: + ++ En caso de que se le entregue entradas de datos a la pregunta, debe asumirse como entrada de la consola. + ++ Usa `set container` para eliminar los datos duplicados automáticamente y luego usa sorted() para ordenar los datos. + + diff --git a/exercises/028-remove-duplicate-words/README.md b/exercises/028-remove-duplicate-words/README.md new file mode 100644 index 00000000..c917c9dd --- /dev/null +++ b/exercises/028-remove-duplicate-words/README.md @@ -0,0 +1,18 @@ +# `028` remove duplicate words + +1. Write a program that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. + +## Example input: + ++ hello world and practice makes perfect and hello world again + +## Example output: + ++ again and hello makes perfect practice world + +## 💡 Hints: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. + ++ We use set container to remove duplicated data automatically and then use sorted() to sort the data. + diff --git a/exercises/29-remove-duplicate-words/app.py b/exercises/028-remove-duplicate-words/app.py similarity index 100% rename from exercises/29-remove-duplicate-words/app.py rename to exercises/028-remove-duplicate-words/app.py diff --git a/exercises/29-remove-duplicate-words/solution.hide.py b/exercises/028-remove-duplicate-words/solution.hide.py similarity index 100% rename from exercises/29-remove-duplicate-words/solution.hide.py rename to exercises/028-remove-duplicate-words/solution.hide.py diff --git a/exercises/029-divisable-binary/README.md b/exercises/029-divisable-binary/README.md new file mode 100644 index 00000000..0b105e57 --- /dev/null +++ b/exercises/029-divisable-binary/README.md @@ -0,0 +1,16 @@ +# `029` divisable binary + +1. Write a program which accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. + +## Example input: + ++ 0100,0011,1010,1001 + +## Example output: + ++ 1010 + + Assume the data is input by console. + +Hints: +In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/30-divisable-binary/app.py b/exercises/029-divisable-binary/app.py similarity index 100% rename from exercises/30-divisable-binary/app.py rename to exercises/029-divisable-binary/app.py diff --git a/exercises/30-divisable-binary/solution.hide.py b/exercises/029-divisable-binary/solution.hide.py similarity index 100% rename from exercises/30-divisable-binary/solution.hide.py rename to exercises/029-divisable-binary/solution.hide.py diff --git a/exercises/31-sum-eigth-digit/README.md b/exercises/030-sum-eigth-digit/README.md similarity index 100% rename from exercises/31-sum-eigth-digit/README.md rename to exercises/030-sum-eigth-digit/README.md diff --git a/exercises/31-sum-eigth-digit/app.py b/exercises/030-sum-eigth-digit/app.py similarity index 100% rename from exercises/31-sum-eigth-digit/app.py rename to exercises/030-sum-eigth-digit/app.py diff --git a/exercises/31-sum-eigth-digit/solution.hide.py b/exercises/030-sum-eigth-digit/solution.hide.py similarity index 100% rename from exercises/31-sum-eigth-digit/solution.hide.py rename to exercises/030-sum-eigth-digit/solution.hide.py diff --git a/exercises/22-Integral/README.es.md b/exercises/22-Integral/README.es.md deleted file mode 100644 index 5172b806..00000000 --- a/exercises/22-Integral/README.es.md +++ /dev/null @@ -1,11 +0,0 @@ -# `22` Integral - -Dado un número integral n, escribe un programa para generar un diccionario que contenga (i, i*i) como un número integrak entre 1 y n (ambos incluidos). Luego el programa debiese imprimir el diccionario. -Supongamos que se le entrega la siguiente entrada al programa: -8 -El resultado debiese ser: -{1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64} - -Pistas: -En el caso de que se le entreguen datos a la pregunta, deben asumirse como entradas de la consola. -Considera usar dict() diff --git a/exercises/22-Integral/README.md b/exercises/22-Integral/README.md deleted file mode 100644 index 515fbf6a..00000000 --- a/exercises/22-Integral/README.md +++ /dev/null @@ -1,11 +0,0 @@ -# `22` Integral - -With a given integral number n, write a program to generate a dictionary that contains (i, i*i) such that is an integral number between 1 and n (both included). Then the program should print the dictionary. -Suppose the following input is supplied to the program: -8 -Then, the output should be: -{1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64} - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. -Consider use dict() \ No newline at end of file diff --git a/exercises/23-list-and-tuple/README.es.md b/exercises/23-list-and-tuple/README.es.md deleted file mode 100644 index 3b9313cb..00000000 --- a/exercises/23-list-and-tuple/README.es.md +++ /dev/null @@ -1,12 +0,0 @@ -# `23` Lista y tupla - -Escribe un programa que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. -Supongamos que se le entrega la siguiente entrada al programa: -34,67,55,33,12,98 -El resultado debiese ser: -['34', '67', '55', '33', '12', '98'] -('34', '67', '55', '33', '12', '98') - -Pistas: -En el caso de que se le entreguen entradas de datos a la pregunta, deben asumirse como entradas de la consola. -Usa el método tuple() para convertir la lista en una tupla. diff --git a/exercises/23-list-and-tuple/README.md b/exercises/23-list-and-tuple/README.md deleted file mode 100644 index 15cbf7b1..00000000 --- a/exercises/23-list-and-tuple/README.md +++ /dev/null @@ -1,12 +0,0 @@ -# `23` List and touple - -Write a program which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. -Suppose the following input is supplied to the program: -34,67,55,33,12,98 -Then, the output should be: -['34', '67', '55', '33', '12', '98'] -('34', '67', '55', '33', '12', '98') - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. -tuple() method can convert list to tuple \ No newline at end of file diff --git a/exercises/24-class-with-two-methods/README.es.md b/exercises/24-class-with-two-methods/README.es.md deleted file mode 100644 index fffb54ba..00000000 --- a/exercises/24-class-with-two-methods/README.es.md +++ /dev/null @@ -1,10 +0,0 @@ -# `24` Una clase con dos métodos - -Define una clase que tenga al menos dos métodos: -Define a class which has at least two methods: -getString: obtener un string desde la entrada de la consola. -printString: imprimir el string en mayúscula. -Por favor incluye una función simple de prueba para probar los métodos de la clase. - -Pistas: -Usa el método __init__ para construir algunos parámetros. \ No newline at end of file diff --git a/exercises/24-class-with-two-methods/README.md b/exercises/24-class-with-two-methods/README.md deleted file mode 100644 index 3971f14f..00000000 --- a/exercises/24-class-with-two-methods/README.md +++ /dev/null @@ -1,9 +0,0 @@ -# `24` Class with two methods - -Define a class which has at least two methods: -getString: to get a string from console input -printString: to print the string in upper case. -Also please include simple test function to test the class methods. - -Hints: -Use __init__ method to construct some parameters \ No newline at end of file diff --git a/exercises/24-class-with-two-methods/solution.hide.py b/exercises/24-class-with-two-methods/solution.hide.py deleted file mode 100644 index b6917e80..00000000 --- a/exercises/24-class-with-two-methods/solution.hide.py +++ /dev/null @@ -1,13 +0,0 @@ -class InputOutString(object): - def __init__(self): - self.s = "" - - def getString(self): - self.s = raw_input() - - def printString(self): - print self.s.upper() - -strObj = InputOutString() -strObj.getString() -strObj.printString() \ No newline at end of file diff --git a/exercises/25-print-formula/README.es.md b/exercises/25-print-formula/README.es.md deleted file mode 100644 index e38c0d3b..00000000 --- a/exercises/25-print-formula/README.es.md +++ /dev/null @@ -1,19 +0,0 @@ -# `25` Imprime la fórmula - -Escribe un programa que calcule e imprima el valor de acuerdo a la fórmula dada: - -Q = Square root of [(2 * C * D)/H] - -A continuación encontrarás los valores fijos de C y H: -C es 50. H es 30. -D es la variable cuyos valores debiesen ser ingresados en tu -Ejemplo: -Digamos que le sentrega la siguiente secuencia separada por coma al programa: -100,150,180 -El resultado del programa debiese ser: -18,22,24 - -Pistas: -Si el resultado recicido es un decimal, debería rendondearse a su valor más cercano (por ejemplo, si el resultado es 26.0, debiese imprimirse como 26) -En el caso de que se le hayan entregado datos a la cuestión, deben asumirse como una entrada de la consola. - \ No newline at end of file diff --git a/exercises/25-print-formula/README.md b/exercises/25-print-formula/README.md deleted file mode 100644 index b47224b0..00000000 --- a/exercises/25-print-formula/README.md +++ /dev/null @@ -1,17 +0,0 @@ -# `25` Print formula - -Write a program that calculates and prints the value according to the given formula: -Q = Square root of [(2 * C * D)/H] - -Following are the fixed values of C and H: -C is 50. H is 30. -D is the variable whose values should be input to your program in a comma-separated sequence. -Example -Let us assume the following comma separated input sequence is given to the program: -100,150,180 -The output of the program should be: -18,22,24 - -Hints: -If the output received is in decimal form, it should be rounded off to its nearest value (for example, if the output received is 26.0, it should be printed as 26) -In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/26-two-dimensional-array/README.es.md b/exercises/26-two-dimensional-array/README.es.md deleted file mode 100644 index b81dd4a6..00000000 --- a/exercises/26-two-dimensional-array/README.es.md +++ /dev/null @@ -1,13 +0,0 @@ -# `26` Array de dos dimensiones - -Escribe un progrsms que reciba dos dígitos X,Y como entrada y genere un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debiese ser i*j. -Nota: i=0,1.., X-1; j=0,1,¡­Y-1. -Ejemplo: -Supongamos que se le entregan lasa siguientes entradas al programa: -3,5 -Entonces, el resultado del programa debería ser: -[[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] - -Pistas: -Nota: En el caso de que se le entreguen datos a la cuestión, debe asumirse como una entrada de la consola en un formulario separado por comas. - diff --git a/exercises/26-two-dimensional-array/README.md b/exercises/26-two-dimensional-array/README.md deleted file mode 100644 index 330f75a5..00000000 --- a/exercises/26-two-dimensional-array/README.md +++ /dev/null @@ -1,12 +0,0 @@ -# `26`Two dimensional array - -Write a program which takes 2 digits, X,Y as input and generates a 2-dimensional array. The element value in the i-th row and j-th column of the array should be i*j. -Note: i=0,1.., X-1; j=0,1,¡­Y-1. -Example -Suppose the following inputs are given to the program: -3,5 -Then, the output of the program should be: -[[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] - -Hints: -Note: In case of input data being supplied to the question, it should be assumed to be a console input in a comma-separated form. \ No newline at end of file diff --git a/exercises/27-sequence-of-words/README.es.md b/exercises/27-sequence-of-words/README.es.md deleted file mode 100644 index 290fdecf..00000000 --- a/exercises/27-sequence-of-words/README.es.md +++ /dev/null @@ -1,10 +0,0 @@ -# `27` Secuencia de palabras - -Escribe un programa que acepte una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. -Supongamos que se le entrega la siguiente entrada al programa: -without,hello,bag,world -El resultado debiese ser: -bag,hello,without,world - -Pistas: -En el caso de que se le entreguen datos a la pregunta, deben considerarse como entradas de la consola. diff --git a/exercises/27-sequence-of-words/README.md b/exercises/27-sequence-of-words/README.md deleted file mode 100644 index be2f8cf0..00000000 --- a/exercises/27-sequence-of-words/README.md +++ /dev/null @@ -1,10 +0,0 @@ -# `27`Sequence of words - -Write a program that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. -Suppose the following input is supplied to the program: -without,hello,bag,world -Then, the output should be: -bag,hello,without,world - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/28-sequence-of-lines/README.es.md b/exercises/28-sequence-of-lines/README.es.md deleted file mode 100644 index 50656af2..00000000 --- a/exercises/28-sequence-of-lines/README.es.md +++ /dev/null @@ -1,13 +0,0 @@ -# `28` Sequence of lines - -Escribe un programa que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. - -Supongamos le entregamos la siguiente entrada al programa: -Hello world -Practice makes perfect -El resultado debería ser este: -HELLO WORLD -PRACTICE MAKES PERFECT - -Pistas: -En caso de que se le pasen entradas de datos a la pregunta, deben asumirse como entradas de la consola. diff --git a/exercises/28-sequence-of-lines/README.md b/exercises/28-sequence-of-lines/README.md deleted file mode 100644 index 1efba3f5..00000000 --- a/exercises/28-sequence-of-lines/README.md +++ /dev/null @@ -1,14 +0,0 @@ -# `28` Sequence of lines - -Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. -Suppose the following input is supplied to the program: -Hello world -Practice makes perfect -Then, the output should be: -HELLO WORLD -PRACTICE MAKES PERFECT - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. - -Solution: diff --git a/exercises/29-remove-duplicate-words/README.es.md b/exercises/29-remove-duplicate-words/README.es.md deleted file mode 100644 index 2683b9a2..00000000 --- a/exercises/29-remove-duplicate-words/README.es.md +++ /dev/null @@ -1,18 +0,0 @@ -# `29`Eliminar los duplicados - -Escribe un programa que acepte una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. - -Supongamos que se le entrega la siguiente entrada al programa: - -hello world and practice makes perfect and hello world again - -El resultado debería ser: - -again and hello makes perfect practice world - -Pistas: -En caso de que se le entregue entradas de datos a la pregunta, debe asumirse como entrada de la consola. - -Usa set container para eliminar los datos duplicados automáticamente y luego usa sorted() para ordenar los datos. - - diff --git a/exercises/29-remove-duplicate-words/README.md b/exercises/29-remove-duplicate-words/README.md deleted file mode 100644 index 3909c46a..00000000 --- a/exercises/29-remove-duplicate-words/README.md +++ /dev/null @@ -1,12 +0,0 @@ -# `29` Remove duplicate words - -Write a program that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. -Suppose the following input is supplied to the program: -hello world and practice makes perfect and hello world again -Then, the output should be: -again and hello makes perfect practice world - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. -We use set container to remove duplicated data automatically and then use sorted() to sort the data. - diff --git a/exercises/30-divisable-binary/README.md b/exercises/30-divisable-binary/README.md deleted file mode 100644 index 66c6463a..00000000 --- a/exercises/30-divisable-binary/README.md +++ /dev/null @@ -1,9 +0,0 @@ -Write a program which accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. -Example: -0100,0011,1010,1001 -Then the output should be: -1010 -Notes: Assume the data is input by console. - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file From 3e0aa80b27278357151be48afbbc66222f5042fb Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Thu, 24 Feb 2022 17:46:40 +0000 Subject: [PATCH 02/20] https://github.com/learnpack/learnpack/issues/722 --- exercises/021-integral/README.md | 2 +- exercises/024-print-formula/README.md | 2 +- exercises/027-sequence-of-lines/README.es.md | 2 +- exercises/027-sequence-of-lines/README.md | 3 +-- exercises/029-divisable-binary/README.es.md | 17 +++++++++++++++++ exercises/029-divisable-binary/README.md | 7 ++++--- exercises/030-sum-eigth-digit/README.md | 7 ------- exercises/030-sum-eigth-digits/README.es.md | 7 +++++++ exercises/030-sum-eigth-digits/README.md | 9 +++++++++ .../app.py | 0 .../solution.hide.py | 0 11 files changed, 41 insertions(+), 15 deletions(-) create mode 100644 exercises/029-divisable-binary/README.es.md delete mode 100644 exercises/030-sum-eigth-digit/README.md create mode 100644 exercises/030-sum-eigth-digits/README.es.md create mode 100644 exercises/030-sum-eigth-digits/README.md rename exercises/{030-sum-eigth-digit => 030-sum-eigth-digits}/app.py (100%) rename exercises/{030-sum-eigth-digit => 030-sum-eigth-digits}/solution.hide.py (100%) diff --git a/exercises/021-integral/README.md b/exercises/021-integral/README.md index c99207da..809de48d 100644 --- a/exercises/021-integral/README.md +++ b/exercises/021-integral/README.md @@ -1,4 +1,4 @@ -# `021` Integral +# `021` integral 1. With a given integral number `n`, write a program to generate a dictionary that contains `(i, i*i)` that is an integral number between 1 and n (both included). diff --git a/exercises/024-print-formula/README.md b/exercises/024-print-formula/README.md index f541dba5..f41d416e 100644 --- a/exercises/024-print-formula/README.md +++ b/exercises/024-print-formula/README.md @@ -1,4 +1,4 @@ -# `024` Print formula +# `024` print formula 1. Write a program that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence-of-lines/README.es.md index aef61f9c..dbb101b6 100644 --- a/exercises/027-sequence-of-lines/README.es.md +++ b/exercises/027-sequence-of-lines/README.es.md @@ -1,4 +1,4 @@ -# `28` sequence of lines +# `027` sequence of lines 1. Escribe un programa que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence-of-lines/README.md index b3833cfd..3a57f7da 100644 --- a/exercises/027-sequence-of-lines/README.md +++ b/exercises/027-sequence-of-lines/README.md @@ -1,4 +1,4 @@ -# `027` Sequence of lines +# `027` sequence of lines 1. Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. @@ -18,7 +18,6 @@ + PRACTICE MAKES PERFECT - ## 💡 Hint: + In case of input data being supplied to the question, it should be assumed to be a console input. diff --git a/exercises/029-divisable-binary/README.es.md b/exercises/029-divisable-binary/README.es.md new file mode 100644 index 00000000..da3a3aec --- /dev/null +++ b/exercises/029-divisable-binary/README.es.md @@ -0,0 +1,17 @@ +# `029` divisable binary + +1. Escribe un programa que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. + +## Ejemplo de entrada: + ++ 0100,0011,1010,1001 + +## Ejemplo de salida: + ++ 1010 + +## 💡 Pistas: + ++ Supón que los datos se ingresan por la consola. + ++ En caso de que se proporcionen datos de entrada a la cuestión, se debe suponer que se trata de una entrada de consola. \ No newline at end of file diff --git a/exercises/029-divisable-binary/README.md b/exercises/029-divisable-binary/README.md index 0b105e57..ad616355 100644 --- a/exercises/029-divisable-binary/README.md +++ b/exercises/029-divisable-binary/README.md @@ -10,7 +10,8 @@ + 1010 - Assume the data is input by console. +## 💡 Hints: -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file ++ Assume the data is input by console. + ++ In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file diff --git a/exercises/030-sum-eigth-digit/README.md b/exercises/030-sum-eigth-digit/README.md deleted file mode 100644 index c89832cb..00000000 --- a/exercises/030-sum-eigth-digit/README.md +++ /dev/null @@ -1,7 +0,0 @@ -Write a program, which will find all such numbers between 1000 and 3000 (both included) such that each digit of the number is an even number. -The numbers obtained should be printed in a comma-separated sequence on a single line. - -Hints: -In case of input data being supplied to the question, it should be assumed to be a console input. - -Solution: diff --git a/exercises/030-sum-eigth-digits/README.es.md b/exercises/030-sum-eigth-digits/README.es.md new file mode 100644 index 00000000..544c5c30 --- /dev/null +++ b/exercises/030-sum-eigth-digits/README.es.md @@ -0,0 +1,7 @@ +# `030` sum eight digits + +1. Escribe un programa que encuentre todos los números entre 1000 y 3000 (ambos incluidos) en los cuales cada dígito del número sea un número par. *Los números obtenidos deben imprimirse en una secuencia separada por comas en una sola línea.* + +## 💡 Hint: + ++ En caso de que se proporcionen datos de entrada a la pregunta, se debe suponer que se trata de una entrada de consola. diff --git a/exercises/030-sum-eigth-digits/README.md b/exercises/030-sum-eigth-digits/README.md new file mode 100644 index 00000000..bf4d0ae8 --- /dev/null +++ b/exercises/030-sum-eigth-digits/README.md @@ -0,0 +1,9 @@ +# `030` sum eight digits + +1. Write a program, which will find all such numbers between 1000 and 3000 (both included) such that each digit of the number is an even number. *The numbers obtained should be printed in a comma-separated sequence on a single line.* + +## 💡 Hint: + ++ In case of input data being supplied to the question, it should be assumed to be a console input. + + diff --git a/exercises/030-sum-eigth-digit/app.py b/exercises/030-sum-eigth-digits/app.py similarity index 100% rename from exercises/030-sum-eigth-digit/app.py rename to exercises/030-sum-eigth-digits/app.py diff --git a/exercises/030-sum-eigth-digit/solution.hide.py b/exercises/030-sum-eigth-digits/solution.hide.py similarity index 100% rename from exercises/030-sum-eigth-digit/solution.hide.py rename to exercises/030-sum-eigth-digits/solution.hide.py From 0e1ace123aeb3e096fc39e3093fb35d7f17a1d09 Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Fri, 25 Feb 2022 21:41:41 +0000 Subject: [PATCH 03/20] https://github.com/4GeeksAcademy/master-python-programming-exercises/pull/34 --- exercises/021-integral/README.es.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/exercises/021-integral/README.es.md b/exercises/021-integral/README.es.md index a9e3bfa1..456cc918 100644 --- a/exercises/021-integral/README.es.md +++ b/exercises/021-integral/README.es.md @@ -1,5 +1,7 @@ # `021` integral +## 📝 Instrucciones: + 1. Dado un número integral `n`, escribe un programa para generar un diccionario que contenga `(i, i*i)` como un número entero entre 1 y n (ambos incluidos). 2. Luego el programa debe imprimir el diccionario. From 4eab43f00b22c50e719c49e9eb402aa99c3b921c Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Fri, 25 Feb 2022 21:42:02 +0000 Subject: [PATCH 04/20] https://github.com/4GeeksAcademy/master-python-programming-exercises/pull/34 --- exercises/021-integral/README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/exercises/021-integral/README.md b/exercises/021-integral/README.md index 809de48d..56f41c9c 100644 --- a/exercises/021-integral/README.md +++ b/exercises/021-integral/README.md @@ -1,5 +1,7 @@ # `021` integral +## 📝 Instructions: + 1. With a given integral number `n`, write a program to generate a dictionary that contains `(i, i*i)` that is an integral number between 1 and n (both included). 2. Then the program should print the dictionary. From 9070668ae97d02a6ae08fb05a43c68baee31a807 Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Fri, 25 Feb 2022 21:42:42 +0000 Subject: [PATCH 05/20] https://github.com/learnpack/learnpack/issues/722 --- exercises/022-list-and-tuple/README.es.md | 2 ++ exercises/022-list-and-tuple/README.md | 2 ++ exercises/023-class-with-two-methods/README.es.md | 2 ++ exercises/023-class-with-two-methods/README.md | 2 ++ exercises/024-print-formula/README.es.md | 2 ++ exercises/024-print-formula/README.md | 2 ++ exercises/025-two-dimensional-array/README.es.md | 2 ++ exercises/025-two-dimensional-array/README.md | 2 ++ exercises/026-sequence-of-words/README.es.md | 2 ++ exercises/026-sequence-of-words/README.md | 2 ++ exercises/027-sequence-of-lines/README.es.md | 2 ++ exercises/027-sequence-of-lines/README.md | 2 ++ exercises/028-remove-duplicate-words/README.es.md | 2 ++ exercises/028-remove-duplicate-words/README.md | 2 ++ exercises/029-divisable-binary/README.es.md | 2 ++ exercises/029-divisable-binary/README.md | 2 ++ exercises/030-sum-eigth-digits/README.es.md | 2 ++ exercises/030-sum-eigth-digits/README.md | 2 ++ 18 files changed, 36 insertions(+) diff --git a/exercises/022-list-and-tuple/README.es.md b/exercises/022-list-and-tuple/README.es.md index ef7007d9..6281f07f 100644 --- a/exercises/022-list-and-tuple/README.es.md +++ b/exercises/022-list-and-tuple/README.es.md @@ -1,5 +1,7 @@ # `022` list and tuple +## 📝 Instrucciones: + 1. Escribe un programa que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. ## Ejemplo de entrada: diff --git a/exercises/022-list-and-tuple/README.md b/exercises/022-list-and-tuple/README.md index 68b9ae1f..42d6380e 100644 --- a/exercises/022-list-and-tuple/README.md +++ b/exercises/022-list-and-tuple/README.md @@ -1,5 +1,7 @@ # `022` list and tuple +## 📝 Instructions: + 1. Write a program which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. ## Example input: diff --git a/exercises/023-class-with-two-methods/README.es.md b/exercises/023-class-with-two-methods/README.es.md index c3a81478..f9050a61 100644 --- a/exercises/023-class-with-two-methods/README.es.md +++ b/exercises/023-class-with-two-methods/README.es.md @@ -1,5 +1,7 @@ # `023` class with two methods +## 📝 Instrucciones: + 1. Define una clase que tenga al menos dos métodos: - `get_string`: obtener un string desde la entrada de la consola. diff --git a/exercises/023-class-with-two-methods/README.md b/exercises/023-class-with-two-methods/README.md index 78d6e3d5..4bd03e93 100644 --- a/exercises/023-class-with-two-methods/README.md +++ b/exercises/023-class-with-two-methods/README.md @@ -1,5 +1,7 @@ # `24` class with two methods +## 📝 Instructions: + 1. Define a class which has at least two methods: - `get_string`: to get a string from console input diff --git a/exercises/024-print-formula/README.es.md b/exercises/024-print-formula/README.es.md index b51dd155..e6060abe 100644 --- a/exercises/024-print-formula/README.es.md +++ b/exercises/024-print-formula/README.es.md @@ -1,5 +1,7 @@ # `024` print_formula +## 📝 Instrucciones: + 1. Escribe un programa que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. EL valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores debiesen ser ingresados en tu programa en una secuencia separada por una coma (,). ## Ejemplo de entrada: diff --git a/exercises/024-print-formula/README.md b/exercises/024-print-formula/README.md index f41d416e..ea6ffe8b 100644 --- a/exercises/024-print-formula/README.md +++ b/exercises/024-print-formula/README.md @@ -1,5 +1,7 @@ # `024` print formula +## 📝 Instructions: + 1. Write a program that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. ## Example input: diff --git a/exercises/025-two-dimensional-array/README.es.md b/exercises/025-two-dimensional-array/README.es.md index 2c9fadbf..c02f485e 100644 --- a/exercises/025-two-dimensional-array/README.es.md +++ b/exercises/025-two-dimensional-array/README.es.md @@ -1,5 +1,7 @@ # `025` two dimensional array +## 📝 Instrucciones: + 1. Escribe un programa que reciba dos dígitos `X,Y` como entrada y retorne un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debe ser `i*j`. ## Example input: diff --git a/exercises/025-two-dimensional-array/README.md b/exercises/025-two-dimensional-array/README.md index 42a33864..86e49c32 100644 --- a/exercises/025-two-dimensional-array/README.md +++ b/exercises/025-two-dimensional-array/README.md @@ -1,5 +1,7 @@ # `025` two dimensional array +## 📝 Instructions: + 1. Write a program which takes 2 digits, X,Y as input and generates a 2-dimensional array. The element value in the i-th row and j-th column of the array should be `i*j`. ## Example input: diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence-of-words/README.es.md index 444b8b47..1fa881ca 100644 --- a/exercises/026-sequence-of-words/README.es.md +++ b/exercises/026-sequence-of-words/README.es.md @@ -1,5 +1,7 @@ # `026` sequence of words +## 📝 Instrucciones: + 1. Escribe un programa que reciba una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. ## Ejemplo de entrada: diff --git a/exercises/026-sequence-of-words/README.md b/exercises/026-sequence-of-words/README.md index 08437d6a..7110f89a 100644 --- a/exercises/026-sequence-of-words/README.md +++ b/exercises/026-sequence-of-words/README.md @@ -1,5 +1,7 @@ # `026` sequence of words +## 📝 Instructions: + 1. Write a program that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. ## Example input: diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence-of-lines/README.es.md index dbb101b6..8a07f8f3 100644 --- a/exercises/027-sequence-of-lines/README.es.md +++ b/exercises/027-sequence-of-lines/README.es.md @@ -1,5 +1,7 @@ # `027` sequence of lines +## 📝 Instrucciones: + 1. Escribe un programa que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. ## Ejemplo de entrada 1: diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence-of-lines/README.md index 3a57f7da..236adadc 100644 --- a/exercises/027-sequence-of-lines/README.md +++ b/exercises/027-sequence-of-lines/README.md @@ -1,5 +1,7 @@ # `027` sequence of lines +## 📝 Instructions: + 1. Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. ## Example input 1: diff --git a/exercises/028-remove-duplicate-words/README.es.md b/exercises/028-remove-duplicate-words/README.es.md index 58e81ade..7e1c4627 100644 --- a/exercises/028-remove-duplicate-words/README.es.md +++ b/exercises/028-remove-duplicate-words/README.es.md @@ -1,5 +1,7 @@ # `028` remove duplicate words +## 📝 Instrucciones: + 1. Escribe un programa que reciba una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. ## Ejemplo de entrada: diff --git a/exercises/028-remove-duplicate-words/README.md b/exercises/028-remove-duplicate-words/README.md index c917c9dd..602b333d 100644 --- a/exercises/028-remove-duplicate-words/README.md +++ b/exercises/028-remove-duplicate-words/README.md @@ -1,5 +1,7 @@ # `028` remove duplicate words +## 📝 Instructions: + 1. Write a program that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. ## Example input: diff --git a/exercises/029-divisable-binary/README.es.md b/exercises/029-divisable-binary/README.es.md index da3a3aec..72b1804f 100644 --- a/exercises/029-divisable-binary/README.es.md +++ b/exercises/029-divisable-binary/README.es.md @@ -1,5 +1,7 @@ # `029` divisable binary +## 📝 Instrucciones: + 1. Escribe un programa que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. ## Ejemplo de entrada: diff --git a/exercises/029-divisable-binary/README.md b/exercises/029-divisable-binary/README.md index ad616355..416e1bdb 100644 --- a/exercises/029-divisable-binary/README.md +++ b/exercises/029-divisable-binary/README.md @@ -1,5 +1,7 @@ # `029` divisable binary +## 📝 Instructions: + 1. Write a program which accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. ## Example input: diff --git a/exercises/030-sum-eigth-digits/README.es.md b/exercises/030-sum-eigth-digits/README.es.md index 544c5c30..f0333075 100644 --- a/exercises/030-sum-eigth-digits/README.es.md +++ b/exercises/030-sum-eigth-digits/README.es.md @@ -1,5 +1,7 @@ # `030` sum eight digits +## 📝 Instrucciones: + 1. Escribe un programa que encuentre todos los números entre 1000 y 3000 (ambos incluidos) en los cuales cada dígito del número sea un número par. *Los números obtenidos deben imprimirse en una secuencia separada por comas en una sola línea.* ## 💡 Hint: diff --git a/exercises/030-sum-eigth-digits/README.md b/exercises/030-sum-eigth-digits/README.md index bf4d0ae8..c37d3660 100644 --- a/exercises/030-sum-eigth-digits/README.md +++ b/exercises/030-sum-eigth-digits/README.md @@ -1,5 +1,7 @@ # `030` sum eight digits +## 📝 Instructions: + 1. Write a program, which will find all such numbers between 1000 and 3000 (both included) such that each digit of the number is an even number. *The numbers obtained should be printed in a comma-separated sequence on a single line.* ## 💡 Hint: From 903190c0ba98cdb110075b7d46ea2231e0e4f62e Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Mon, 7 Mar 2022 16:55:33 +0000 Subject: [PATCH 06/20] https://github.com/learnpack/learnpack/issues/722 --- exercises/021-integral/README.es.md | 11 ++++++----- exercises/021-integral/README.md | 8 +++++--- exercises/022-list-and-tuple/README.es.md | 6 ++++-- exercises/022-list-and-tuple/README.md | 6 ++++-- exercises/024-print-formula/README.es.md | 6 ++++-- exercises/024-print-formula/README.md | 6 ++++-- exercises/025-two-dimensional-array/README.es.md | 6 ++++-- exercises/025-two-dimensional-array/README.md | 8 +++++--- exercises/026-sequence-of-words/README.es.md | 7 ++++--- exercises/026-sequence-of-words/README.md | 6 ++++-- exercises/027-sequence-of-lines/README.es.md | 11 +++++++---- exercises/027-sequence-of-lines/README.md | 10 ++++++---- exercises/028-remove-duplicate-words/README.es.md | 6 ++++-- exercises/028-remove-duplicate-words/README.md | 6 ++++-- exercises/029-divisable-binary/README.es.md | 6 ++++-- exercises/029-divisable-binary/README.md | 6 ++++-- exercises/030-sum-eigth-digits/README.es.md | 2 +- exercises/030-sum-eigth-digits/README.md | 2 +- 18 files changed, 75 insertions(+), 44 deletions(-) diff --git a/exercises/021-integral/README.es.md b/exercises/021-integral/README.es.md index 456cc918..71c50241 100644 --- a/exercises/021-integral/README.es.md +++ b/exercises/021-integral/README.es.md @@ -1,15 +1,16 @@ # `021` integral - +ro ## 📝 Instrucciones: -1. Dado un número integral `n`, escribe un programa para generar un diccionario que contenga `(i, i*i)` como un número entero entre 1 y n (ambos incluidos). +1. Dado un número entero `n`, escribe una función `generate_dict()` que genera un diccionario que contiene `(i, i*i)` como un número entero entre 1 y n (ambos incluidos). -2. Luego el programa debe imprimir el diccionario. +2. `generate_dict()` debe luego imprimir el diccionario. ## Ejemplo de entrada: -+ 8 - +```py +generate_dict(8) +``` ## Ejemplo de salida: + {1: 1, 2: 4, 3: 9, 4: 16, 5: 25, 6: 36, 7: 49, 8: 64} diff --git a/exercises/021-integral/README.md b/exercises/021-integral/README.md index 56f41c9c..6b496fac 100644 --- a/exercises/021-integral/README.md +++ b/exercises/021-integral/README.md @@ -2,13 +2,15 @@ ## 📝 Instructions: -1. With a given integral number `n`, write a program to generate a dictionary that contains `(i, i*i)` that is an integral number between 1 and n (both included). +1. With a given integral number `n`, write a function `generate_dict` that generates a dictionary that contains `(i, i*i)` that is an integral number between 1 and n (both included). -2. Then the program should print the dictionary. +2. `generate_dict` should then print the dictionary. ## Example input: -+ 8 +```py +generate_dict(8) +``` ## Example output: diff --git a/exercises/022-list-and-tuple/README.es.md b/exercises/022-list-and-tuple/README.es.md index 6281f07f..909a833a 100644 --- a/exercises/022-list-and-tuple/README.es.md +++ b/exercises/022-list-and-tuple/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. +1. Escribe una función `list_tuple()` que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. ## Ejemplo de entrada: -+ 34,67,55,33,12,98 +```py +list_tuple(34,67,55,33,12,98) +``` ## Ejemplo de salida: diff --git a/exercises/022-list-and-tuple/README.md b/exercises/022-list-and-tuple/README.md index 42d6380e..b4d17b2b 100644 --- a/exercises/022-list-and-tuple/README.md +++ b/exercises/022-list-and-tuple/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. +1. Write a function `list_tuple()` which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. ## Example input: -+ 34,67,55,33,12,98 +```py +list_tuple(34,67,55,33,12,98) +``` ## Example output: diff --git a/exercises/024-print-formula/README.es.md b/exercises/024-print-formula/README.es.md index e6060abe..c32098a9 100644 --- a/exercises/024-print-formula/README.es.md +++ b/exercises/024-print-formula/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. EL valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores debiesen ser ingresados en tu programa en una secuencia separada por una coma (,). +1. Escribe una función `print_formula()` que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. EL valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores debiesen ser ingresados en tu programa en una secuencia separada por una coma (,). ## Ejemplo de entrada: -+ 100,150,180 +```py +print_formula(100,150,180) +``` ## Ejemplo de salida_ diff --git a/exercises/024-print-formula/README.md b/exercises/024-print-formula/README.md index ea6ffe8b..e13b0e6e 100644 --- a/exercises/024-print-formula/README.md +++ b/exercises/024-print-formula/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. +1. Write a function `print_formula()` that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. ## Example input: -+ 100,150,180 +```py +print_formula(100,150,180) +``` ## Example output: diff --git a/exercises/025-two-dimensional-array/README.es.md b/exercises/025-two-dimensional-array/README.es.md index c02f485e..d28a464a 100644 --- a/exercises/025-two-dimensional-array/README.es.md +++ b/exercises/025-two-dimensional-array/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que reciba dos dígitos `X,Y` como entrada y retorne un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debe ser `i*j`. +1. Escribe una función `two_dimensional_array()` que reciba dos dígitos `X,Y` como entrada y retorne un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debe ser `i*j`. ## Example input: -+ 3,5 +```py +two_dimensional_array(3,5) +``` ## Example output: diff --git a/exercises/025-two-dimensional-array/README.md b/exercises/025-two-dimensional-array/README.md index 86e49c32..64d13b65 100644 --- a/exercises/025-two-dimensional-array/README.md +++ b/exercises/025-two-dimensional-array/README.md @@ -2,13 +2,15 @@ ## 📝 Instructions: -1. Write a program which takes 2 digits, X,Y as input and generates a 2-dimensional array. The element value in the i-th row and j-th column of the array should be `i*j`. +1. Create a function `two_dimensional_array()` which takes 2 digits, X,Y as input and generates a 2-dimensional array. The element value in the i-th row and j-th column of the array should be `i*j`. ## Example input: -+ 3,5 +```py +two_dimensional_array(3,5) +``` -## Example: +## Example output: + [[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence-of-words/README.es.md index 1fa881ca..ce7f36f9 100644 --- a/exercises/026-sequence-of-words/README.es.md +++ b/exercises/026-sequence-of-words/README.es.md @@ -2,12 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que reciba una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. +1. Escribe una función `sequence_of_words()`. que reciba una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. ## Ejemplo de entrada: -+ without,hello,bag,world - +```py +sequence_of_words(without,hello,bag,world) +``` ## Ejemplo de salida: + bag,hello,without,world diff --git a/exercises/026-sequence-of-words/README.md b/exercises/026-sequence-of-words/README.md index 7110f89a..228a8f1c 100644 --- a/exercises/026-sequence-of-words/README.md +++ b/exercises/026-sequence-of-words/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. +1. Write a function `sequence_of_words()` that accepts a comma separated sequence of words as input and prints the words in a comma-separated sequence after sorting them alphabetically. ## Example input: -+ without,hello,bag,world +```py +sequence_of_words(without,hello,bag,world) +``` ## Example output: diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence-of-lines/README.es.md index 8a07f8f3..9e031d2d 100644 --- a/exercises/027-sequence-of-lines/README.es.md +++ b/exercises/027-sequence-of-lines/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. +1. Escribe una función `lines()` que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. ## Ejemplo de entrada 1: -+ Hello world +```py +lines(Hello world) +``` ## Ejemplo de salida 1: @@ -14,8 +16,9 @@ ## Ejemplo de entrada 2: -+ Practice makes perfect - +```py +lines(Practice makes perfect) +``` ## Ejemplo de salida: + PRACTICE MAKES PERFECT diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence-of-lines/README.md index 236adadc..5b518a23 100644 --- a/exercises/027-sequence-of-lines/README.md +++ b/exercises/027-sequence-of-lines/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. +1. Write a function `lines()` that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. ## Example input 1: - -+ Hello world + + ```py + lines(Hello world) + ``` ## Example output 1: @@ -14,7 +16,7 @@ ## Example input 2: -+ Practice makes perfect +lines(Practice makes perfect) ## Example output 2: diff --git a/exercises/028-remove-duplicate-words/README.es.md b/exercises/028-remove-duplicate-words/README.es.md index 7e1c4627..2eac800e 100644 --- a/exercises/028-remove-duplicate-words/README.es.md +++ b/exercises/028-remove-duplicate-words/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que reciba una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. +1. Escribe una función `remove_duplicate_words()` que reciba una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. ## Ejemplo de entrada: -+ hello world and practice makes perfect and hello world again +```py +remove_duplicate_words(hello world and practice makes perfect and hello world again) +``` ## Ejemplo de salida: diff --git a/exercises/028-remove-duplicate-words/README.md b/exercises/028-remove-duplicate-words/README.md index 602b333d..432b99b3 100644 --- a/exercises/028-remove-duplicate-words/README.md +++ b/exercises/028-remove-duplicate-words/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. +1. Write a function `remove_duplicate_words()` that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. ## Example input: -+ hello world and practice makes perfect and hello world again +```py +remove_duplicate_words(hello world and practice makes perfect and hello world again) +``` ## Example output: diff --git a/exercises/029-divisable-binary/README.es.md b/exercises/029-divisable-binary/README.es.md index 72b1804f..8283831a 100644 --- a/exercises/029-divisable-binary/README.es.md +++ b/exercises/029-divisable-binary/README.es.md @@ -2,11 +2,13 @@ ## 📝 Instrucciones: -1. Escribe un programa que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. +1. Escribe una función `divisable_binary()` que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. ## Ejemplo de entrada: -+ 0100,0011,1010,1001 +```py +divisable_binary(0100,0011,1010,1001) +``` ## Ejemplo de salida: diff --git a/exercises/029-divisable-binary/README.md b/exercises/029-divisable-binary/README.md index 416e1bdb..dc1edcd9 100644 --- a/exercises/029-divisable-binary/README.md +++ b/exercises/029-divisable-binary/README.md @@ -2,11 +2,13 @@ ## 📝 Instructions: -1. Write a program which accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. +1. Write a function `divisable_binary()` that accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. ## Example input: -+ 0100,0011,1010,1001 +```py +divisable_binary(0100,0011,1010,1001) +``` ## Example output: diff --git a/exercises/030-sum-eigth-digits/README.es.md b/exercises/030-sum-eigth-digits/README.es.md index f0333075..63d44065 100644 --- a/exercises/030-sum-eigth-digits/README.es.md +++ b/exercises/030-sum-eigth-digits/README.es.md @@ -2,7 +2,7 @@ ## 📝 Instrucciones: -1. Escribe un programa que encuentre todos los números entre 1000 y 3000 (ambos incluidos) en los cuales cada dígito del número sea un número par. *Los números obtenidos deben imprimirse en una secuencia separada por comas en una sola línea.* +1. Escribe una función `even_digits()` que encuentre todos los números entre 1000 y 3000 (ambos incluidos) en los cuales cada dígito del número sea un número par. *Los números obtenidos deben imprimirse en una secuencia separada por comas en una sola línea.* ## 💡 Hint: diff --git a/exercises/030-sum-eigth-digits/README.md b/exercises/030-sum-eigth-digits/README.md index c37d3660..83dc757f 100644 --- a/exercises/030-sum-eigth-digits/README.md +++ b/exercises/030-sum-eigth-digits/README.md @@ -2,7 +2,7 @@ ## 📝 Instructions: -1. Write a program, which will find all such numbers between 1000 and 3000 (both included) such that each digit of the number is an even number. *The numbers obtained should be printed in a comma-separated sequence on a single line.* +1. Write a function `even_digits()` which will find all such numbers between 1000 and 3000 (both included) such that each digit of the number is an even number. *The numbers obtained should be printed in a comma-separated sequence on a single line.* ## 💡 Hint: From b1f1426695a4d8888059eead8d268c11d193fa83 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:39:51 -0400 Subject: [PATCH 07/20] Update README.es.md --- exercises/021-integral/README.es.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/021-integral/README.es.md b/exercises/021-integral/README.es.md index 71c50241..803f02b7 100644 --- a/exercises/021-integral/README.es.md +++ b/exercises/021-integral/README.es.md @@ -1,5 +1,5 @@ # `021` integral -ro + ## 📝 Instrucciones: 1. Dado un número entero `n`, escribe una función `generate_dict()` que genera un diccionario que contiene `(i, i*i)` como un número entero entre 1 y n (ambos incluidos). From 967f29e6907b2526a7b89e8a9a2bc90fcca16292 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:42:53 -0400 Subject: [PATCH 08/20] Update README.es.md --- exercises/022-list-and-tuple/README.es.md | 15 +++++++++------ 1 file changed, 9 insertions(+), 6 deletions(-) diff --git a/exercises/022-list-and-tuple/README.es.md b/exercises/022-list-and-tuple/README.es.md index 909a833a..cea3d8df 100644 --- a/exercises/022-list-and-tuple/README.es.md +++ b/exercises/022-list-and-tuple/README.es.md @@ -2,21 +2,24 @@ ## 📝 Instrucciones: -1. Escribe una función `list_tuple()` que acepte una secuencia de números separados por comas desde la consola y genere una lista y una tupla que contenga todos los números. +1. Escribe una función `list_tuple()` que acepte una secuencia de números separados por comas como parámetro en un string y genere una lista y una tupla que contenga todos los números. ## Ejemplo de entrada: ```py -list_tuple(34,67,55,33,12,98) +list_tuple("34,67,55,33,12,98") ``` ## Ejemplo de salida: -+ ['34', '67', '55', '33', '12', '98'] - ('34', '67', '55', '33', '12', '98') +```bash +['34', '67', '55', '33', '12', '98'] +``` +o +```bash +('34', '67', '55', '33', '12', '98') +``` ## 💡 Pistas: -+ En el caso de que se le pasen entradas de datos a la cuestión, deben asumirse como entradas de la consola. - + Usa el método `tuple()` para convertir la lista en una tupla. From eefc253deb16d41eb3d2852e10d70d724094934e Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:44:35 -0400 Subject: [PATCH 09/20] Update README.md --- exercises/022-list-and-tuple/README.md | 17 +++++++++++------ 1 file changed, 11 insertions(+), 6 deletions(-) diff --git a/exercises/022-list-and-tuple/README.md b/exercises/022-list-and-tuple/README.md index b4d17b2b..56d0b5b4 100644 --- a/exercises/022-list-and-tuple/README.md +++ b/exercises/022-list-and-tuple/README.md @@ -2,7 +2,7 @@ ## 📝 Instructions: -1. Write a function `list_tuple()` which accepts a sequence of comma-separated numbers from console and generate a list and a tuple which contains every number. +1. Write a function `list_tuple()` which accepts a sequence of comma-separated numbers in a string as parameter and generate a list or a tuple which contains every number. ## Example input: @@ -12,11 +12,16 @@ list_tuple(34,67,55,33,12,98) ## Example output: -+ ['34', '67', '55', '33', '12', '98'] - ('34', '67', '55', '33', '12', '98') +```bash +['34', '67', '55', '33', '12', '98'] +``` -## 💡 Hints: +or -+ In case of input data being supplied to the question, it should be assumed to be a console input. +```bash +('34', '67', '55', '33', '12', '98') +``` + +## 💡 Hints: -+ `tuple()` method may be used to convert the list into a tuple \ No newline at end of file ++ `tuple()` method may be used to convert the list into a tuple From 30fedf77b6d5c7ee0375930fca26fb83cecb174a Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:46:41 -0400 Subject: [PATCH 10/20] Update README.es.md --- exercises/024-print-formula/README.es.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/exercises/024-print-formula/README.es.md b/exercises/024-print-formula/README.es.md index c32098a9..c77f5c7d 100644 --- a/exercises/024-print-formula/README.es.md +++ b/exercises/024-print-formula/README.es.md @@ -2,7 +2,7 @@ ## 📝 Instrucciones: -1. Escribe una función `print_formula()` que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. EL valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores debiesen ser ingresados en tu programa en una secuencia separada por una coma (,). +1. Escribe una función `print_formula()` que calcule e imprima el valor de acuerdo a la fórmula dada: `Q = Square root of [(2 * C * D)/H]`. El valor fijo de `C` es 50 y el `H` es 30. `D` es la variable cuyos valores deben ser ingresados como parámetros en la función. ## Ejemplo de entrada: @@ -10,7 +10,7 @@ print_formula(100,150,180) ``` -## Ejemplo de salida_ +## Ejemplo de salida: + 18,22,24 @@ -19,4 +19,4 @@ print_formula(100,150,180) + Si el resultado retornado es un decimal, debería rendondearse a su valor más cercano (por ejemplo, si el resultado es `26.0`, debería imprimirse como `26`) + En el caso de que se le hayan entregado datos a la cuestión, deben asumirse como una entrada de la consola. - \ No newline at end of file + From 394275a1046061c116be6cb22c87123520af3bbb Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:47:27 -0400 Subject: [PATCH 11/20] Update README.md --- exercises/024-print-formula/README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/024-print-formula/README.md b/exercises/024-print-formula/README.md index e13b0e6e..d394c829 100644 --- a/exercises/024-print-formula/README.md +++ b/exercises/024-print-formula/README.md @@ -2,7 +2,7 @@ ## 📝 Instructions: -1. Write a function `print_formula()` that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be input to your program in a comma-separated sequence. +1. Write a function `print_formula()` that calculates and prints the value according to the given formula: `Q = Square root of [(2 * C * D)/H]`. The fixed value of `C` is 50 and and the fixed value of `H` is 30. `D` is the variable whose values should be assigned through the parameters. ## Example input: @@ -18,4 +18,4 @@ print_formula(100,150,180) + If the output received is in decimal form, it should be rounded off to its nearest value (for example, if the output received is `26.0`, it should be printed as `26`). -+ In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file ++ In case of input data being supplied to the question, it should be assumed to be a console input. From 20cf96a0d1c5702187a415ba04717c0ed2eb5f38 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:49:13 -0400 Subject: [PATCH 12/20] Update README.es.md --- exercises/025-two-dimensional-array/README.es.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/025-two-dimensional-array/README.es.md b/exercises/025-two-dimensional-array/README.es.md index d28a464a..85407eba 100644 --- a/exercises/025-two-dimensional-array/README.es.md +++ b/exercises/025-two-dimensional-array/README.es.md @@ -4,13 +4,13 @@ 1. Escribe una función `two_dimensional_array()` que reciba dos dígitos `X,Y` como entrada y retorne un array de dos dimensiones. El valor del elemento en la fila i-th y en la columna j-th del array debe ser `i*j`. -## Example input: +## Ejemplo de Entrada: ```py two_dimensional_array(3,5) ``` -## Example output: +## Ejemplo de Salida: + [[0, 0, 0, 0, 0], [0, 1, 2, 3, 4], [0, 2, 4, 6, 8]] From c57204067b72479dc5d4d2ffdba2fa996a6e242e Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:51:35 -0400 Subject: [PATCH 13/20] Update README.es.md --- exercises/026-sequence-of-words/README.es.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence-of-words/README.es.md index ce7f36f9..deaf9557 100644 --- a/exercises/026-sequence-of-words/README.es.md +++ b/exercises/026-sequence-of-words/README.es.md @@ -2,16 +2,16 @@ ## 📝 Instrucciones: -1. Escribe una función `sequence_of_words()`. que reciba una secuencia separada por comas como entrada e imprima las palabras en una secuencia separada por comas después de ordenarlas alfabéticamente. +1. Escribe una función `sequence_of_words()`. que reciba una lista de palabras y las retorne en un string separadas por comas después de ordenarlas alfabéticamente. ## Ejemplo de entrada: ```py -sequence_of_words(without,hello,bag,world) +sequence_of_words("without","hello","bag","world") ``` ## Ejemplo de salida: -+ bag,hello,without,world ++ "bag, hello, without, world" ## 💡 Pistas: From b300f061bda77e4187eb19c8f5d21633c3babf6d Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:52:09 -0400 Subject: [PATCH 14/20] Update README.md --- exercises/026-sequence-of-words/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/exercises/026-sequence-of-words/README.md b/exercises/026-sequence-of-words/README.md index 228a8f1c..9371a102 100644 --- a/exercises/026-sequence-of-words/README.md +++ b/exercises/026-sequence-of-words/README.md @@ -7,13 +7,13 @@ ## Example input: ```py -sequence_of_words(without,hello,bag,world) +sequence_of_words("without", "hello", "bag", "world") ``` ## Example output: -bag,hello,without,world +"bag,hello,without,world" ## 💡 Hints: -+ In case of input data being supplied to the question, it should be assumed to be a console input. \ No newline at end of file ++ In case of input data being supplied to the question, it should be assumed to be a console input. From 4e7ca0d7a547511617e85842d4c658d9406ed9f2 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:52:33 -0400 Subject: [PATCH 15/20] Update README.es.md --- exercises/026-sequence-of-words/README.es.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence-of-words/README.es.md index deaf9557..68e7bba6 100644 --- a/exercises/026-sequence-of-words/README.es.md +++ b/exercises/026-sequence-of-words/README.es.md @@ -11,7 +11,7 @@ sequence_of_words("without","hello","bag","world") ``` ## Ejemplo de salida: -+ "bag, hello, without, world" ++ "bag,hello,without,world" ## 💡 Pistas: From 9c971d3626351e3851f33721b24b236be7dd7860 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:53:43 -0400 Subject: [PATCH 16/20] Update README.es.md --- exercises/027-sequence-of-lines/README.es.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence-of-lines/README.es.md index 9e031d2d..21bec1f5 100644 --- a/exercises/027-sequence-of-lines/README.es.md +++ b/exercises/027-sequence-of-lines/README.es.md @@ -2,26 +2,26 @@ ## 📝 Instrucciones: -1. Escribe una función `lines()` que acepte una secuencia de líneas como entrada y que luego imprima las líneas convirtiendo todos los caracteres en mayúscula. +1. Escribe una función `lines()` que acepte un string como parámetro y convierta todos los caracteres en mayúscula. ## Ejemplo de entrada 1: ```py -lines(Hello world) +lines("Hello world") ``` ## Ejemplo de salida 1: -+ HELLO WORLD ++ "HELLO WORLD" ## Ejemplo de entrada 2: ```py -lines(Practice makes perfect) +lines("Practice makes perfect") ``` ## Ejemplo de salida: -+ PRACTICE MAKES PERFECT ++ "PRACTICE MAKES PERFECT" ## 💡 Pista: From 3e034445edd9f47e2784af7e3b52b9bad7623a27 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:54:58 -0400 Subject: [PATCH 17/20] Update README.md --- exercises/027-sequence-of-lines/README.md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence-of-lines/README.md index 5b518a23..23522a59 100644 --- a/exercises/027-sequence-of-lines/README.md +++ b/exercises/027-sequence-of-lines/README.md @@ -2,25 +2,25 @@ ## 📝 Instructions: -1. Write a function `lines()` that accepts sequence of lines as input and prints the lines after making all characters in the sentence capitalized. +1. Write a function `lines()` that accepts a string as parameter and returns the string after making all the characters in the sentence capitalized. ## Example input 1: ```py - lines(Hello world) + lines("Hello world") ``` ## Example output 1: -+ HELLO WORLD ++ "HELLO WORLD" ## Example input 2: -lines(Practice makes perfect) +lines("Practice makes perfect") ## Example output 2: -+ PRACTICE MAKES PERFECT ++ "PRACTICE MAKES PERFECT" ## 💡 Hint: From 3f3d61a3349bbca98473376ac49244b878f0e037 Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:55:59 -0400 Subject: [PATCH 18/20] Update README.es.md --- exercises/028-remove-duplicate-words/README.es.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/exercises/028-remove-duplicate-words/README.es.md b/exercises/028-remove-duplicate-words/README.es.md index 2eac800e..c2132375 100644 --- a/exercises/028-remove-duplicate-words/README.es.md +++ b/exercises/028-remove-duplicate-words/README.es.md @@ -2,17 +2,17 @@ ## 📝 Instrucciones: -1. Escribe una función `remove_duplicate_words()` que reciba una secuencia de palabras separadas por espacios en blanco como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. +1. Escribe una función `remove_duplicate_words()` que reciba un string como entrada y que imprima luego las palabras eliminando todas las duplicadas y ordenándolas alfanuméricamente. ## Ejemplo de entrada: ```py -remove_duplicate_words(hello world and practice makes perfect and hello world again) +remove_duplicate_words("hello world and practice makes perfect and hello world again") ``` ## Ejemplo de salida: -+ again and hello makes perfect practice world ++ "again and hello makes perfect practice world" ## 💡 Pistas: From 73e73a35b6da90837b53605e6e438b66e0acfeff Mon Sep 17 00:00:00 2001 From: Tomas Gonzalez <56565994+tommygonzaleza@users.noreply.github.com> Date: Mon, 14 Mar 2022 15:56:53 -0400 Subject: [PATCH 19/20] Update README.md --- exercises/028-remove-duplicate-words/README.md | 9 +++------ 1 file changed, 3 insertions(+), 6 deletions(-) diff --git a/exercises/028-remove-duplicate-words/README.md b/exercises/028-remove-duplicate-words/README.md index 432b99b3..45324919 100644 --- a/exercises/028-remove-duplicate-words/README.md +++ b/exercises/028-remove-duplicate-words/README.md @@ -2,21 +2,18 @@ ## 📝 Instructions: -1. Write a function `remove_duplicate_words()` that accepts a sequence of whitespace separated words as input and prints the words after removing all duplicate words and sorting them alphanumerically. +1. Write a function `remove_duplicate_words()` that receives a string as parameter and returns the words after removing all duplicate words and sorting them alphanumerically. ## Example input: ```py -remove_duplicate_words(hello world and practice makes perfect and hello world again) +remove_duplicate_words("hello world and practice makes perfect and hello world again") ``` ## Example output: -+ again and hello makes perfect practice world ++ "again and hello makes perfect practice world" ## 💡 Hints: -+ In case of input data being supplied to the question, it should be assumed to be a console input. - + We use set container to remove duplicated data automatically and then use sorted() to sort the data. - From 7da723519f2595a4cd3eb6d460e699e8e71f48f5 Mon Sep 17 00:00:00 2001 From: Elvira Quiroz Date: Tue, 15 Mar 2022 19:36:27 +0000 Subject: [PATCH 20/20] https://github.com/learnpack/learnpack/issues/722 --- .../{022-list-and-tuple => 022-list_and_tuple}/README.es.md | 0 .../{022-list-and-tuple => 022-list_and_tuple}/README.md | 0 exercises/{022-list-and-tuple => 022-list_and_tuple}/app.py | 0 .../solution.hide.py | 0 .../{024-print-formula => 024-print_formula}/README.es.md | 0 exercises/{024-print-formula => 024-print_formula}/README.md | 0 exercises/{024-print-formula => 024-print_formula}/app.py | 0 .../{024-print-formula => 024-print_formula}/solution.hide.py | 0 .../README.es.md | 0 .../README.md | 0 .../app.py | 0 .../solution.hide.py | 0 .../README.es.md | 0 .../README.md | 0 .../{026-sequence-of-words => 026-sequence_of_words}/app.py | 0 .../solution.hide.py | 0 .../README.es.md | 0 .../README.md | 0 .../{027-sequence-of-lines => 027-sequence_of_lines}/app.py | 0 .../solution.hide.py | 0 .../README.es.md | 0 .../README.md | 0 .../app.py | 0 .../solution.hide.py | 0 .../README.es.md | 4 ++-- .../{029-divisable-binary => 029-divisible_binary}/README.md | 4 ++-- .../{029-divisable-binary => 029-divisible_binary}/app.py | 0 .../solution.hide.py | 0 .../{030-sum-eigth-digits => 030-even_digits}/README.es.md | 2 +- exercises/{030-sum-eigth-digits => 030-even_digits}/README.md | 2 +- exercises/{030-sum-eigth-digits => 030-even_digits}/app.py | 0 .../solution.hide.py | 0 32 files changed, 6 insertions(+), 6 deletions(-) rename exercises/{022-list-and-tuple => 022-list_and_tuple}/README.es.md (100%) rename exercises/{022-list-and-tuple => 022-list_and_tuple}/README.md (100%) rename exercises/{022-list-and-tuple => 022-list_and_tuple}/app.py (100%) rename exercises/{022-list-and-tuple => 022-list_and_tuple}/solution.hide.py (100%) rename exercises/{024-print-formula => 024-print_formula}/README.es.md (100%) rename exercises/{024-print-formula => 024-print_formula}/README.md (100%) rename exercises/{024-print-formula => 024-print_formula}/app.py (100%) rename exercises/{024-print-formula => 024-print_formula}/solution.hide.py (100%) rename exercises/{025-two-dimensional-array => 025-two_dimensional_array}/README.es.md (100%) rename exercises/{025-two-dimensional-array => 025-two_dimensional_array}/README.md (100%) rename exercises/{025-two-dimensional-array => 025-two_dimensional_array}/app.py (100%) rename exercises/{025-two-dimensional-array => 025-two_dimensional_array}/solution.hide.py (100%) rename exercises/{026-sequence-of-words => 026-sequence_of_words}/README.es.md (100%) rename exercises/{026-sequence-of-words => 026-sequence_of_words}/README.md (100%) rename exercises/{026-sequence-of-words => 026-sequence_of_words}/app.py (100%) rename exercises/{026-sequence-of-words => 026-sequence_of_words}/solution.hide.py (100%) rename exercises/{027-sequence-of-lines => 027-sequence_of_lines}/README.es.md (100%) rename exercises/{027-sequence-of-lines => 027-sequence_of_lines}/README.md (100%) rename exercises/{027-sequence-of-lines => 027-sequence_of_lines}/app.py (100%) rename exercises/{027-sequence-of-lines => 027-sequence_of_lines}/solution.hide.py (100%) rename exercises/{028-remove-duplicate-words => 028-remove_duplicate_words}/README.es.md (100%) rename exercises/{028-remove-duplicate-words => 028-remove_duplicate_words}/README.md (100%) rename exercises/{028-remove-duplicate-words => 028-remove_duplicate_words}/app.py (100%) rename exercises/{028-remove-duplicate-words => 028-remove_duplicate_words}/solution.hide.py (100%) rename exercises/{029-divisable-binary => 029-divisible_binary}/README.es.md (85%) rename exercises/{029-divisable-binary => 029-divisible_binary}/README.md (84%) rename exercises/{029-divisable-binary => 029-divisible_binary}/app.py (100%) rename exercises/{029-divisable-binary => 029-divisible_binary}/solution.hide.py (100%) rename exercises/{030-sum-eigth-digits => 030-even_digits}/README.es.md (94%) rename exercises/{030-sum-eigth-digits => 030-even_digits}/README.md (94%) rename exercises/{030-sum-eigth-digits => 030-even_digits}/app.py (100%) rename exercises/{030-sum-eigth-digits => 030-even_digits}/solution.hide.py (100%) diff --git a/exercises/022-list-and-tuple/README.es.md b/exercises/022-list_and_tuple/README.es.md similarity index 100% rename from exercises/022-list-and-tuple/README.es.md rename to exercises/022-list_and_tuple/README.es.md diff --git a/exercises/022-list-and-tuple/README.md b/exercises/022-list_and_tuple/README.md similarity index 100% rename from exercises/022-list-and-tuple/README.md rename to exercises/022-list_and_tuple/README.md diff --git a/exercises/022-list-and-tuple/app.py b/exercises/022-list_and_tuple/app.py similarity index 100% rename from exercises/022-list-and-tuple/app.py rename to exercises/022-list_and_tuple/app.py diff --git a/exercises/022-list-and-tuple/solution.hide.py b/exercises/022-list_and_tuple/solution.hide.py similarity index 100% rename from exercises/022-list-and-tuple/solution.hide.py rename to exercises/022-list_and_tuple/solution.hide.py diff --git a/exercises/024-print-formula/README.es.md b/exercises/024-print_formula/README.es.md similarity index 100% rename from exercises/024-print-formula/README.es.md rename to exercises/024-print_formula/README.es.md diff --git a/exercises/024-print-formula/README.md b/exercises/024-print_formula/README.md similarity index 100% rename from exercises/024-print-formula/README.md rename to exercises/024-print_formula/README.md diff --git a/exercises/024-print-formula/app.py b/exercises/024-print_formula/app.py similarity index 100% rename from exercises/024-print-formula/app.py rename to exercises/024-print_formula/app.py diff --git a/exercises/024-print-formula/solution.hide.py b/exercises/024-print_formula/solution.hide.py similarity index 100% rename from exercises/024-print-formula/solution.hide.py rename to exercises/024-print_formula/solution.hide.py diff --git a/exercises/025-two-dimensional-array/README.es.md b/exercises/025-two_dimensional_array/README.es.md similarity index 100% rename from exercises/025-two-dimensional-array/README.es.md rename to exercises/025-two_dimensional_array/README.es.md diff --git a/exercises/025-two-dimensional-array/README.md b/exercises/025-two_dimensional_array/README.md similarity index 100% rename from exercises/025-two-dimensional-array/README.md rename to exercises/025-two_dimensional_array/README.md diff --git a/exercises/025-two-dimensional-array/app.py b/exercises/025-two_dimensional_array/app.py similarity index 100% rename from exercises/025-two-dimensional-array/app.py rename to exercises/025-two_dimensional_array/app.py diff --git a/exercises/025-two-dimensional-array/solution.hide.py b/exercises/025-two_dimensional_array/solution.hide.py similarity index 100% rename from exercises/025-two-dimensional-array/solution.hide.py rename to exercises/025-two_dimensional_array/solution.hide.py diff --git a/exercises/026-sequence-of-words/README.es.md b/exercises/026-sequence_of_words/README.es.md similarity index 100% rename from exercises/026-sequence-of-words/README.es.md rename to exercises/026-sequence_of_words/README.es.md diff --git a/exercises/026-sequence-of-words/README.md b/exercises/026-sequence_of_words/README.md similarity index 100% rename from exercises/026-sequence-of-words/README.md rename to exercises/026-sequence_of_words/README.md diff --git a/exercises/026-sequence-of-words/app.py b/exercises/026-sequence_of_words/app.py similarity index 100% rename from exercises/026-sequence-of-words/app.py rename to exercises/026-sequence_of_words/app.py diff --git a/exercises/026-sequence-of-words/solution.hide.py b/exercises/026-sequence_of_words/solution.hide.py similarity index 100% rename from exercises/026-sequence-of-words/solution.hide.py rename to exercises/026-sequence_of_words/solution.hide.py diff --git a/exercises/027-sequence-of-lines/README.es.md b/exercises/027-sequence_of_lines/README.es.md similarity index 100% rename from exercises/027-sequence-of-lines/README.es.md rename to exercises/027-sequence_of_lines/README.es.md diff --git a/exercises/027-sequence-of-lines/README.md b/exercises/027-sequence_of_lines/README.md similarity index 100% rename from exercises/027-sequence-of-lines/README.md rename to exercises/027-sequence_of_lines/README.md diff --git a/exercises/027-sequence-of-lines/app.py b/exercises/027-sequence_of_lines/app.py similarity index 100% rename from exercises/027-sequence-of-lines/app.py rename to exercises/027-sequence_of_lines/app.py diff --git a/exercises/027-sequence-of-lines/solution.hide.py b/exercises/027-sequence_of_lines/solution.hide.py similarity index 100% rename from exercises/027-sequence-of-lines/solution.hide.py rename to exercises/027-sequence_of_lines/solution.hide.py diff --git a/exercises/028-remove-duplicate-words/README.es.md b/exercises/028-remove_duplicate_words/README.es.md similarity index 100% rename from exercises/028-remove-duplicate-words/README.es.md rename to exercises/028-remove_duplicate_words/README.es.md diff --git a/exercises/028-remove-duplicate-words/README.md b/exercises/028-remove_duplicate_words/README.md similarity index 100% rename from exercises/028-remove-duplicate-words/README.md rename to exercises/028-remove_duplicate_words/README.md diff --git a/exercises/028-remove-duplicate-words/app.py b/exercises/028-remove_duplicate_words/app.py similarity index 100% rename from exercises/028-remove-duplicate-words/app.py rename to exercises/028-remove_duplicate_words/app.py diff --git a/exercises/028-remove-duplicate-words/solution.hide.py b/exercises/028-remove_duplicate_words/solution.hide.py similarity index 100% rename from exercises/028-remove-duplicate-words/solution.hide.py rename to exercises/028-remove_duplicate_words/solution.hide.py diff --git a/exercises/029-divisable-binary/README.es.md b/exercises/029-divisible_binary/README.es.md similarity index 85% rename from exercises/029-divisable-binary/README.es.md rename to exercises/029-divisible_binary/README.es.md index 8283831a..66cf53e3 100644 --- a/exercises/029-divisable-binary/README.es.md +++ b/exercises/029-divisible_binary/README.es.md @@ -1,8 +1,8 @@ -# `029` divisable binary +# `029` divisible binary ## 📝 Instrucciones: -1. Escribe una función `divisable_binary()` que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. +1. Escribe una función `divisible_binary()` que acepte una secuencia de números binarios de 4 dígitos separados por comas como su entrada y que luego verifique si son divisibles por 5 o no. Los números que son divisibles por 5 se deben imprimir en una secuencia separada por comas. ## Ejemplo de entrada: diff --git a/exercises/029-divisable-binary/README.md b/exercises/029-divisible_binary/README.md similarity index 84% rename from exercises/029-divisable-binary/README.md rename to exercises/029-divisible_binary/README.md index dc1edcd9..2457633b 100644 --- a/exercises/029-divisable-binary/README.md +++ b/exercises/029-divisible_binary/README.md @@ -1,8 +1,8 @@ -# `029` divisable binary +# `029` divisible binary ## 📝 Instructions: -1. Write a function `divisable_binary()` that accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. +1. Write a function `divisible_binary()` that accepts a sequence of comma separated 4 digit binary numbers as its input and then check whether they are divisible by 5 or not. The numbers that are divisible by 5 are to be printed in a comma separated sequence. ## Example input: diff --git a/exercises/029-divisable-binary/app.py b/exercises/029-divisible_binary/app.py similarity index 100% rename from exercises/029-divisable-binary/app.py rename to exercises/029-divisible_binary/app.py diff --git a/exercises/029-divisable-binary/solution.hide.py b/exercises/029-divisible_binary/solution.hide.py similarity index 100% rename from exercises/029-divisable-binary/solution.hide.py rename to exercises/029-divisible_binary/solution.hide.py diff --git a/exercises/030-sum-eigth-digits/README.es.md b/exercises/030-even_digits/README.es.md similarity index 94% rename from exercises/030-sum-eigth-digits/README.es.md rename to exercises/030-even_digits/README.es.md index 63d44065..0cff0ab2 100644 --- a/exercises/030-sum-eigth-digits/README.es.md +++ b/exercises/030-even_digits/README.es.md @@ -1,4 +1,4 @@ -# `030` sum eight digits +# `030` even digits ## 📝 Instrucciones: diff --git a/exercises/030-sum-eigth-digits/README.md b/exercises/030-even_digits/README.md similarity index 94% rename from exercises/030-sum-eigth-digits/README.md rename to exercises/030-even_digits/README.md index 83dc757f..62550e21 100644 --- a/exercises/030-sum-eigth-digits/README.md +++ b/exercises/030-even_digits/README.md @@ -1,4 +1,4 @@ -# `030` sum eight digits +# `030` even digits ## 📝 Instructions: diff --git a/exercises/030-sum-eigth-digits/app.py b/exercises/030-even_digits/app.py similarity index 100% rename from exercises/030-sum-eigth-digits/app.py rename to exercises/030-even_digits/app.py diff --git a/exercises/030-sum-eigth-digits/solution.hide.py b/exercises/030-even_digits/solution.hide.py similarity index 100% rename from exercises/030-sum-eigth-digits/solution.hide.py rename to exercises/030-even_digits/solution.hide.py