Quick Overview

This question evaluates algorithmic problem-solving in combinatorial optimization and dynamic programming, testing competency with cost-minimization, constraint handling (exact counts per destination), and trade-offs between greedy heuristics and DP formulations.

Minimize Travel Assignment Cost

Company: Bloomberg

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates algorithmic problem-solving in combinatorial optimization and dynamic programming, testing competency with cost-minimization, constraint handling (exact counts per destination), and trade-offs between greedy heuristics and DP formulations.

Loading…