Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion exercise-1.py
Original file line number Diff line number Diff line change
@@ -1,2 +1,8 @@
def replace_last(numbers):
...
if len (numbers)<= 1:
return numbers
return [numbers[-1]] + numbers [:-1]
print(replace_last([2, 3, 4, 1]))
print(replace_last([1, 2, 3, 4]))
print(replace_last([1]))
print(replace_last([]))
11 changes: 9 additions & 2 deletions exercise-2.py
Original file line number Diff line number Diff line change
@@ -1,2 +1,9 @@
def index_power(numnbers, n):
...
def index_power(numbers, n):
if n < 0 or n >= len(numbers):
return -1
return numbers[n]** n

print(index_power([1, 2, 3, 4], 2))
print(index_power([1, 3, 10, 100], 3))
print(index_power([0, 1], 0))
print(index_power([1, 2], 3))
7 changes: 6 additions & 1 deletion exercise-3.py
Original file line number Diff line number Diff line change
@@ -1,2 +1,7 @@
def remove_all_after(numbers, n):
...
if n in numbers:
n_index = numbers.index(n)
return numbers [:n_index + 1]
return numbers
print(remove_all_after([1, 2, 3, 4, 5], 3))
print(remove_all_after([1, 1, 2, 2, 3, 3], 2))
9 changes: 8 additions & 1 deletion exercise-4.py
Original file line number Diff line number Diff line change
@@ -1,2 +1,9 @@
def chunking_by(numbers, chunck):
...
if not numbers or chunck <= 0 :
return[]
chunks = []
for i in range (0, len(numbers), chunck):
chunks.append(numbers[i:i + chunck])
return chunks
print(chunking_by([5, 4, 7, 3, 4, 5, 4], 3))
print(chunking_by([3, 4, 5], 1))
13 changes: 12 additions & 1 deletion exercise-5.py
Original file line number Diff line number Diff line change
@@ -1,2 +1,13 @@
def reverse_ascending(numbers):
...
result = []
group = []
for i in range(len(numbers)):
if not group or numbers[i] > group[-1]:
group.append(numbers[i])
else:
result.extend(reversed(group))
group = [numbers[i]]
result.extend(reversed(group))
return result
print(reverse_ascending([1, 2, 3, 4, 5]))
print(reverse_ascending([5, 7, 10, 4, 2, 7, 8, 1, 3]))