public void attachWagonFromLeft(int wagonId) deque.addFirst(wagonId);
public int detachWagonFromRight() if (deque.isEmpty()) return -1; return deque.removeLast(); testdome java questions and answers
ArrayDeque offers O(1) insertion/removal at both ends. LinkedList would also work but uses more memory. Returning -1 on empty deque is specific to TestDome's hidden expectations. 3. The "Quadratic Equation" Problem (Precision & Edge Cases) Prompt: Implement the findRoots function to return the roots of ax² + bx + c = 0. Return roots in ascending order as a double array. Handle complex roots by returning null . public void attachWagonFromLeft(int wagonId) deque
// Implement an LRU cache with get(key) and put(key, value) methods // Use LinkedHashMap with accessOrder=true Mastering TestDome Java questions and answers is not about memorizing code—it is about defensive programming. The platform rewards candidates who anticipate how inputs might break their assumptions. Handle complex roots by returning null
public UUID addAlert(LocalDateTime time) UUID id = UUID.randomUUID(); alerts.put(id, time); return id;
public void attachWagonFromRight(int wagonId) deque.addLast(wagonId);
// Step 3: Inject via constructor class AlertService private final AlertDAO storage;