From a psychological perspective, overcoming the barriers of a complex problem is often facilitated by problem decomposition. Since complex problems generally lack standard or clear solution paths, decomposing them into smaller parts allows individuals or systems to tackle the corresponding sub-problems with significantly less effort.

Google

Problem decomposition is a broad paradigm for breaking down complex challenges into simpler, more manageable sub-problems, making them easier to tackle with less effort. This approach has been extensively explored in both psychology and computer science. In the context of Natural Language Processing, it is a major focus for enhancing the reasoning capabilities of Large Language Models by allowing them to design multi-step reasoning paths to solve complex tasks.

Problem Decomposition

Reference of Foundations of Large Language Models Course

The divide-and-conquer paradigm is a prominent algorithm design strategy rooted in problem decomposition. It works by recursively breaking down a computational problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem.

Divide-and-Conquer Paradigm

An example of a computational problem that can be assigned to a Large Language Model is to determine whether a given document discusses the risks of AI. This task can be presented to the LLM through a specific prompt.

Example of a Classification Task for LLMs: Identifying AI Risks in a Document

Large Language Models can be employed to solve complex reasoning tasks through three distinct methods. The first involves the LLM predicting a conclusion directly, relying on a hidden and uninterpretable internal reasoning mechanism. The second method prompts the LLM to generate a full multi-step reasoning path and the final answer within a single run, as exemplified by Chain-of-Thought. The third approach uses problem decomposition to break the task into sub-problems, which are then addressed in separate LLM interactions or by other specialized systems.

Approaches to Multi-Step Reasoning in LLMs

A two-step approach to problem decomposition treats sub-problem generation and solving as distinct, sequential phases. The first step involves decomposing the entire problem into a complete set of sub-problems at once, such as creating an outline for a blog. The second step focuses on solving these sub-problems, either sequentially or in a different order, and then combining their solutions to form the final output. This straightforward method is particularly well-suited for compositional tasks like writing and code generation, as it assumes the sub-problems can be solved independently.

Two-Step Problem Decomposition

For complex reasoning tasks with non-linear solution paths, pre-defining all sub-problems is often ineffective. A more suitable strategy is to generate sub-problems dynamically, adapting to the specific input and intermediate results as they emerge during the reasoning process. This on-the-fly approach increases the difficulty of problem decomposition, making it more challenging than designing standard divide-and-conquer algorithms.

Dynamic Problem Decomposition for Complex Reasoning

Compositionality in Natural Language Processing is the principle that the meaning of a complex expression is determined by the meanings of its constituent parts and the rules used to combine them. This concept is fundamental to tasks like semantic parsing, where sentences are broken down into their components to derive a structured meaning representation, and is broadly related to the strategy of problem decomposition.

Compositionality in NLP

For complex generative tasks like writing a blog post, outlining is an effective problem decomposition strategy. This method moves beyond a single, high-level prompt, which often yields disorganized results. It involves first creating a structured outline that breaks the task into smaller sections. Subsequently, detailed instructions or information are provided for each section, guiding the LLM to generate a more coherent and well-organized final output.

Outlining as a Method of Problem Decomposition for Generative Tasks

The general framework for problem decomposition is structured around two core components: sub-problem generation, which involves breaking down the main problem into smaller parts, and sub-problem solving, where these individual parts are addressed to construct the final solution.

General Framework of Problem Decomposition

A team is using a large language model to automate complex tasks. They decide to implement a strategy where a main problem is broken down into a complete, fixed list of sub-problems *before* the model begins to solve any of them. The model will then solve each sub-problem in sequence. For which of the following tasks is this pre-defined decomposition approach LEAST likely to succeed?

Based on the engineer's proposed strategy, evaluate its effectiveness for handling a wide variety of complex, multi-step questions. Identify and explain one significant potential weakness of this approach.

Evaluating a Problem Decomposition Strategy for Multi-Hop QA

When assigning a complex generative task to a Large Language Model, such as writing a blog about AI risks, a simple, high-level prompt like 'write a blog about the risks of AI' can result in an output with an arbitrary and potentially disorganized structure. This example highlights the advantage of decomposing the problem first, for instance by creating an outline, to guide the LLM in producing a more structured and coherent result.

Illustrating the Need for Decomposition in Generative Tasks

Complex reasoning problems are challenges characterized by dynamic and non-predetermined solution paths. The sequence of steps required to solve them is not fixed; it can vary between different problem instances, and each step in the reasoning process often depends on the outcomes of the preceding ones.

Complex Reasoning Problems

Multi-hop question answering is a task in Natural Language Processing where a system must gather and synthesize information from multiple text sources to formulate a correct response to a complex question. This process often necessitates the decomposition of the original question into a series of simpler, answerable sub-questions, with the final answer being constructed from the intermediate results.

Multi-hop Question Answering

A development team is building several applications powered by a large language model. Match each application's primary task with the most suitable strategy for breaking down the problem.

You are leading an internal enablement team building an LLM-powered assistant to produce a board-ready “AI Risk & Compliance Brief” from a 60-page draft policy, 12 incident tickets, and 3 regulator updates. The brief must be accurate, traceable to sources, and consistent across sections (e.g., the risk taxonomy used in the executive summary must match the detailed findings). You have observed two failure modes in a prototype: (1) the model generates a good outline but later sections contradict earlier claims, and (2) some sub-questions (e.g., “Which incidents map to which regulatory obligations?”) are still too complex and the model gives shallow answers.

Write an essay proposing a concrete end-to-end problem-decomposition workflow that addresses these failures. Your answer must: (a) show how you will generate sub-problems (including at least one example of a well-formed sub-problem), (b) explain how you will solve sub-problems sequentially while carrying forward context using explicit Q/A pairs (include a short illustrative snippet of what the prompt/context for a later step would look like), (c) identify at least one sub-problem that should be decomposed recursively and demonstrate what the next level of sub-problems would be, and (d) justify the tradeoffs of your design (e.g., quality/consistency vs. token cost/latency, and how your approach reduces contradictions and shallow reasoning).

Designing a Decomposition-Driven LLM Workflow for a High-Stakes Corporate Task

You are the product owner for an internal LLM assistant that must answer employee questions about a new travel-and-expense (T&E) policy by reading a 40-page policy PDF and producing a final, auditable answer with citations. The team implemented a decomposition workflow: (1) generate a fixed list of sub-questions up front, (2) answer them one-by-one, and (3) synthesize a final response. In pilot, the assistant often gives a confident but wrong final answer when later sub-questions depend on definitions or exceptions discovered mid-way (e.g., a term like “client entertainment” is defined in an appendix and changes how earlier answers should be interpreted). 

Write an evaluation and redesign proposal that explains: (a) how you would change sub-problem generation to be dynamic and allow new sub-questions to be created as intermediate answers reveal missing dependencies, (b) when and how you would use recursive decomposition for a sub-problem that is still too complex to answer directly (give one concrete example sub-problem and its recursive breakdown), and (c) how you would structure sequential sub-problem solving so that each step receives the original question plus prior question–answer pairs as context, including what you would include/exclude to reduce error propagation and context bloat. Your answer should make clear the causal links and tradeoffs among decomposition, recursion, and contextual QA carry-forward, and it should end with a brief description of how the final synthesis would use the accumulated sub-answers to produce an auditable response.

Debugging a Decomposition-Based LLM Workflow Using Recursive Sub-Problems and Contextual QA Pairs

You are leading an internal enablement team building an LLM-powered assistant to answer employee questions about a 120-page, frequently updated Benefits & HR policy PDF. The assistant must answer multi-hop questions (e.g., “If I switch from full-time to part-time mid-year, how does that affect my HSA eligibility and the employer match, and what forms do I need?”). You have a strict constraint: each user question can trigger at most 6 LLM calls, and the total context window is limited, so you cannot paste the entire policy or all prior intermediate work into every call.

A junior engineer proposes this workflow:
1) Generate a fixed list of 10 sub-questions up front for any user query.
2) Solve them in order.
3) For each step, only pass the immediately previous sub-question and answer (not the original user question or earlier Q/A pairs).
4) If a sub-question is hard, “just ask the model to think harder,” without further decomposition.

Write an evaluation of this proposed workflow and then propose a revised workflow that would be more reliable under the constraints. Your answer must (a) explain how you would generate sub-problems so they are neither too generic nor too rigid, (b) describe when and how you would apply recursive decomposition to a sub-problem that is still too complex, and (c) specify exactly what contextual information you would carry forward between sequential steps (e.g., which Q/A pairs, what summaries, what citations) and why that choice improves correctness while respecting the context-window and 6-call limits. Conclude by describing one concrete failure mode your redesign prevents and the mechanism by which it prevents it.

Evaluating and Redesigning a Decomposition Workflow Under Context and Cost Constraints

You are implementing an internal LLM assistant to help a legal-ops team review vendor contracts for (1) data-processing obligations, (2) security requirements, and (3) termination/liability clauses. The assistant must produce a final one-page risk summary with citations to the contract text. In a pilot, the team used a single prompt and got a confident but inconsistent summary. They then tried a fixed list of sub-questions, but the model still missed a critical cross-reference: a security addendum that changes the definition of “Confidential Information,” which in turn affects the liability cap.

Design a decomposition-based workflow that (a) generates sub-problems, (b) solves them sequentially while carrying forward context as question–answer pairs, and (c) uses recursive decomposition when a sub-problem is too complex (e.g., resolving definitions and cross-references). Your answer must specify: the initial set of sub-problems you would generate, the order you would solve them in, what each step’s stored QA pair should contain to support later steps, and one example of a sub-problem that should trigger recursive decomposition (including what the second-level sub-problems would be).

Designing a Decomposition-and-QA-Pair Workflow for Contract Review with Recursive Escalation

You are leading an internal team deploying an LLM to triage inbound customer emails for a regulated financial-services product. The system must (1) classify each email into one of five queues (Billing, Technical Issue, Account Access, Complaint, Potential Fraud), (2) extract any required follow-up questions to ask the customer, and (3) produce a short agent-facing rationale that cites only information present in the email. The current design uses a fixed list of sub-problems generated up front and then solved in order. In production, you observe two recurring failures: (a) the model asks irrelevant follow-up questions because it forgets constraints discovered earlier (e.g., it already determined the customer is locked out but later asks for billing details), and (b) some emails contain nested issues (e.g., a complaint that includes a potential fraud indicator) that the fixed decomposition misses, leading to misrouting.

As the owner, propose a revised end-to-end LLM interaction plan that addresses both failures by combining: (i) how you will generate sub-problems, (ii) how you will solve them sequentially while preserving intermediate results, and (iii) when and how you will trigger recursive decomposition for a sub-problem that turns out to be too complex or multi-faceted. Your answer must include at least one concrete example of a contextual QA pair you would carry forward and explain how it changes the next sub-problem’s prompt or decision.

Stabilizing a Decomposition-Based LLM Workflow for a Regulated Customer-Email Triage System

You are building an internal LLM-powered assistant for Site Reliability Engineers (SREs) to produce a root-cause analysis (RCA) draft within 30 minutes of a Sev-2 incident. The assistant receives: (1) a short incident timeline written by the on-call engineer, (2) links to 6 log excerpts (plain text), and (3) a runbook. The assistant must output an RCA draft with: suspected root cause, contributing factors, customer impact, and 3 concrete follow-up actions.

Constraints: The LLM context window is limited, so you cannot paste all logs at once. The incident timeline is sometimes wrong or incomplete. Some sub-questions (e.g., “What changed in the last deploy?”) often require further breakdown (e.g., identify deploy ID → list changed services → inspect config diffs). You also need traceability: the RCA draft must cite which intermediate findings it relied on.

Case study task: Propose a decomposition-based workflow that (a) generates an initial set of sub-problems, (b) solves them sequentially while carrying forward prior Q/A pairs as context, and (c) supports recursive decomposition when a sub-problem is too complex to answer directly. Then, justify one key design tradeoff you make between (i) generating all sub-problems up front vs generating them dynamically as new evidence appears, and (ii) including all prior Q/A pairs vs selectively summarizing them to fit the context window. Your answer should be specific enough that an engineer could implement the prompting/orchestration logic.

Designing a Decomposition Workflow for Root-Cause Analysis of a Production Incident

You are building an internal LLM workflow that produces a board-ready narrative explaining *why* a key KPI moved this quarter, using three inputs: (1) a table of KPI values by week, (2) a list of major product/ops events with dates, and (3) a short set of analyst notes that may be incomplete or partially wrong. The narrative must cite which input(s) support each claim and must avoid contradictions across sections.

Create a decomposition-based workflow that the LLM (and/or tools) will follow. Your design must include:
1) An initial set of sub-problems (as explicit questions) that are solved sequentially.
2) For each sub-problem, specify what context is passed in (including how you will carry forward prior Q/A pairs) and what the expected output format is.
3) At least one point where the workflow can *recursively decompose* a sub-problem if the model cannot confidently answer (e.g., conflicting evidence, missing dates, ambiguous causality). Describe the trigger condition and the recursive sub-questions.
4) A final synthesis step that combines the accumulated Q/A pairs into the narrative while enforcing consistency and traceability.

Keep your answer concrete: provide 5–8 sub-problem questions, show an example of the context bundle for sub-problem #3 (what exactly is included), and describe the recursive branch in enough detail that an engineer could implement it.

Create a Recursive, Context-Carrying Decomposition Plan for LLM-Assisted KPI Narrative Generation

You are building an internal LLM assistant to answ...

You are designing an internal LLM workflow to answ...

You’re building an internal LLM workflow to answer...

Your team is rolling out an internal LLM assistant...

You’re building an internal LLM workflow to produc...

You’re building an internal LLM assistant to help ...

You’re leading an internal enablement team buildin...

You are deploying an LLM inside an internal finance tool that must answer multi-step policy questions (e.g., “Is this expense reimbursable given these 6 policy clauses and these 3 trip details?”). Constraints: (1) you have a strict context window budget, so you can include at most ONE short worked example in the prompt; (2) the model’s first-pass answers are often incomplete (it sometimes explains reasoning but forgets to state a final decision); (3) you need a workflow that is reliable across many different question shapes, not just one template.

Write an essay proposing a concrete prompting workflow that combines: in-context learning (if you use it), chain-of-thought prompting (including whether you would use zero-shot CoT), explicit problem decomposition (including whether you would use a least-to-most progression), and an iterative self-refinement loop. Your answer must (a) explain why your chosen combination fits the constraints, (b) describe the exact sequence of LLM calls or prompt sections you would use, (c) explain how intermediate sub-answers feed into later steps, and (d) specify how you will force a clear final decision despite the risk of incomplete zero-shot CoT outputs. Include at least two tradeoffs you are accepting (e.g., latency vs. accuracy, context budget vs. guidance, error propagation vs. transparency) and how you would mitigate them.

Choosing and Justifying a Prompting Strategy Under Context and Quality Constraints

You are deploying an LLM inside a corporate workflow to draft a first-pass analysis for a high-stakes internal decision memo (e.g., whether to approve a vendor contract). The input is a long, messy bundle of notes and constraints, and early pilots show two failure modes: (1) when asked directly, the model misses key constraints and produces confident but shallow conclusions; (2) when you add a generic “let’s think step by step” instruction, it produces lengthy reasoning but sometimes never states a clear final recommendation.

Write a proposed prompting workflow (you may describe it as a sequence of prompts) that uses: in-context learning with demonstrations, chain-of-thought prompting (including a zero-shot trigger where appropriate), least-to-most prompting, explicit problem decomposition, and an iterative self-refinement loop. Your answer must explain how these techniques work together (not independently) to reduce the two failure modes above, and must justify at least two tradeoffs you are making (e.g., latency/cost vs. accuracy, transparency vs. risk of overlong reasoning, fixed vs. dynamic decomposition). Conclude by giving one concrete example of a “final answer formatting” instruction you would include to ensure the model always outputs a clear recommendation at the end.

Designing a Prompting Workflow for a High-Stakes, Multi-Step Task

You are building an internal LLM assistant that helps a finance operations team investigate invoice-payment discrepancies. A typical ticket requires (a) extracting key entities from a messy email thread, (b) reconciling amounts across two systems, (c) identifying the most likely root cause (e.g., duplicate invoice, partial payment, currency conversion, timing), and (d) drafting a customer-facing explanation.

Your first implementation uses a single prompt with the full ticket text and the instruction “Let’s think step by step and give the final answer.” It often produces plausible reasoning but (1) misses a critical sub-check (e.g., currency conversion), (2) sometimes never states a clear final conclusion, and (3) varies in format so downstream automation breaks.

Write an essay that proposes a revised prompting workflow that integrates: in-context learning (demonstrations), explicit problem decomposition, least-to-most sequencing of sub-problems, chain-of-thought prompting (including when you would use zero-shot CoT vs a demonstrated CoT example), and an iterative self-refinement loop. Your answer must explain how these elements work together (not as independent tips), what tradeoffs you are making (e.g., context length, reliability, error propagation), and include at least two concrete prompt snippets (not full prompts) that illustrate (i) how you would elicit structured intermediate reasoning while still forcing a final answer, and (ii) how you would run critique-and-revision in self-refinement without losing the decomposed structure.

Diagnosing and Redesigning a Prompting Approach for a Decomposed Workflow

You are deploying an internal LLM assistant to help procurement analysts decide whether a proposed vendor contract requires (a) a standard review, (b) an enhanced review, or (c) an automatic rejection. The decision depends on multiple interdependent rules (e.g., data types handled, cross-border transfers, subcontractors, and exception clauses). In pilot testing, a single prompt that asks for the final decision often misses a key condition; a zero-shot “Let’s think step by step” prompt sometimes produces a long rationale but forgets to clearly state the final decision; and when you add a few demonstrations, the model becomes more consistent but still makes occasional early-step mistakes that cascade into the wrong outcome.

Design a prompting workflow (you may describe it as a sequence of LLM calls) that uses: (1) in-context learning via demonstrations, (2) explicit problem decomposition in a least-to-most progression, and (3) an iterative self-refinement loop. Your answer must explain how information flows from one step to the next, how you would prevent or detect cascading errors from early steps, and how you would ensure the model always outputs an unambiguous final decision label (a/b/c) even when using chain-of-thought style reasoning.

Stabilizing an LLM Workflow for Multi-Step Policy Compliance Decisions

You are rolling out an internal LLM assistant for Legal Ops to triage vendor contract clauses into three labels: (A) "standard/low risk", (B) "needs legal review", (C) "reject". The assistant must also produce a short justification that can be audited. In a pilot, you observe two recurring failures: (1) on complex clauses, the model gives confident but wrong labels unless it is guided through intermediate reasoning; (2) when you add a simple instruction like "Let’s think step by step," the model often produces a long rationale but sometimes forgets to output a clear final label.

You are not allowed to fine-tune the model. You can only change the prompting workflow and the content placed in the prompt. You have a strict context window budget, so you can include at most ONE worked example in the prompt, and you must keep the number of model calls per clause to no more than 3.

Case: A new clause says: "Vendor may use Customer Data to improve its services and may share Customer Data with affiliates and subcontractors for that purpose. Customer may opt out of data sharing by emailing support within 10 days of signing." Your policy requires: (i) no sharing of Customer Data with third parties for model training/service improvement unless explicitly prohibited or strongly constrained; (ii) opt-out mechanisms are considered insufficient for sensitive data; (iii) subcontractor access must be tightly limited.

Design a prompting workflow (describe the sequence of prompts/calls and what each prompt contains) that uses in-context learning, problem decomposition/least-to-most prompting, chain-of-thought (including zero-shot CoT where appropriate), and self-refinement to reduce both failure modes while staying within the constraints. Your answer must explain how the techniques interact (e.g., why you place a worked example where you do, how you decompose the decision, how you ensure a final label is always produced, and how critique/revision is used without exceeding 3 calls).

Debugging a Multi-Step LLM Workflow for Contract Clause Risk Triage

You are rolling out an internal LLM assistant for SREs to perform root-cause analysis (RCA) from incident artifacts. The assistant receives: (1) a short incident timeline, (2) 30–60 lines of logs, and (3) a list of recent deploys. The desired output is a single RCA summary with: likely cause, supporting evidence, and a recommended next action.

Constraints: You can only include ONE short demonstration in the prompt due to context limits; the assistant must work on novel incidents; and the first pilot showed two failure modes: (a) the model jumps to a plausible cause without checking evidence across artifacts, and (b) when you add “Let’s think step by step,” it sometimes produces a long analysis but forgets to state a clear final RCA.

As the prompt/workflow designer, propose a concrete prompting plan that combines: (i) in-context learning with the single demonstration, (ii) explicit problem decomposition (including a least-to-most style progression of sub-questions), (iii) chain-of-thought elicitation (including how you would use or avoid zero-shot CoT triggers), and (iv) self-refinement (critique + revision) to reduce both failure modes. Your answer must include the exact structure of the prompt(s) you would send (section headings and what each section contains) and explain why each component is placed where it is.

Designing a Robust Prompting Workflow for Multi-Step Root-Cause Analysis with Limited Examples

Psychological Perspective on Problem Decomposition

In Large Language Models (LLMs), integrating external tools is a practical application of problem decomposition. Since LLMs may lack real-time or highly specific accurate data (like stock prices or weather updates) after training or fine-tuning, they can be connected with external APIs. To fulfill a complex query, the LLM decomposes the task into sub-problems: it handles parts of the query internally while generating specific markers to call external tools for the remaining sub-problems, effectively merging internal generation with external data retrieval.

Learn Before

Related