Quick Overview

Find every unique combination that reaches a target when each input occurrence may be used once and candidates may be negative. The prompt defines duplicate handling and deterministic ordering while ruling out positive-only pruning that would miss valid combinations.

Find Unique One-Use Combination Sums with Negative Values

Company: ByteDance

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Overview: Find every unique combination that reaches a target when each input occurrence may be used once and candidates may be negative. The prompt defines duplicate handling and deterministic ordering while ruling out positive-only pruning that would miss valid combinations.

Loading…