salisbuk7897 / bukmeds-algorithms Goto Github PK

File Name: 05_05_2023.py
The above file contains a solution to the first puzzle. it returns the floor number. It is re-usable. it can be run in 3 ways in the terminal/command prompt:

• py 05_05_2023.py : in this case, there is only one argument which is the file name. It returns the answer to the puzzle instruction specified in the challenge document.
• py 05_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.
• py 05_05_2023.py find '<><<>>>' : This takes the filename, 'find' argument and a string of floor instructions. It returns the floor number based on the floor instruction specified in the terminal.

Puzzle 1 floor instruction in the document

<<<<<<><><><><<<<><><><><><<<<><><><><><>>>><<><><><><><><><><>>>><<<<
<><><><><><<<<<><><><><><><<<<><><><><><><><><><><><<<<<<><><<><><>>><
<>><<><<>><><<><><><><><><><<<<<<<<<>><<><><<<><><><><<<<<<>>>>>>>>>>>
<>><><><>><<<><><><><<><><<><><><><><><><<<<><><><>><<>>>>><><><>><<<>
<><><><><><>><><><><><><><><><><><><><><><><><<<><><><><><><><><><><><
><><><><><><>>>><><><><><><><><><>><<<<<<<<<<>>>>><<<<<>>>><<<<>><<><<
><><><><><><><><><><<<<<<<><><<><<><<><<><><><><><<>><><>><><><><><<><
<<<<>><<<<><><<<><>>><<><>>>>><>>><<><<><><><><<>><><><><><><><><><><>
<><><><><><<<<><><<<<><<<>>>>>>>>><<><<<>>>>><<<<<<<<<>>>><<><>><><<><
<>><<>><<>><

Answer to Puzzle 1

56

File Name: 06_05_2023.py
The above file contains a solution to the second puzzle. it returns the distance of the winning runner in 1234 seconds. It uses modulus to calculate the number of rounds(running + racetime) and the remaining seconds(out of which another runtime is deducted). it can be run in 4 ways in the terminal/command prompt:

• py 06_05_2023.py : in this case, there is only one argument which is the file name. It returns the answer to the puzzle instruction specified in the challenge document. which is the distance of the winning runner in 1234 seconds.
• py 06_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.
• py 06_05_2023.py race 1234 : This takes the filename, 'race' argument and a racetime in seconds. It returns the distance of all the runners.
• py 06_05_2023.py raceLeader 1234 : This takes the filename, 'raceLeader' argument and a racetime in seconds. It returns the distance of winning runner.

Puzzle 2 distance of winning runner instruction in the document

1) John can run 10 m/s for 6 seconds, but then must rest for 20 seconds
2) James can run 8 m/s for 8 seconds, but then must rest for 25 seconds
3) Jenna can run 12 m/s for 5 seconds, but then must rest for 16 seconds
4) Josh can run 7 m/s for 7 seconds, but then must rest for 23 seconds
5) Jacob can run 9 m/s for 4 seconds, but then must rest for 32 seconds
6) Jerry can run 5 m/s for 9 seconds, but then must rest for 18 seconds

After 1234 seconds, what is the distance of the winning runner?

Answer to Puzzle 2

Jenna 3540m

File Name: 08_05_2023.py
The above file contains a solution to the third puzzle. it returns the Average of max and min permutation numbers of 1867 divisible by 7. it can be run in 4 ways in the terminal/command prompt:

• py 08_05_2023.py : in this case, there is only one argument which is the file name. It returns the answer to the puzzle instruction specified in the challenge document. Average of max and min permutation numbers of 1867 divisible by 7.
• py 08_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.
• py 06_05_2023.py findAverage 1234 : This takes the filename, 'findAverage' argument and a number. It returns the Average of max and min permutation numbers of the given number which are divisible by 7.

Puzzle 3 instruction in the document

What you’ll need to do is determine if any of the permutations of 1867 are divisible by 7, and
if so, what is the average between the smallest and largest permutation? Decimals are
allowed.

Answer to Puzzle 3

5152.0

File Name: 10_05_2023.py
The above file contains a solution to the fourth puzzle. it returns the Minimum cost of paired workers based on the efficiencies given in the instruction document. it can be run in 2 ways in the terminal/command prompt:

• py 10_05_2023.py : in this case, there is only one argument which is the file name. Returns minimum cost of paired workers based on the efficiencies given in the instruction document.
• py 10_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.

Puzzle 4 instruction in the document

What is the minimum cost of this array of efficiencies:
[1, 3, 54, 712, 52, 904, 113, 12, 135, 32, 31, 56, 23, 79, 611, 123, 677, 232, 997, 101, 111,
123, 2, 7, 24, 57, 99, 45, 666, 42, 104, 129, 554, 335, 876, 35, 15, 93, 13]

Answer to Puzzle 4

Minimum Cost = 539

File Name: 12_05_2023.py
The above file contains a solution to the fifth puzzle. it returns the decoded message based on instructions given in the instruction document. it can be run in 3 ways in the terminal/command prompt:

• py 12_05_2023.py : in this case, there is only one argument which is the file name. Returns decoded message based on instructions given in the instruction document.
• py 12_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.
• py 12_05_2023.py decodeSample 0100 : This takes the filename, 'decodeSample' argument and an encoded string. It returns decoded message based on string given in the terminal.

Puzzle 5 instruction in the document

What is the decoded phrase for this string?

“1111101111111111000111111100101111110101111111110011011111111111000100111111010
0111100110111111100101111010010111111000111111111110001101111110101110011011111
1111110001101111010011111100101111110010110111111101001111001101111111111100010
11101100011111110111111111001110111111111110001111110111111101011111111110001111
11011111110011111111111000111101111111011111111010011111111110001001111110100110
01111111111000111011111111110101111101111111010111110111111010011110011111111110
00100111111010011001111111111000111111011111111110001110011111011111110011111110
01011111011111100011101111111111100011111111010111101110111111111110001111111110
11111110101111111100011001111111111000111111111110001111111111100011111111010111
1010011111110101111111111000100111111011011111101101101001111111000111111100111
11111111000111111011111101001111111111000111111110101111011101111111111100011111
11011011110111111110000011111110011101”

Answer to Puzzle 5

i love angelhack code challenge because it is fun and exciting and i dislike the word yab that appears in the phrase

File Name: 14_05_2023.py
The above file contains a solution to the sixth puzzle. it returns the minimum number of steps needed to disconect a series of nodes under threat in a network based on the instruction given in the instruction document. it can be run in 3 ways in the terminal/command prompt:

• py 14_05_2023.py : in this case, there is only one argument which is the file name. Returns minimum number of steps needed to disconect a series of nodes under threat in a network based on the instruction given in the instruction document.
• py 14_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.
• py 14_05_2023.py minSteps aabbbccaabbbddd : This takes the filename, 'minSteps' argument and a network series. It returns minimum number of steps needed to disconect a series of nodes under threat in a network based on the series given in the terminal.

Puzzle 6 instruction in the document

What is the minimum number of steps required to delete this series:
“kjslaqpwoereeeeewwwefifjdksjdfhjdksdjfkdfdlddkjdjfjfjfjjjjfjffnefhkjgefkgjefkjgkefjekihutrieruhi
gtefhgbjkkkknbmssdsdsfdvneurghiueor”

Answer to Puzzle 6

Minimum Number of Steps: 82

File Name: 16_05_2023.py
The above file contains a solution to the seventh puzzle. it returns the lifeform score as requested in the instruction document. it can be run in 2 ways in the terminal/command prompt:

• py 16_05_2023.py : in this case, there is only one argument which is the file name. Returns lifeform score.
• py 16_05_2023.py sampleTest : This takes the filename and another argument 'sampleTest'. This runs some sample tests specified in the challenge document as well as some edge cases. You can edit the test cases in the file to add more test cases.

Puzzle 7 instruction in the document

Consider the following start state:

XXXX.
X....
X..X.
.X.X.
XX.XX

What is the lifeform score for the first layout that appears twice?

Answer to Puzzle 7

31 Minute(S)
X X X X X
. . . . .
. . X . .
. . . . .
X X X X X
Score = 2**0 = 1
Score = 2**1 = 2
Score = 2**2 = 4
Score = 2**3 = 8
Score = 2**4 = 16
Score = 2**12 = 4096
Score = 2**20 = 1048576
Score = 2**21 = 2097152
Score = 2**22 = 4194304
Score = 2**23 = 8388608
Score = 2**24 = 16777216
LifeForm Total Score: 32509983