New Sol

Author: rahulcode22

Arrays/neigh.py

@@ -0,0 +1,15 @@
+#Solution not completed
+from collections import Counter
+def neigh(st):
+    toCheck = "neigh"
+    lis = []
+    for i in toCheck:
+        lis.append(st.count(i))
+    min_ =min(lis)
+    if len(set(lis)) == 1:
+        return min_
+    else:
+        return min_
+
+st = 'n'
+print neigh(st)

String/Count-and-Say.py

@@ -0,0 +1,35 @@
+'''
+The count-and-say sequence is the sequence of integers beginning as follows:
+1, 11, 21, 1211, 111221, ...
+1 is read off as one 1 or 11.
+11 is read off as two 1s or 21.
+
+21 is read off as one 2, then one 1 or 1211.
+
+Given an integer n, generate the nth sequence.
+
+Note: The sequence of integers will be represented as a string.
+
+Example:
+
+if n = 2,
+the sequence is 11.
+
+'''
+def countAndSay(n):
+    s = '1'
+    for i in range(n-1):
+
+        let ,temp ,count = s[0], '', 0
+        for l in s:
+            if let == l:
+                count += 1
+            else:
+                temp += str(count) + let
+                let = l
+                count = 1
+        temp += str(count) + let
+        s = temp
+    return s
+
+print countAndSay(4)

String/Longest-Common-Prefix.py

@@ -0,0 +1,65 @@
+'''
+Write a function to find the longest common prefix string amongst an array of strings.
+
+Longest common prefix for a pair of strings S1 and S2 is the longest string S which is the prefix of both S1 and S2.
+
+As an example, longest common prefix of "abcdefgh" and "abcefgh" is "abc".
+
+Given the array of strings, you need to find the longest S which is the prefix of ALL the strings in the array.
+'''
+def checkPrefix(prefix,st):
+    j = 0
+    len_ = 0
+    for i in range(len(prefix)):
+        if st[i] != prefix[j]:
+            break
+        j += 1
+        len_ +=1
+    return prefix[0:len_]
+
+def LCP(arr):
+    min_ = len(arr[0])
+    index = 0
+    for i in range(1,len(arr)):
+        m = len(arr[i])
+        if m < min_:
+            min_ = m
+            index = i
+    prefix = arr[index]
+    for i in arr:
+        prefix = checkPrefix(prefix,i)
+
+    return prefix
+
+arr = [ "aaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" ]
+print LCP(arr)
+
+
+
+
+
+
+#Divide and Conquer Approach
+def commonPrefix(st1,st2):
+    j = 0
+    len = 0
+    for i in range(min(len(st1),lem(st2))):
+        if st1[i] != st2[j]:
+            break
+        else:
+            j += 1
+            len += 1
+    return st1[0:len]
+
+
+def LongestCommonPrefix(arr):
+    low = 0
+    high = len(arr)
+    if low == high:
+        return arr[low]
+    if  low < high:
+        mid = (high - low)/2
+        st1 = LongestCommonPrefix(arr,low,mid)
+        st2 = LongestCommonPrefix(arr,mid+1,high)
+
+        return commonPrefix(st1,st2)

String/Reverse-Strings.py

@@ -0,0 +1,10 @@
+'''Given an input string, reverse the string word by word.'''
+class Solution:
+    # @param A : string
+    # @return string
+    def reverseWords(self, a):
+
+        s = a.split()
+        s.reverse()
+        res = " ".join(s)
+        return res