Sort by

recency

|

308 Discussions

|

  • + 0 comments

    I made this way harder than it needed to be by calculating the coefficients of the quadratic equation which of course gave me overflow issues with very large numbers when multiplying very large numbers by sqrt(2). I got overflow issues as well as errors. I tried to solve those issuse until I realized that I can get a straight equation that doesn't require the multiplication of very large numbers and got the result! the derived equation is: t=sqrt(2)*(l-sqrt(q))/abs(s1-s2) and you just need to loop through the queries!

  • + 0 comments

    def movingTiles(l, s1, s2, queries):
    results = [round((math.sqrt(2) * (l - math.sqrt(query)))/abs(s2-s1),5) for query in queries]
    return results

  • + 0 comments

    It’s like watching Sherlock navigate a living chessboard—strategic, unpredictable, and brilliant. A fresh concept executed with intrigue! Cricbet99 Green ID

  • + 0 comments

    The way the problem dissects motion and geometry feels like reviewing Consulting Team Profiles each element (like velocity, distance, overlap) plays a distinct role but must align seamlessly to get accurate outcomes.

  • + 0 comments

    Just like Sherlock solves mysteries with precision, organizing a smooth relocation with shifting pieces—like moving tiles—requires strategy. For a seamless experience, trust a reliable moving service. To make your next move stress-free, check this service page.