[STRATEGY] - Longest Common Prefix

[thenameisvicky]

Problem Description

longest common prefix string amongst an array of strings., If there is no common prefix, return an empty string.

Type of Problem solved

• Leetcode Algorithum
• Engineering Drill

Approach

• Need to find the longest common prefix in the Array.
• First sort the array in ascending order keeping length of each word in array as unit.
• Assign the first word in sorted array as a window by initializing one ( currentWindow ).
• Utilizing this window i will compare the elements in the array starting with the currentWindow or not, while not then i shrink the window by slicing the last letter in the window.
• When ever i encounter empty string in this process i return it.
• After completing the comparison using for loop i return the currentWindow which is the longest common prefix.

Changes Made

• Have added parameter type in type declarations file.
• Have written new strategy under sliding window topic.

Learnings

• Learnt about loops and window shrinking.
• Improved knowledge in sliding window topic.

Alternate Approaches

• Divide and conquer method
• Binary search method for effiency
• Two Pointer Techinique

Edge Cases Covered

• [ "hello", "" , "hi", "hell" ]

Make sure to check

Before submitting, please ensure:

• Code compiles without errors
• Code follows the existing style guide
• No console.log statements in strategy
• Time and space complexity updated in PR
• Edge cases are handled

Stay Locked In!