leetcode new problems

2026-05-16 19:35:22 +00:00 · 2026-02-11 14:48:41 +05:30
parent 192ce44a81
commit 0f52d46c67
29 changed files with 658 additions and 5 deletions
@@ -0,0 +1,5 @@
+Time complexity : O(n*m) where is n is the number of strings in the list and m is length of the shortest string
+
+space complexity : O(1)
+
+We start from first character of first string and compare it with all other strings, if no mismatch then add it to prefix string else return the prefix string