├── .devcontainer └── devcontainer.json ├── .github ├── CODEOWNERS ├── ISSUE_TEMPLATE.md ├── PULL_REQUEST_TEMPLATE.md └── workflows │ └── main.yml ├── .gitignore ├── .vscode └── settings.json ├── 01_desafios_texto ├── 01_01_palindromo.py ├── 01_02_primera_letra_repetida.py ├── 01_03_conversion_formato_horario.py ├── 01_04_anagramas.py ├── 01_05_slugify.py └── 01_06_parentesis_balanceados.py ├── 02_desafios_numericos ├── 02_01_numero_primo.py ├── 02_02_factorial.py └── 02_03_numero_triangular.py ├── 03_desafios_estructuras_datos ├── 03_01_ordenamiento_burbuja.py ├── 03_02_duplicados_lista.py ├── 03_03_aplanar_lista.py └── 03_04_triangulo_pascal.py ├── CONTRIBUTING.md ├── LICENSE ├── NOTICE └── README.md /.devcontainer/devcontainer.json: -------------------------------------------------------------------------------- 1 | { 2 | "extensions": [ 3 | "GitHub.github-vscode-theme", 4 | "ms-python.python" // Includes Jupyter extension 5 | // Additional Extensions Here 6 | ], 7 | "onCreateCommand" : "echo PS1='\"$ \"' >> ~/.bashrc", //Set Terminal Prompt to $ 8 | } 9 | 10 | // DevContainer Reference: https://code.visualstudio.com/docs/remote/devcontainerjson-reference 11 | -------------------------------------------------------------------------------- /.github/CODEOWNERS: -------------------------------------------------------------------------------- 1 | # Codeowners for these exercise files: 2 | # * (asterisk) denotes "all files and folders" 3 | # Example: * @producer @instructor 4 | -------------------------------------------------------------------------------- /.github/ISSUE_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 7 | 8 | ## Issue Overview 9 | 10 | 11 | ## Describe your environment 12 | 13 | 14 | ## Steps to Reproduce 15 | 16 | 1. 17 | 2. 18 | 3. 19 | 4. 20 | 21 | ## Expected Behavior 22 | 23 | 24 | ## Current Behavior 25 | 26 | 27 | ## Possible Solution 28 | 29 | 30 | ## Screenshots / Video 31 | 32 | 33 | ## Related Issues 34 | 35 | -------------------------------------------------------------------------------- /.github/PULL_REQUEST_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /.github/workflows/main.yml: -------------------------------------------------------------------------------- 1 | name: Copy To Branches 2 | on: 3 | workflow_dispatch: 4 | jobs: 5 | copy-to-branches: 6 | runs-on: ubuntu-latest 7 | steps: 8 | - uses: actions/checkout@v2 9 | with: 10 | fetch-depth: 0 11 | - name: Copy To Branches Action 12 | uses: planetoftheweb/copy-to-branches@v1.2 13 | env: 14 | key: main 15 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .DS_Store 2 | node_modules 3 | .tmp 4 | npm-debug.log 5 | -------------------------------------------------------------------------------- /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "editor.bracketPairColorization.enabled": true, 3 | "editor.cursorBlinking": "solid", 4 | "editor.fontFamily": "ui-monospace, Menlo, Monaco, 'Cascadia Mono', 'Segoe UI Mono', 'Roboto Mono', 'Oxygen Mono', 'Ubuntu Monospace', 'Source Code Pro', 'Fira Mono', 'Droid Sans Mono', 'Courier New', monospace", 5 | "editor.fontLigatures": false, 6 | "editor.fontSize": 22, 7 | "editor.formatOnPaste": true, 8 | "editor.formatOnSave": true, 9 | "editor.lineNumbers": "on", 10 | "editor.matchBrackets": "always", 11 | "editor.minimap.enabled": false, 12 | "editor.smoothScrolling": true, 13 | "editor.tabSize": 2, 14 | "editor.useTabStops": true, 15 | "emmet.triggerExpansionOnTab": true, 16 | "explorer.openEditors.visible": 0, 17 | "files.autoSave": "afterDelay", 18 | "screencastMode.onlyKeyboardShortcuts": true, 19 | "terminal.integrated.fontSize": 18, 20 | "workbench.activityBar.visible": true, 21 | "workbench.colorTheme": "Visual Studio Dark", 22 | "workbench.fontAliasing": "antialiased", 23 | "workbench.statusBar.visible": true 24 | } 25 | -------------------------------------------------------------------------------- /01_desafios_texto/01_01_palindromo.py: -------------------------------------------------------------------------------- 1 | def es_palindromo(texto): 2 | 3 | texto_minuscula = texto.lower() 4 | texto_sin_espacios = texto_minuscula.replace(" ", "") 5 | return texto_sin_espacios == texto_sin_espacios[::-1] 6 | 7 | 8 | print(es_palindromo("Anita lava la tina")) # True 9 | print(es_palindromo("palindromo")) # False 10 | -------------------------------------------------------------------------------- /01_desafios_texto/01_02_primera_letra_repetida.py: -------------------------------------------------------------------------------- 1 | def primera_letra_repetida(texto): 2 | 3 | texto_minsucula = texto.lower() 4 | texto_sin_espacios = texto_minsucula.replace(" ", "") 5 | lista_letras = [] 6 | for letra in texto_sin_espacios: 7 | if letra in lista_letras: 8 | return letra 9 | else: 10 | lista_letras.append(letra) 11 | 12 | return None 13 | 14 | 15 | 16 | print(primera_letra_repetida("saltar")) # a 17 | print(primera_letra_repetida("me gusta")) # None 18 | -------------------------------------------------------------------------------- /01_desafios_texto/01_03_conversion_formato_horario.py: -------------------------------------------------------------------------------- 1 | def convertir_horario(hora): 2 | 3 | hora_lista = hora.split(":") 4 | if hora[-2:].lower() == "pm": 5 | if hora_lista[0] != "12": 6 | hora_lista[0] = str(int(hora_lista[0]) + 12) 7 | else: 8 | if hora_lista[0] == "12": 9 | hora_lista[0] = "00" 10 | 11 | hora_convertida = ":".join(hora_lista) 12 | 13 | return hora_convertida[:-2] 14 | 15 | print(convertir_horario("12:40AM")) # 00:40 16 | print(convertir_horario("04:59pm")) # 16:59 17 | print(convertir_horario("10:00:00PM")) # 22:00 18 | -------------------------------------------------------------------------------- /01_desafios_texto/01_04_anagramas.py: -------------------------------------------------------------------------------- 1 | def es_anagrama(palabra_1, palabra_2): 2 | 3 | letras_palabra_1 = sorted(palabra_1.lower()) 4 | letras_palabra_2 = sorted(palabra_2.lower()) 5 | 6 | return letras_palabra_1 == letras_palabra_2 7 | 8 | 9 | print(es_anagrama("lama", "Mala")) # True 10 | print(es_anagrama("calor", "coral")) # True 11 | print(es_anagrama("cama", "casa")) # False 12 | -------------------------------------------------------------------------------- /01_desafios_texto/01_05_slugify.py: -------------------------------------------------------------------------------- 1 | import re 2 | 3 | 4 | def slugify(texto): 5 | 6 | slug = (texto 7 | .lower() 8 | .strip() 9 | .replace(" ", "-") 10 | ) 11 | 12 | slug = re.sub("[^\w\-]", "", slug) 13 | return slug 14 | 15 | 16 | print(slugify("texto% con caracteres$# especial-es")) # texto-con-caracteres-especial-es 17 | print(slugify("Este es un ejemplo!!!")) # este-es-un-ejemplo 18 | -------------------------------------------------------------------------------- /01_desafios_texto/01_06_parentesis_balanceados.py: -------------------------------------------------------------------------------- 1 | def parentesis_balanceados(texto): 2 | 3 | apertura = 0 4 | 5 | for parentesis in texto: 6 | if parentesis == "(": 7 | apertura += 1 8 | elif parentesis == ")": 9 | apertura -= 1 10 | 11 | if apertura < 0: 12 | return False 13 | 14 | return apertura == 0 15 | 16 | 17 | print(parentesis_balanceados("((()))()")) 18 | print(parentesis_balanceados(")(()")) 19 | print(parentesis_balanceados("(()")) 20 | -------------------------------------------------------------------------------- /02_desafios_numericos/02_01_numero_primo.py: -------------------------------------------------------------------------------- 1 | def es_numero_primo(numero): 2 | 3 | if numero <= 1: 4 | return False 5 | 6 | for i in range(2, numero): 7 | if numero % i == 0: 8 | return False 9 | 10 | return True 11 | 12 | 13 | print(es_numero_primo(3)) # True 14 | print(es_numero_primo(12)) # False 15 | print(es_numero_primo(43)) # True 16 | -------------------------------------------------------------------------------- /02_desafios_numericos/02_02_factorial.py: -------------------------------------------------------------------------------- 1 | def calcular_factorial(numero): 2 | 3 | factorial = 1 4 | for i in range(1, numero+1): 5 | factorial = factorial * i 6 | 7 | return factorial 8 | 9 | 10 | print(calcular_factorial(0)) # 1 11 | print(calcular_factorial(3)) # 6 12 | print(calcular_factorial(4)) # 24 13 | print(calcular_factorial(5)) # 120 14 | 15 | 16 | def calcular_factorial_recursivo(numero): 17 | 18 | if numero == 0 or numero == 1: 19 | return 1 20 | 21 | return numero * calcular_factorial_recursivo(numero-1) 22 | 23 | 24 | print(calcular_factorial_recursivo(0)) # 1 25 | print(calcular_factorial_recursivo(3)) # 6 26 | print(calcular_factorial_recursivo(4)) # 24 27 | print(calcular_factorial_recursivo(5)) # 120 28 | -------------------------------------------------------------------------------- /02_desafios_numericos/02_03_numero_triangular.py: -------------------------------------------------------------------------------- 1 | def numero_triangular(row): 2 | 3 | triangular = 0 4 | for i in range(1, row + 1): 5 | triangular += i 6 | 7 | return triangular 8 | 9 | 10 | print(numero_triangular(2)) # 3 11 | print(numero_triangular(4)) # 10 12 | print(numero_triangular(6)) # 21 13 | -------------------------------------------------------------------------------- /03_desafios_estructuras_datos/03_01_ordenamiento_burbuja.py: -------------------------------------------------------------------------------- 1 | def ordenamiento_burbuja(lista): 2 | 3 | for i in range(len(lista)): 4 | 5 | for j in range(0, len(lista) - i - 1): 6 | 7 | if lista[j] > lista[j+1]: 8 | temporal = lista[j] 9 | lista[j] = lista[j+1] 10 | lista[j+1] = temporal 11 | 12 | return lista 13 | 14 | print(ordenamiento_burbuja([3,8,4,1,2])) # [1, 2, 3, 4, 8] 15 | -------------------------------------------------------------------------------- /03_desafios_estructuras_datos/03_02_duplicados_lista.py: -------------------------------------------------------------------------------- 1 | def encontrar_duplicados(lista): 2 | 3 | elementos_lista = [] 4 | duplicados = [] 5 | 6 | for elemento in lista: 7 | 8 | if elemento in elementos_lista: 9 | duplicados.append(elemento) 10 | else: 11 | elementos_lista.append(elemento) 12 | 13 | return duplicados 14 | 15 | 16 | print(encontrar_duplicados(["ana", "paco", "paco", "emilio", "javier", "ana"])) # ["paco", "ana"] 17 | -------------------------------------------------------------------------------- /03_desafios_estructuras_datos/03_03_aplanar_lista.py: -------------------------------------------------------------------------------- 1 | def aplanar_lista(lista): 2 | 3 | nueva_lista = [] 4 | 5 | for elemento in lista: 6 | 7 | if type(elemento) is list: 8 | nueva_lista.extend(elemento) 9 | else: 10 | nueva_lista.append(elemento) 11 | 12 | return nueva_lista 13 | 14 | 15 | print(aplanar_lista([2, 3, 4, [3, 2]])) # [2, 3, 4, 3, 2] 16 | print(aplanar_lista([2, 3, 4, [[2]]])) # [2, 3, 4. [2]] 17 | -------------------------------------------------------------------------------- /03_desafios_estructuras_datos/03_04_triangulo_pascal.py: -------------------------------------------------------------------------------- 1 | """ Triangulo de Pascal 2 | 3 | 1 fila 1 -> triangulo[0] 4 | 1 1 fila 2 -> triangulo[1] 5 | 1 2 1 fila 3 -> triangulo[2] 6 | 1 3 3 1 fila 4 -> triangulo[3] 7 | 8 | """ 9 | 10 | 11 | def triangulo_pascal(cantidad_filas): 12 | 13 | triangulo = [] 14 | 15 | for n_fila in range(cantidad_filas): 16 | 17 | fila = [] 18 | 19 | for posicion in range(n_fila+1): 20 | 21 | if posicion == 0 or posicion == n_fila: 22 | fila.append(1) 23 | else: 24 | valor = triangulo[n_fila-1][posicion-1] + triangulo[n_fila-1][posicion] 25 | fila.append(valor) 26 | 27 | triangulo.append(fila) 28 | return triangulo 29 | 30 | print(triangulo_pascal(4)) # [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1]] 31 | -------------------------------------------------------------------------------- /CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | 2 | Contribution Agreement 3 | ====================== 4 | 5 | This repository does not accept pull requests (PRs). All pull requests will be closed. 6 | 7 | However, if any contributions (through pull requests, issues, feedback or otherwise) are provided, as a contributor, you represent that the code you submit is your original work or that of your employer (in which case you represent you have the right to bind your employer). By submitting code (or otherwise providing feedback), you (and, if applicable, your employer) are licensing the submitted code (and/or feedback) to LinkedIn and the open source community subject to the BSD 2-Clause license. 8 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | LinkedIn Learning Exercise Files License Agreement 2 | ================================================== 3 | 4 | This License Agreement (the "Agreement") is a binding legal agreement 5 | between you (as an individual or entity, as applicable) and LinkedIn 6 | Corporation (“LinkedIn”). By downloading or using the LinkedIn Learning 7 | exercise files in this repository (“Licensed Materials”), you agree to 8 | be bound by the terms of this Agreement. If you do not agree to these 9 | terms, do not download or use the Licensed Materials. 10 | 11 | 1. License. 12 | - a. Subject to the terms of this Agreement, LinkedIn hereby grants LinkedIn 13 | members during their LinkedIn Learning subscription a non-exclusive, 14 | non-transferable copyright license, for internal use only, to 1) make a 15 | reasonable number of copies of the Licensed Materials, and 2) make 16 | derivative works of the Licensed Materials for the sole purpose of 17 | practicing skills taught in LinkedIn Learning courses. 18 | - b. Distribution. Unless otherwise noted in the Licensed Materials, subject 19 | to the terms of this Agreement, LinkedIn hereby grants LinkedIn members 20 | with a LinkedIn Learning subscription a non-exclusive, non-transferable 21 | copyright license to distribute the Licensed Materials, except the 22 | Licensed Materials may not be included in any product or service (or 23 | otherwise used) to instruct or educate others. 24 | 25 | 2. Restrictions and Intellectual Property. 26 | - a. You may not to use, modify, copy, make derivative works of, publish, 27 | distribute, rent, lease, sell, sublicense, assign or otherwise transfer the 28 | Licensed Materials, except as expressly set forth above in Section 1. 29 | - b. Linkedin (and its licensors) retains its intellectual property rights 30 | in the Licensed Materials. Except as expressly set forth in Section 1, 31 | LinkedIn grants no licenses. 32 | - c. You indemnify LinkedIn and its licensors and affiliates for i) any 33 | alleged infringement or misappropriation of any intellectual property rights 34 | of any third party based on modifications you make to the Licensed Materials, 35 | ii) any claims arising from your use or distribution of all or part of the 36 | Licensed Materials and iii) a breach of this Agreement. You will defend, hold 37 | harmless, and indemnify LinkedIn and its affiliates (and our and their 38 | respective employees, shareholders, and directors) from any claim or action 39 | brought by a third party, including all damages, liabilities, costs and 40 | expenses, including reasonable attorneys’ fees, to the extent resulting from, 41 | alleged to have resulted from, or in connection with: (a) your breach of your 42 | obligations herein; or (b) your use or distribution of any Licensed Materials. 43 | 44 | 3. Open source. This code may include open source software, which may be 45 | subject to other license terms as provided in the files. 46 | 47 | 4. Warranty Disclaimer. LINKEDIN PROVIDES THE LICENSED MATERIALS ON AN “AS IS” 48 | AND “AS AVAILABLE” BASIS. LINKEDIN MAKES NO REPRESENTATION OR WARRANTY, 49 | WHETHER EXPRESS OR IMPLIED, ABOUT THE LICENSED MATERIALS, INCLUDING ANY 50 | REPRESENTATION THAT THE LICENSED MATERIALS WILL BE FREE OF ERRORS, BUGS OR 51 | INTERRUPTIONS, OR THAT THE LICENSED MATERIALS ARE ACCURATE, COMPLETE OR 52 | OTHERWISE VALID. TO THE FULLEST EXTENT PERMITTED BY LAW, LINKEDIN AND ITS 53 | AFFILIATES DISCLAIM ANY IMPLIED OR STATUTORY WARRANTY OR CONDITION, INCLUDING 54 | ANY IMPLIED WARRANTY OR CONDITION OF MERCHANTABILITY OR FITNESS FOR A 55 | PARTICULAR PURPOSE, AVAILABILITY, SECURITY, TITLE AND/OR NON-INFRINGEMENT. 56 | YOUR USE OF THE LICENSED MATERIALS IS AT YOUR OWN DISCRETION AND RISK, AND 57 | YOU WILL BE SOLELY RESPONSIBLE FOR ANY DAMAGE THAT RESULTS FROM USE OF THE 58 | LICENSED MATERIALS TO YOUR COMPUTER SYSTEM OR LOSS OF DATA. NO ADVICE OR 59 | INFORMATION, WHETHER ORAL OR WRITTEN, OBTAINED BY YOU FROM US OR THROUGH OR 60 | FROM THE LICENSED MATERIALS WILL CREATE ANY WARRANTY OR CONDITION NOT 61 | EXPRESSLY STATED IN THESE TERMS. 62 | 63 | 5. Limitation of Liability. LINKEDIN SHALL NOT BE LIABLE FOR ANY INDIRECT, 64 | INCIDENTAL, SPECIAL, PUNITIVE, CONSEQUENTIAL OR EXEMPLARY DAMAGES, INCLUDING 65 | BUT NOT LIMITED TO, DAMAGES FOR LOSS OF PROFITS, GOODWILL, USE, DATA OR OTHER 66 | INTANGIBLE LOSSES . IN NO EVENT WILL LINKEDIN'S AGGREGATE LIABILITY TO YOU 67 | EXCEED $100. THIS LIMITATION OF LIABILITY SHALL: 68 | - i. APPLY REGARDLESS OF WHETHER (A) YOU BASE YOUR CLAIM ON CONTRACT, TORT, 69 | STATUTE, OR ANY OTHER LEGAL THEORY, (B) WE KNEW OR SHOULD HAVE KNOWN ABOUT 70 | THE POSSIBILITY OF SUCH DAMAGES, OR (C) THE LIMITED REMEDIES PROVIDED IN THIS 71 | SECTION FAIL OF THEIR ESSENTIAL PURPOSE; AND 72 | - ii. NOT APPLY TO ANY DAMAGE THAT LINKEDIN MAY CAUSE YOU INTENTIONALLY OR 73 | KNOWINGLY IN VIOLATION OF THESE TERMS OR APPLICABLE LAW, OR AS OTHERWISE 74 | MANDATED BY APPLICABLE LAW THAT CANNOT BE DISCLAIMED IN THESE TERMS. 75 | 76 | 6. Termination. This Agreement automatically terminates upon your breach of 77 | this Agreement or termination of your LinkedIn Learning subscription. On 78 | termination, all licenses granted under this Agreement will terminate 79 | immediately and you will delete the Licensed Materials. Sections 2-7 of this 80 | Agreement survive any termination of this Agreement. LinkedIn may discontinue 81 | the availability of some or all of the Licensed Materials at any time for any 82 | reason. 83 | 84 | 7. Miscellaneous. This Agreement will be governed by and construed in 85 | accordance with the laws of the State of California without regard to conflict 86 | of laws principles. The exclusive forum for any disputes arising out of or 87 | relating to this Agreement shall be an appropriate federal or state court 88 | sitting in the County of Santa Clara, State of California. If LinkedIn does 89 | not act to enforce a breach of this Agreement, that does not mean that 90 | LinkedIn has waived its right to enforce this Agreement. The Agreement does 91 | not create a partnership, agency relationship, or joint venture between the 92 | parties. Neither party has the power or authority to bind the other or to 93 | create any obligation or responsibility on behalf of the other. You may not, 94 | without LinkedIn’s prior written consent, assign or delegate any rights or 95 | obligations under these terms, including in connection with a change of 96 | control. Any purported assignment and delegation shall be ineffective. The 97 | Agreement shall bind and inure to the benefit of the parties, their respective 98 | successors and permitted assigns. If any provision of the Agreement is 99 | unenforceable, that provision will be modified to render it enforceable to the 100 | extent possible to give effect to the parties’ intentions and the remaining 101 | provisions will not be affected. This Agreement is the only agreement between 102 | you and LinkedIn regarding the Licensed Materials, and supersedes all prior 103 | agreements relating to the Licensed Materials. 104 | 105 | Last Updated: March 2019 106 | -------------------------------------------------------------------------------- /NOTICE: -------------------------------------------------------------------------------- 1 | Copyright 2022 LinkedIn Corporation 2 | All Rights Reserved. 3 | 4 | Licensed under the LinkedIn Learning Exercise File License (the "License"). 5 | See LICENSE in the project root for license information. 6 | 7 | Please note, this project may automatically load third party code from external 8 | repositories (for example, NPM modules, Composer packages, or other dependencies). 9 | If so, such third party code may be subject to other license terms than as set 10 | forth above. In addition, such third party code may also depend on and load 11 | multiple tiers of dependencies. Please review the applicable licenses of the 12 | additional dependencies. 13 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Desafío de programación: Python 2 | Este es el repositorio del curso de LinkedIn Learning `[Desafío de programación: Python]`. El curso completo está disponible en [LinkedIn Learning][lil-course-url]. 3 | 4 | ![COURSENAME][lil-thumbnail-url] 5 | 6 | Consulta el archivo Readme en la rama main para obtener instrucciones e información actualizadas. 7 | 8 | Amplía tus conocimientos en programación y mejorar tu pensamiento lógico-computacional en Python a través de la solución de problemas con este curso que te supondrá un verdadero desafío y te permitirá desarrollar el pensamiento algorítmico para resolver problemas de lógica y algoritmia usando Python como lenguaje de programación. Durante el contenido, se van a desarrollar las soluciones para tres tipos de desafíos de programación: cadenas de texto, numéricos y estructuras de datos como listas y diccionarios, tu objetivo es obtener una solución óptima para cada uno de ellos. ¿Te atreves? 9 | 10 | ## Instrucciones 11 | 12 | Este curso está integrado con GitHub Codespaces, un entorno de desarrollo instantáneo alojado en la nube que ofrece toda la funcionalidad de tu IDE favorito sin tener que configurar una máquina local. Con Codespaces puedes practicar en cualquier lugar y desde cualquier dispositivo, de modo que no necesitas instalar ninguna otra herramienta. 13 | Cada episodio de la serie Level Up ofrece al menos 12 ejercicios prácticos en diferentes niveles de dificultad para que puedas desafiarte y reforzar lo que has aprendido. Aprende a configurar y utilizar un espacio de código con el vídeo “Cómo usar GitHub Codespaces con este curso”. 14 | 15 | Este repositorio tiene directorios para cada uno de los capítulos del curso. 16 | 17 | ## Directorios 18 | Las directorios están estructuradas para corresponder a los vídeos del curso. La convención de nomenclatura del directorio es Capítulo#, para los archivos la convención es Capítulo#_Vídeo#. Por ejemplo, el directorio denominada `02_` corresponde al segundo capítulo y el archivo que se encuentra en este directorio iniciando con el nombre 02_03_ corresponde al tercer vídeo de ese capítulo. 19 | 20 | ### Docente 21 | 22 | **Ana María Pinto** 23 | 24 | Echa un vistazo a mis otros cursos en [LinkedIn Learning](https://www.linkedin.com/learning/instructors/ana-maria-pinto). 25 | 26 | [0]: # (Replace these placeholder URLs with actual course URLs) 27 | [lil-course-url]: https://www.linkedin.com/learning/desafio-de-programacion-python 28 | [lil-thumbnail-url]: https://cdn.lynda.com/course/2497404/2497404-1668095155772-16x9.jpg 29 | --------------------------------------------------------------------------------