{"id":27430417,"url":"https://github.com/yll0rd/26-coding-challenge-partii","last_synced_at":"2025-04-14T14:43:29.237Z","repository":{"id":143231035,"uuid":"581917242","full_name":"yll0rd/26-coding-challenge-partII","owner":"yll0rd","description":null,"archived":false,"fork":false,"pushed_at":"2023-07-31T11:33:56.000Z","size":35,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-08T23:20:44.589Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/yll0rd.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2022-12-24T21:23:18.000Z","updated_at":"2024-04-08T23:20:49.662Z","dependencies_parsed_at":"2024-04-08T23:20:49.287Z","dependency_job_id":"da6634ea-3c5b-43eb-9577-c5e8a9bed808","html_url":"https://github.com/yll0rd/26-coding-challenge-partII","commit_stats":null,"previous_names":["yll0rd/26-coding-challenge-partii"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yll0rd%2F26-coding-challenge-partII","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yll0rd%2F26-coding-challenge-partII/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yll0rd%2F26-coding-challenge-partII/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/yll0rd%2F26-coding-challenge-partII/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/yll0rd","download_url":"https://codeload.github.com/yll0rd/26-coding-challenge-partII/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248898735,"owners_count":21179831,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-04-14T14:43:28.687Z","updated_at":"2025-04-14T14:43:29.231Z","avatar_url":"https://github.com/yll0rd.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 26-coding-challenge-PartII\n## (Continuation of [PartI](https://github.com/Leo-Youmbi/26-coding-challenge-partI))\n![image](https://user-images.githubusercontent.com/114886588/210148838-93634a28-31e7-4a33-a3ec-88649c94fb92.png)\n\n\n## Tasks \n[27](./27.py): Create a fxn that will receive an array of numbers as argument and will return a new array with distinct elements.  \n[28](./28.py): Calculate the sum of the first 100 prime numbers and return them in array.  \n[29](./29.py): Print the distance between the first 100 prime numbers.  \n[30](./30.py): Create a fxn that will add two positive numbers of indefinite size. The numbers are received as strings and the result should be also provided as a string.  \n[31](./31.py): Create a fxn that will return the number of words in a text.  \n[32](./32.py): Create a fxn that will capitalize the first letter of each word in a text.  \n[33](./33.py): Calculate the sum of numbers received in a comma delimited string.  \n[34](./34.py): Create a fxn that returns an array with words inside a text.  \n[35](./35.py): Create a fxn to convert a CSV text to a \"`bi-dimensional`\" array.  \n[36](./36.py): Create a fxn that converts a string to an array of characters.  \n[37](./37.py): Create a fxn that will convert a string in an array containing the ASCII codes of each character.  \n[38](./38.py): Create a fxn that will convert an array containing ASCII codes in a string.  \n[39](./39.py): Implement the `Caesar cypher`.  \n[40](./40.py): Implement the bubble sort algorithm for an array of numbers.  \n[41](./41.py): Create a fxn that calculates the distance between two points defined by `x`, `y` coordinates.  \n[42](./42.py): Create a fxn that will return a Boolean value indicating if two circles defined by center coordinates and radius are intersection.  \n[43](./43.py): Create a fxn that will receive a bi-dimensional array as argument and a number and will extract as a unidimensional array the column specified by the number.  \n[44](./44.py): Create a fxn that will convert a string containing a binary number into a number.  \n[45](./45.py): Create a fxn to calculate the sum of all the numbers in a jagged array (contains numbers or other arrays of numbers on an unlimited number of levels).  \n[46](./46.py): Find the max number in a jagged array or array of numbers.  \n[47](./47.py): Deep copy a jagged array with numbers or other arrays in new array.  \n[48](./48.py): Create a fxn to return the longest word in a string.  \n[49](./49.py): Shuffle an array of strings.    \n[50](./50.py): Create a fxn that will receive `n` as an argument and return an array of `n` random numbers from 1 to `n`. The numbers should be unique inside the array.    \n[51](./51.py): Find the frequency of letters inside a string. Return the result as an array of arrays. Each subarray has 2 elements: letter and number of occurrences.    \n[52](./52.py): Calculate `Fibonacci(500)` with high precision (all digits).    \n[53](./53.py): Calculate `70!` with high precision (all digits).    ","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyll0rd%2F26-coding-challenge-partii","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fyll0rd%2F26-coding-challenge-partii","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fyll0rd%2F26-coding-challenge-partii/lists"}