We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
At the time of this note, none of the Java solutions (leaderboard) has achieved > 19.2 score. My code is passing tests 0-6, and timing out on the rest. I'm using a variation on Tarjan's Offline LCA algorithm, which I think should be reasonably optimal. Are timings too tight for Java? It looks like most of the successful solutions are in c/c++.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Kitty's Calculations on a Tree
You are viewing a single comment's thread. Return to all comments →
At the time of this note, none of the Java solutions (leaderboard) has achieved > 19.2 score. My code is passing tests 0-6, and timing out on the rest. I'm using a variation on Tarjan's Offline LCA algorithm, which I think should be reasonably optimal. Are timings too tight for Java? It looks like most of the successful solutions are in c/c++.