ZipHQ interview questions

Showing 1–9 of 9 results

• Compute maximum sum in a tree without adjacencyMedium

  This question evaluates dynamic programming on trees and graph component identification by requiring selection of non-adjacent nodes to maximize a sum, targeting skills in tree algorithms, constraint-based optimization, and rigorous correctness and complexity reasoning.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design in-memory DB with TTL and historyHard

  This question evaluates system design skills around building an in-memory database, focusing on API design, data structures, time/version semantics (TTL and time-travel), filtered querying, and complexity reasoning.

  ZipHQSoftware EngineerSystem DesignTechnical Screen
• Extend a questionnaire condition evaluator with numeric questions and nested AND/OR logicMedium

  A backend practical exercise that extends an existing Python questionnaire parser and condition evaluator. Part one adds numeric questions with numeric comparison conditions; part two adds AND/OR conditions across different questions, including nested groups. Both parts require new automated tests.

  ZipHQSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Find Bugs in an LRU CacheMedium

  Identify behavioral bugs in a Java-based LRU Cache implementation using LinkedHashMap, write minimal failing tests, and provide the corrected code.

  ZipHQBackend EngineerSoftware Engineering FundamentalsTechnical Screen
• Find flush and straight groups in cardsMedium

  This question evaluates array and string manipulation, grouping and sequence-detection competencies, specifically handling same-rank aggregation and same-suit consecutive runs with overlap and maximality considerations.

  ZipHQSoftware EngineerCoding & AlgorithmsOnsite
• Find root IDs and pathsMedium

  This question evaluates understanding of graph/tree relationships, identification of root nodes, and path reconstruction from parent references, assessing algorithmic reasoning and data-structure familiarity.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Guaranteed Capture Time in a Turn-Based Graph GameHard

  Solve guaranteed capture time in a finite turn-based graph pursuit game, including Jerry-first moves, staying, optimal adversarial play, and infinite evasion on cycles.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize non-adjacent sum on an N-ary treeMedium

  This question evaluates skills in tree-based dynamic programming, recursive traversal, and per-node state management for selecting non-adjacent nodes in an N-ary tree.

  ZipHQSoftware EngineerCoding & AlgorithmsTechnical Screen
• Track Repeated Approval Alerts and Safely Update Alert LevelsHard

  Design cached alert counts and rejection decisions with explicit thresholds, level-update semantics, duplicate handling, and recoverable state.

  ZipHQSoftware EngineerSoftware Engineering FundamentalsOnsite