Juan Code

𝗝𝗮𝘃𝗮𝗦𝗰𝗿𝗶𝗽𝘁 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝘀𝗰𝗲𝗻𝗮𝗿𝗶𝗼:

Given a number n, return the number of positive odd numbers below n, EASY!

Examples (Input -> Output)
7 -> 3 (because odd numbers below 7 are [1, 3, 5])
15 -> 7 (because odd numbers below 15 are [1, 3, 5, 7, 9, 11, 13])

𝗝𝗮𝘃𝗮𝗦𝗰𝗿𝗶𝗽𝘁 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝘀𝗰𝗲𝗻𝗮𝗿𝗶𝗼:

Replace all the dots . in the specified String str with dashes -

𝗝𝗮𝘃𝗮𝗦𝗰𝗿𝗶𝗽𝘁 𝗽𝗿𝗮𝗰𝘁𝗶𝗰𝗲 𝘀𝗰𝗲𝗻𝗮𝗿𝗶𝗼:

You are given two sorted arrays that both only contain integers. Your task is to find a way to merge them into a single one, sorted in asc order. Complete the function mergeArrays(arr1, arr2), where arr1 and arr2 are the original sorted arrays.

You don't need to worry about validation, since arr1 and arr2 must be arrays with 0 or more Integers. If both arr1 and arr2 are empty, then just return an empty array.

Note: arr1 and arr2 may be sorted in different orders. Also arr1 and arr2 may have same integers. Remove duplicated in the returned result.

Examples (input -> output)
* [1, 2, 3, 4, 5], [6, 7, 8, 9, 10] -> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

* [1, 3, 5, 7, 9], [10, 8, 6, 4, 2] -> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

* [1, 3, 5, 7, 9, 11, 12], [1, 2, 3, 4, 5, 10, 12] -> [1, 2, 3, 4, 5, 7, 9, 10, 11, 12]

Let's try to get all the prime numbers from 1 to a certain number. In this case, 20. | Python