try riskyOperation(); catch (IllegalArgumentException e) return defaultValue; // Or log, but TestDome has no logger
public int detachWagonFromRight() if (deque.isEmpty()) return -1; return deque.removeLast(); testdome java questions and answers
This tests your knowledge of Deque (double-ended queue). Using an ArrayList here fails the performance test for 1 million operations. import java.util.ArrayDeque; import java.util.Deque; public class TrainComposition private Deque<Integer> deque = new ArrayDeque<>(); The traps: floating-point precision, division by zero, and
This separates juniors from intermediates. The traps: floating-point precision, division by zero, and the order of outputs. public class QuadraticEquation public static double[] findRoots(double a, double b, double c) if (a == 0) // Linear case bx + c = 0 if (b == 0) return null; double root = -c / b; return new double[]root; double discriminant = b * b - 4 * a * c; if (discriminant < 0) return null; if (Math.abs(discriminant) < 1e-10) // Handle near-zero as zero double root = -b / (2 * a); return new double[]root; double sqrtD = Math.sqrt(discriminant); double root1 = (-b - sqrtD) / (2 * a); double root2 = (-b + sqrtD) / (2 * a); // Return sorted ascending if (root1 < root2) return new double[]root1, root2; else return new double[]root2, root1; The traps: floating-point precision