###### Are the exported files read and write for the user?
###### Does the site include a link or a button to download the file?
###### Does the project use the HTTP header [Content-Type](https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Content-Type) to indicate the media type of the resource?
###### Does the project use the HTTP header [Content-Length](https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Content-Length) to indicate the size of the entity-body, in bytes, sent to the recipient?
You have been given the mission to create a new sense of time.
Instead of a normal week having only 7 days, you will have 14 days.
Your mission is to create an `addWeek` function with one parameter of `Date` type.
So now, a week is 14 days from `Monday` to `Sunday` then `secondMonday` to `secondSunday`.
Week number should be count from `0001-01-01`
Now imagine you have a doctor appointment and you have to wait some hours.
But you do not want to wait, so what you need to do is create a
function `timeTravel` that allows you to change the time according to your needs, this function
it can go backwards or forwards in time.
You will have a function that takes a date and you will pass 3 more parameters to change
the hour, minute and seconds.
You have been given the mission to create a new sense of time! Normally a week has 7 days right? Well, that is about to change!
Instead of a normal week having only 7 days, it will have 14 days.
Let me explain, this new week will have 14 days, from `Monday` to `Sunday` then `secondMonday` to `secondSunday`.
Your purpose is to create a new function `addWeek`, that takes as parameter a `Date` and that will return what week day the given date is, according to your new week format.
Week number should be count from `0001-01-01`.
```
new week format:
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
secondMonday
secondTuesday
secondWednesday
secondThursday
secondFriday
secondSaturday
secondSunday
```
Now imagine you have a doctor appointment and you have to wait some hours, but you do not want to wait, so you decided that you need to create a
function `timeTravel` that allows you to change the time according to your needs.
This function will give you the power to go backwards or forwards in time.
So, you will have a function that takes an object with the following `{date, hour, minute, second}`. This object will be responsible for changing the `hour`, `minute` and `second` of the given `date`.
@ -12,7 +12,7 @@ Groupie tracker search bar consists of creating a functional program that search
- locations
- first album date
- creation date
- The program must handle case sensitive.
- The program must handle search input as case-insensitive.
- The search bar must have typing suggestions as you write.
- The search bar must identify and display in each suggestion the individual type of the search cases. (ex: Freddie Mercury -> member)
- For example if you start writing `"phil"` it should appear as suggestions `Phil Collins - member` and `Phil Collins - artist/band`. This is just an example of a display.
Create a method `new` that takes one number `usize` and initializes the struct `Number`.
The Collatz Conjecture or 3x+1 problem can be summarized as follows:
This method will have to determinate if the given number is even or odd. If it is even you will have to increment it by one to the next odd number and if it is odd you have to increment by one to the next even number.
Take any positive integer `n`.
After that you will implement an iterator for the struct `Number` that returns a tuple (usize,usize,usize) containing each field of the struct Number.
- If `n` is even, you will divide `n` by 2 to get `n / 2`.
- If `n` is odd, you will multiply `n` by 3 and add 1 to get `3n + 1`.
The first position of the tuple will be the even number, the second will be the odd number, and the third will be the factorial number.
Repeat the process indefinitely. The conjecture states that no matter which number you start with, you will always reach 1 eventually.
So the purpose is to return the given number in the right position. If it is even it will be at the first position, and if it is odd it will be in the second position. Apart from that you have to return the factorial of the given number in the third position.
But sometimes the number grow significantly before it reaches 1. This can lead to an integer overflow and makes the algorithm unsolvable within the range of a number in u64. You will not have to worry about that in this exercise.
Given a number `n`, return the number of steps required to reach 1.
Examples:
Starting with n = 16, the steps would be as follows:
0- 16
1- 8
2- 4
3- 2
4- 1
Resulting in 4 steps. So for input n = 16, the return value would be 4.
LEEDASILVA
3 years ago
committed by