Coding Challenge from Leetcode - Longest Common Prefix!

Went live to do a coding challenge from Leetcode.com called Longest Common Prefix!

Problem:
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string "".

Solution summary:
— Intuition / tip: vertical scanning - compare characters from top to bottom on the same column (same character index of the strings) before moving on to the next column
— Loop through the first string in the array of string
— For each character in the first string, then loop through that character’s index in all the rest of the strings
— Check whether the first string’s current character equals the rest of the strings current character
— Create a boolean to to hold if you find there is a mismatch
— After check an character index for all strings, if all characters matched, then add it to a result variable, if not, break and return the current result
— Time complexity: O(s) where s is the sum of all characters in all of the string (worst case)
— Space complexity: O(1) / constant

Let me know if you have any questions or see ways I could have optimized!

Let's connect!
? Website | https://www.kg.codes
? Subscribe | www.youtube.com/channel/UCfv7SNcMWwn8QANjD7AgY5w?sub_confirmation=1
? Instagram | www.instagram.com/kg.codes/
? TikTok | https://www.tiktok.com/t/ZTRLxP4wf/
? Twitter | www.twitter.com/kgcodes/

Get my coding gear / desk setup ???
? Amazon | https://www.amazon.com/shop/kg.codes/list/3E7C7N52AFY8R