subsr97 / daily-coding-problem Goto Github PK

Contributors

Stargazers

Forkers

mdstart tompxu bittu18 fco2 sethuramanpl nandansatheesh htnani adara20 kaence ashiksiddique datakingdom repoarchiver sree-vathsan olamigokayphils vietnguyen1989 sirnader mgiglio pushpit sureshdontha aworleo scorpionjacky laranea luckycse haxgad dlmlpyrtraining pythonexpert mynk322 oguzy hemkar jaydm layzhi desikandar prefetcher farshadsm greeshma0601 soorajpandey jksgit mahadi18 lantran snistaheads bharathbrothers ktp-forked-repos nanyukiappfactory dkp1903 govardhan27 anhle yinanlll akeemoduola gudata techoni3 gourav-singhal amiralies appycse taonguyen740 qicst23 maxkhrichtchatyi hieu08devs nnazeer kanglicheng hybeecodes katiagilligan888 oracle1983 mindaugasvaitkus2 selvamanikannan shriduttkothari gitexec cletusajibade katkamrachana surya10197 anirban-das52134 pradeepkaushal sridharnarayanmkr ckopecky navkn samia-cloud amitashutosh rahulkumar-aws deepaktseervi faksam akapur99 anasmohammad611 shakirkhan1 deepbas iamvarunanand hai-voquang shivraj97 udhayprakash rajeshjaava chandramohann harryyhzhang puperfused rchatti hadt0786 frankie-b d3rrick chandu stevenlay vibhavjoshi123 subhashis002 radheopti17

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 = createTree(arr[:mid])
    node.right = createTree(arr[mid+1:])
    return node


def findSecondHighest(root):
    if root:
        global max, smax
        current = root.val
        if current > max:
            max, smax = current, max
        elif current < max and current > smax:
            smax = current
        findSecondHighest(root.left)
        findSecondHighest(root.right)


sorted_nums = [1, 2, 3, 4, 15, 6, 17, 8]
tree = createTree(sorted_nums)
smax = tree.val
max = tree.val
findSecondHighest(tree)
print(smax)

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)

from itertools import combinations

def determine_sum(numbers, neededSum):
    resulting_values = list(map(sum combinations(numbers, 2)))
    if neededSum in resulting_values:
        return True
    return False