An example of an NP-hard problem is the decision subset sum problem, which is this: given a set of integers, does any non-empty subset of them add up to zero?
There are decision problems that are NP-hard but not NP-complete, for example the halting problem.