daily-coding-problem
daily-coding-problem copied to clipboard
subsr97
Solutions for Daily Coding Problem.
This problem was asked in one of my college assignments. Here is my solution.
``` class Node: def __init__(self, key): self.left = None self.right = None self.val = key def createTree(arr): if not arr: return None mid = len(arr)//2 node = Node(arr[mid]) node.left =...
```python lists = [[10, 15, 30], [12, 15, 20, 31], [17, 20, 32]] one_sorted_list = [] for i in range(len(lists)): one_sorted_list = sorted([ *one_sorted_list, *lists[i] ]) print(one_sorted_list) ```
Hi there, Regarding the problem #1, i am wondering in the second method why not check the remaining value against the primary array and not in knownnumbers. Is there any...
