LintCode & LeetCode
Ctrlk
  • Introduction
  • Linked List
  • Binary Search
  • Hash Table
  • String
  • Array
  • Matrix
  • Queue
  • Stack
  • Heap
  • Data Structure & Design
  • Union Find
  • Trie
  • Trees
  • Segment Tree
  • Binary Indexed Tree
  • Graph & Search
  • Backtracking
    • Subsets
    • Subsets II
    • Letter Combinations of a Phone Number
    • Permutations
    • Permutations II
    • Combinations
    • Combination Sum
    • Combination Sum II
    • Combination Sum III
    • Combination Sum IV
    • N-Queens
    • N-Queens II
    • Generate Parentheses
    • Subsets of Size K
  • Two Pointers
  • Mathematics
  • Bit Operation
  • Random
  • Dynamic Programming
  • Knapsack
  • High Frequency
  • Sorting
  • Greedy
  • Minimax
  • Sweep Line & Interval
  • Other Algorithms and Data Structure
  • Company Tag
  • Problem Solving Summary
  • Reference
Powered by GitBook
On this page

Was this helpful?

  1. Backtracking

Combination Sum IV

https://leetcode.com/problems/combination-sum-iv/discuss/85036/1ms-Java-DP-Solution-with-Detailed-Explanation

PreviousCombination Sum IIINextN-Queens

Last updated 5 years ago

Was this helpful?