[STRATEGY] - Longest Common Prefix

.github/pull_request_template.md

@@ -23,10 +23,9 @@
 
 Before submitting, please ensure:
 - [ ] Code compiles without errors
-- [ ] All tests pass
 - [ ] Code follows the existing style guide
 - [ ] No console.log statements in strategy
 - [ ] Time and space complexity updated in PR
 - [ ] Edge cases are handled
 
-**Thank you**
+**Stay Locked In!**

dist/leetCodeStyle/index.js

@@ -20,6 +20,7 @@ const hillsAndValleysCount_1 = require("./pointers/hillsAndValleysCount");
 const maxProductSubarry_1 = require("./pointers/maxProductSubarry");
 const rotatedArraySearch_1 = require("./search/rotatedArraySearch");
 const zeroFilledSubArrlength_1 = require("./arrayManipulation/zeroFilledSubArrlength");
+const longestCommonPrefix_1 = require("./slidingWindow/longestCommonPrefix");
 // TwoSum1: No pair adds to 100
 const twoSum1 = new twoSum1_1.TwoSumStrategy1();
 (0, problemSolvingExec_1.exec)(twoSum1, { nums: [1, 2, 3, 4, 5], target: 100 }); // ➞ [-1,-1]
@@ -77,3 +78,6 @@ const rotatedArraySearch = new rotatedArraySearch_1.RotatedArraySearchStrategy()
 //ZeroFilledSubArray: Expected 6 as output
 const zeroFilledSubArray = new zeroFilledSubArrlength_1.zeroFilledSubArrayStrategy();
 (0, problemSolvingExec_1.exec)(zeroFilledSubArray, { nums: [1, 3, 0, 0, 2, 0, 0, 4] });
+//LongestCommonPrefix: Expected "" as output
+const longestCommonPrefix = new longestCommonPrefix_1.LongestCommonPrefixStrategy();
+(0, problemSolvingExec_1.exec)(longestCommonPrefix, { array: ["hello", "", "world", "help"] });

dist/leetCodeStyle/slidingWindow/longestCommonPrefix.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LongestCommonPrefixStrategy = void 0;
+class LongestCommonPrefixStrategy {
+    contextFunction(params) {
+        const { array } = params;
+        if (!array.length)
+            return "";
+        const sortedLen = array.sort((a, b) => b.length - a.length);
+        let currentWin = sortedLen[0];
+        for (let i = 1; i < sortedLen.length; i++) {
+            while (!sortedLen[i].startsWith(currentWin)) {
+                currentWin = currentWin.slice(0, -1);
+                if (currentWin == "")
+                    return "";
+            }
+        }
+        return currentWin;
+    }
+}
+exports.LongestCommonPrefixStrategy = LongestCommonPrefixStrategy;

dist/leetCodeStyle/types.js

@@ -1,3 +1,2 @@
 "use strict";
-// Parameter interfaces for all strategy classes
 Object.defineProperty(exports, "__esModule", { value: true });