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

Description:

👉 👉 Super helpful resources available here: To see more videos like this, you can buy me a coffee: 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 Actual problem on LeetCode: 📚 Links to topics I talk about in the video: Brute Force Paradigm: Problems on Strings: Quick Sort Algorithm: Recursion based algorithm: What is Big O?: 📘 A text based explanation is available at: Code on Github: Test-cases on Github: 📖 Reference Books: Starting Learn to Code: Favorite book to understand algorithms: Favorite book for data structures: Get started for interview preparation: 🔗 To see more videos like this, you can show your support on: 🎥 My Recording Gear: Recording Light: Microphone: Recording Camera: Tablet to sketch and draw: Surface Pen: Laptop to edit videos: 💻 Get Social 💻 Follow on Facebook at: Follow on Twitter at: Follow on Tumblr at: Subscribe to RSS feeds: Join fan mail: #leetcode #programming #interview