<jupyter_start><jupyter_text>(1) Print the numbers from 1 to 10 separated by a space in one line and in new lines as well<jupyter_code>def print_horizontally():
    pass


def print_vertically():
    pass<jupyter_output><empty_output><jupyter_text>(2) Sort a list of integer lists with respect to the length of the inner lists.Example: ```pythonlst = [[1, 2, 4], [8], [7, 6], [], [3, 5, 9, 10]],```expected output: ```python[[3, 5, 9, 10], [1, 2, 4], [7, 6], [8], []]```<jupyter_code>def sort_by_length(lst):
    pass<jupyter_output><empty_output><jupyter_text>(3) Flatten a list of integer lists.Example: ```pythonlst = [[1, 2, 4], [8], [7, 6], [], [3, 5, 9, 10]],```expected output: ```python[1, 2, 4, 8, 7, 6, 3, 5, 9, 10]```<jupyter_code>def flatten(lst):
    pass<jupyter_output><empty_output><jupyter_text>(4) Implement random-sort: given a list of integers, repeat the following two steps:1. check if the array is sorted in O(n) time2. permute the elements of the list randomly<jupyter_code>def random_sort(lst):
    pass<jupyter_output><empty_output><jupyter_text>(5) For a given string remove consecutive duplicate characters.Example:```pythons = "kukkkuuuurrrriiiikuuuuuuuu"```Expected output:```python"kukuriku"```<jupyter_code>def deduplicate(string):
    pass<jupyter_output><empty_output><jupyter_text>(6) For a given $[a, b]$ interval ($a\leq b$) return the list of Fibonacci numbers contained in this interval.The Fibonacci numbers are defined as follows:$$    f_0 = f_1 = 1, \qquad f_n = f_{n-1} + f_{n-2} \quad (n\geq 2)$$<jupyter_code>def fibonacci_numbers_in_interval(a, b):
    pass<jupyter_output><empty_output><jupyter_text>(7) Return the 20 most frequent letters from the webpage https://en.wikipedia.org/wiki/Machine_learning<jupyter_code>def top_20_most_frequent_letters(url):
    pass<jupyter_output><empty_output><jupyter_text>(8) Implement complex number or rational number arithmetics using classesRepresent them as an object, define the usual algebraic operations.Example: ```pythonz = ComplexNumber(1, 2)   1 + 2iw = ComplexNumber(2, -3)   2 - 3iz * w = ComplexNumber(8, 1)   8 + i```or ```pythonp = Rational(1, 4)   1/4p + p = Rational(1, 2)  1/4 + 1/4 = 1/2```<jupyter_code>class ComplexNumber:
    pass<jupyter_output><empty_output><jupyter_text>(9) Bonus: given a finite sequence of integers, find the length of the longest increasing subsequence. A subsequence of a sequence $a_1, a_2,\dotsc,a_n$ is of the form $a_{i_1},\dotsc,a_{i_k}$, where $i_1 < i_2 < \ldots < i_k$.Example:```pythonlst = [5, 3, 2, 4, 6, 1]```Expected output:```python the longest increasing subsequences are [2, 4, 6] or [3, 4, 6]3```<jupyter_code>def longest_increasing_subsequence(lst):
    pass<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.14687614176105224, 'fraction_numerical': 0.039824625502374866, 'mean_word_length': 5.949238578680203, 'pattern_counts': {'":': 0, '<': 40, '<?xml version=': 0, '>': 37, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 1, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '9', 'dir': 'jupyter-structured-clean-dedup', 'id': '107655', 'license': 'MIT', 'n_tokens_mistral': 1059, 'n_tokens_neox': 982, 'n_words': 284, 'path': 'homework/week01_assignments.ipynb', 'repo_name': 'ELTE-ML-DL-Course/2020_ml_dl', 'size': '2737'}