Quick Overview

This question evaluates competence in dynamic programming for linear optimization and recursion/tree DP for hierarchical structures, as well as the ability to reason about the correctness of greedy heuristics.

Solve Two Robbery Optimization Variants

Company: Flexport

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates competence in dynamic programming for linear optimization and recursion/tree DP for hierarchical structures, as well as the ability to reason about the correctness of greedy heuristics.

Read the full Flexport Software Engineer interview experience this question came from

Loading…