Add Final tasks for week 1

Author: martin056

week01/03.FinalRound/Anagrams/README.md

@@ -0,0 +1,57 @@
+# Are two words anagrams?
+
+For anagrams, check here - https://en.wikipedia.org/wiki/Anagram
+
+For example, `listen` and `silent` are anagrams.
+
+The program should read two words from the standard input and output:
+
+* `ANAGRAMS` if the words are anagrams of each other
+* `NOT ANAGRAMS` if the two words are not anagrams of each other
+
+**Consider lowering the case of the two words since the case does not matter. `SILENT` and `listen` are also anagrams.**
+
+## Examples
+---
+
+Input:
+
+```
+TOP_CODER COTO_PRODE
+```
+
+Output:
+
+```
+NOT ANAGRAMS
+```
+
+---
+
+Input:
+
+```
+kilata cvetelina_yaneva
+```
+
+Output:
+
+```
+NOT ANAGRAMS
+```
+
+Also, should not make songs together.
+
+---
+
+Input:
+
+```
+BRADE BEARD
+```
+
+Output:
+
+```
+ANAGRAMS
+```

week01/03.FinalRound/CreditCard/README.md

@@ -0,0 +1,20 @@
+# Credit card validation
+
+Implement a function, called `is_credit_card_valid(number)`, which returns True/False based on the following algorithm:
+
+* Each credit card number must contain odd count of digits.
+* We transform the number with the following steps (based on the fact that we start from index 0)
+  - All digits, read from right to left, at even positions (index), **remain the same.**
+  - Every digit, read from right to left, at odd position is replaced by the result, that is obtained from doubling the given digit.
+* After the transformation, we find the sum of all digits in the transformed number.
+* The number is valid, if the sum is divisible by 10.
+
+For example: `79927398713` is valid, bacause:
+
+* When we double and replace all digits at odd position we get: `7 (18 = 2 * 9) 9 (4 = 2 * 2) 7 (6 = 2 * 3) 9 (16 = 2 * 8) 7 (2 = 2 * 1) 3`
+* The sum of all digits of the new number is 70, which is divisible by 10 => the card number is valid.
+
+More examples:
+
+* `79927398713` is a valid number
+* `79927398715` is invalid number

week01/03.FinalRound/GoldbachConjecture/README.md

@@ -0,0 +1,41 @@
+# Goldbach Conjecture
+
+Implement a function, called `goldbach(n)` which returns a list of tuples, that is the goldbach conjecture for the given number `n`.
+
+The Goldbach Conjecture states:
+
+> Every even integer greater than 2 can be expressed as the sum of two primes.
+
+Keep in mind that there can be more than one combination of two primes, that sums up to the given number.
+
+**The result should be sorted by the first item in the tuple.**
+
+For example:
+
+- `4 = 2 + 2`
+- `6 = 3 + 3`
+- `8 = 3 + 5`
+- `10 = 3 + 7 = 5 + 5`
+- `100 = 3 + 97 = 11 + 89 = 17 + 83 = 29 + 71 = 41 + 59 = 47 + 53`
+
+## Signature
+
+```python
+def goldbach(n):
+    pass
+```
+
+## Test examples
+
+```python
+>>> goldbach(4)
+[(2,2)]
+>>> goldbach(6)
+[(3,3)]
+>>> goldbach(8)
+[(3,5)]
+>>> goldbach(10)
+[(3,7), (5,5)]
+>>> goldbach(100)
+[(3, 97), (11, 89), (17, 83), (29, 71), (41, 59), (47, 53)]
+```

week01/03.FinalRound/MatrixBombing/README.md

@@ -0,0 +1,52 @@
+## Matrix Bombing
+
+You are givn a `NxM` matrix of integer numbers.
+
+We can drop a bomb at any place in the matrix, which has the following effect:
+
+- All of the **3 to 8 neighbours** (depending on where you hit!) of the target are reduced by the value of the target.
+- Numbers can be reduced only to 0 - they cannot go to negative.
+
+For example, if we have the following matrix:
+
+```
+10  10  10
+10   9  10
+10  10  10
+```
+
+and we drop bomb at `9`, this will result in the following matrix:
+
+```
+1 1 1
+1 9 1
+1 1 1
+```
+
+Implement a function called `matrix_bombing_plan(m)`.
+
+The function should return a dictionary where keys are positions in the matrix, represented as tuples, and values are the total sum of the elements of the matrix, after the bombing at that position.
+
+The positions are the standard indexes, starting from `(0, 0)`
+
+For example if we have the following matrix:
+
+```
+1 2 3
+4 5 6
+7 8 9
+```
+
+and run the function, we will have:
+
+```python
+{(0, 0): 42,
+ (0, 1): 36,
+ (0, 2): 37,
+ (1, 0): 30,
+ (1, 1): 15,
+ (1, 2): 23,
+ (2, 0): 29,
+ (2, 1): 15,
+ (2, 2): 26}
+```

week01/README.md

@@ -1,6 +1,7 @@
 # Week 01 - Introduction to course & Python
 
 [Intro slides](https://slides.com/hackbulgaria/python101-9th-opening)
+[Exceptions slides](https://slides.com/hackbulgaria/python101-9th-exceptions)
 
 ## Data Structures