@@ -0,0 +1,683 @@
+def triangleOrNot(a, b, c):%0A    n = len(a)%0A    result = %5B%5D%0A    for i in range(n):%0A        side_a = a%5Bi%5D%0A        side_b = b%5Bi%5D%0A        side_c = c%5Bi%5D%0A        print(side_a,side_b,side_c)%0A        sort_arr = qsort(%5Bside_a,side_b,side_c%5D)%0A        print(sort_arr)%0A        result.append('No' if (sort_arr%5B0%5D + sort_arr%5B1%5D %3C= sort_arr%5B2%5D) else 'Yes')%0A%0A    return result%0A%0Adef qsort(inlist):%0A    if inlist == %5B%5D:%0A        return %5B%5D%0A    else:%0A        pivot = inlist%5B0%5D%0A        lesser = qsort(%5Bx for x in inlist%5B1:%5D if x %3C pivot%5D)%0A        greater = qsort(%5Bx for x in inlist%5B1:%5D if x %3E= pivot%5D)%0A        return lesser + %5Bpivot%5D + greater%0A%0A%0Aprint('Result : ',triangleOrNot(%5B7,10,7%5D,%5B2,3,4%5D,%5B2,7,4%5D))%0A

Add solution for FB Melbourne 2018 Hackahton Pre-eliminary Challenge