Longest Common Prefix (LeetCode 14) | Full solution with animations and examples | Study Algorithms

簡介：

Most of the string based problems either revolve around a prefix or a suffix. A prefix is a character or a sequence of characters that occur in the beginning of a string. In this problem we try to find the longest common prefix in an array of strings. We first explore a naive and straight forward approach and then find an optimal solution using a neat little trick called sorting. Watch the video to learn how it makes the problem super easy to solve. All of this along with a dry‑run of code in JAVA. Chapters: 00:00 - Intro 01:03 - Problem statement and description 04:05 - Brute Force Method 07:10 - Efficient/Optimal solution 12:07 - Dry‑run of Code 14:21 - Final Thoughts