We discuss the expected length of the longest common subsequence between two random strings of lengths n each, and show that it grows linearly with n. This lecture originally contained a discussion both of the expected length of the longest common subsequence and the expected length of the longest common substring. But the video has been split to overcome some technical problems that showed up in the original video.