The Shifted Convolution Problem (SCP) is a seemingly technical, yet natural, problem going back to Kloosterman and Ingham. It aims at showing cancellations in partial sums of Rankin/Selberg type where one argument has a non trivial additive shift. One application of the SCP is to provide full solution of many instances of another problem: the Subconvexity Problem for $L$-functions (ScP). It this talks we review the various methods and ingredients that can be put into the solution of the SCP as well a few new instances of the ScP one can get with it.