Does every undecidable problem contain a decidable subset? I know being a decidable language doesn't necessarily mean that every subset is of it is decidable, but does every undecidable language contain a decidable subset?
Yes. The empty language is decidable and subset of every other language.
You can also say that every undecidable language has a superset which is decidable ($\Sigma^\ast$ for example).