Divide and Conquer techniques are those which operate by taking a problem apart, solving pieces, and putting the solutions to those pieces back together to get a solution to the original problem. Examples include dynamic programming and recursion.