Added new python exercise with solution (#346)

* added new python exercise and solution

* add sort exercise and solutions

* changed heading1

* fixed header description
This commit is contained in:
Ayobami Alaran A 2023-02-03 10:42:59 +01:00 committed by GitHub
parent b35b1f2c2e
commit 211c28c340
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
4 changed files with 90 additions and 0 deletions

View File

@ -0,0 +1,3 @@
## Class
write a simple class that has two attributes of which one has a default value and has two methods

View File

@ -0,0 +1,55 @@
## Class 0x00 - Solution
1. write a simple class that has two attributes of which one has a default value and has two methods
```python
from typing import Optional
""" Student Module
"""
class Student:
def __init__(self, name: str, department: Optional[str] = None) -> None:
""" Instance Initialization function
Args:
name (str): Name of student
department (Optional[str], optional): Department. Defaults to None.
"""
self.name = name
self.department = department
def getdetails(self) -> str:
""" Gets the students details
Returns:
str: A formatted string
"""
return f"Name is {self.name}, I'm in department {self.department}"
def change_department(self, new_deparment: str) -> None:
"""Changes the department of the student object
Args:
new_deparment (str): Assigns the new deparment value to dept attr
"""
self.department = new_deparment
# student1 instantiation
student1 = Student("Ayobami", "Statistics")
print(student1.getdetails())
# Calling the change_department function to change the department of student
student1.change_department("CS")
print(student1.department)
```
Output
```
Name is Ayobami, I'm in department Statistics
CS
```

View File

@ -0,0 +1,26 @@
## Sort Descending - Solution
1. write a function that sorts the following list of list without using the `sorted()` and `.sort()`
function in descending order
- mat_list = [[1, 2, 3], [2, 4, 4], [5, 5, 5]] -> [[5, 5, 5], [2, 4, 4], [1, 2, 3]]
```python
def sort_desc(mat: list) -> list:
""" Sorts a list in descending order
Args:
mat (list): paresd list
Returns:
list: A new list
"""
new_list = []
while mat != []:
maxx = max(mat)
new_list.append(maxx)
mat.remove(maxx)
return new_list
print(sort_func(mat_list))
```

6
topics/python/sort.md Normal file
View File

@ -0,0 +1,6 @@
## Sort Descending
1. write a function that sorts the following list of list without using the `sorted()` and `.sort()`
function in descending order
- list = [[1, 2, 3], [2, 4, 4], [5, 5, 5]] -> [[5, 5, 5], [2, 4, 4], [1, 2, 3]]