Quick Overview

This question evaluates algorithmic problem-solving in combinatorial search, state-space optimization, and memoization by asking for the maximum achievable score in a constrained card-removal game; it falls under the Coding & Algorithms domain, specifically combinatorics, search, and dynamic programming.

Maximize score in 15-sum card game

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: This question evaluates algorithmic problem-solving in combinatorial search, state-space optimization, and memoization by asking for the maximum achievable score in a constrained card-removal game; it falls under the Coding & Algorithms domain, specifically combinatorics, search, and dynamic programming.

Loading…