Third clear solution for Can Balance by kazuki.h - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Third solution in Clear category for Can Balance by kazuki.h

def can_balance(weights):    
    left_weight_sums, right_weight_sums = [0], [0]
    sum_L = SUM_L = sum_R = SUM_R = 0
    
    for w in weights:
        sum_L += w
        SUM_L += sum_L
        left_weight_sums.append(SUM_L)
    
    for w in weights[::-1]:
        sum_R += w
        SUM_R += sum_R
        right_weight_sums.append(SUM_R)
        
    for i, (w_l, w_r) in enumerate(zip(left_weight_sums, right_weight_sums[-2::-1])):
        if w_l == w_r: return i
    
    return -1

Aug. 9, 2022

Comments:

Mariusz_Lesniak on Aug. 9, 2022, 4:28 p.m.
Great job! Now your code is lighting fast in comparision with previous one. I tested it again, to compare previous one and this one: Test 1: input len: 10, test cases: 10 Old code: 0.00077s, new code: 4e-05s. New is 19.28 times faster! Test 2: input len: 100, test cases: 10 Old code: 0.01614s, new code: 0.00027s. New is 59.67 times faster! Test 3: input len: 1000, test cases: 10 Old code: 1.06652s, new code: 0.00261s. New is 408.96 times faster! Test 4: input len: 10000, test cases: 10 Old code: 104.05137s, new code: 0.03014s. New is 3452.73 times faster!

Blizzard

0 %

PyCharm The Python IDE for Professional Developers. Enjoy productive Python, web and scientific development with PyCharm. Download it now!