day42

Documentation

Index

• func SubsetSumBrute(ints []int, k int) []int
• func SubsetSumDP(ints []int, k int) []int

Functions

func SubsetSumBrute

func SubsetSumBrute(ints []int, k int) []int

SubsetSumBrute returns the subset by performing a brute-force search. The first possible result is return if found, otherwise the search is exhaustive. The runtime is exponential.

func SubsetSumDP

func SubsetSumDP(ints []int, k int) []int

SubsetSumDP returns the subset using dynamic programming. The runtime is O(N*K) with O(N*K) space.