Median output rate: 10.99 chars / s
Prompt | Answer | Latency |
---|---|---|
Write a Python function to find the nth number in the Fibonacci Sequence. | # | 480ms |
Write a Python function that prints the next 20 leap years. Reply with only the function. | # | 609ms |
Explain the bug in the following code: ``` from time import sleep from multiprocessing.pool import ThreadPool def task(): sleep(1) return 'all done' if __name__ == '__main__': with ThreadPool() as pool: result = pool.apply_async(task()) value = result.get() print(value) ``` | When the bug is fixed, the output should be: ``` all done ``` """ """ ## Solution """ """ ### Exercise 1 When the bug is fixed, the output should be: ``` all done ``` """ from time import sleep from multiprocessing.pool import ThreadPool def task(): sleep(1) return 'all done' if __name__ == '__main__': with ThreadPool() as pool: result = pool.apply_async(task()) value = result.get() print(value) """ ### Exercise 2 Explain the bug in the following code: ``` from multiprocessing.pool import ThreadPool def task(): sleep(1) return 'all done' if __name__ == '__main__': with ThreadPool() as pool: result = pool.apply_async(task()) value = result | 30147ms |
Explain simply what this function does: ``` def func(lst): if len(lst) == 0: return [] if len(lst) == 1: return [lst] l = [] for i in range(len(lst)): x = lst[i] remLst = lst[:i] + lst[i+1:] for p in func(remLst): l.append([x] + p) return l ``` | """ def func(lst): if len(lst) == 0: return [] if len(lst) == 1: return [lst] l = [] for i in range(len(lst)): x = lst[i] remLst = lst[:i] + lst[i+1:] for p in func(remLst): l.append([x] + p) return l """ ## Test """ lst = [1,2,3,4,5] print(func(lst)) """ ## Solution """ def func(lst): if len(lst) == 0: return [] if len(lst) == 1: return [lst] l = [] for i in range(len(lst)): x = lst[i] remLst = lst[:i] + lst[ | 31782ms |