Solve jump maximization and palindromic path queries

Company: Uber

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Take-home Project

Quick Answer: This pair of problems evaluates algorithmic problem-solving skills: the first assesses array-based path optimization and stateful score maximization under constrained jumps, while the second assesses tree traversal combined with character-frequency parity checks for ancestor-path palindromic queries.