Move_Element_To_End

Author: Partho Biswas

README.md

@@ -750,6 +750,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |09| [Calendar_Matching](algoexpert.io/questions/Calendar_Matching.md) | [Python](algoexpert.io/python/Calendar_Matching.py) |
 |10| [Spiral_Traverse](algoexpert.io/questions/Spiral_Traverse.md) | [Python](algoexpert.io/python/Spiral_Traverse.py) |
 |11| [Monotonic_Array](algoexpert.io/questions/Monotonic_Array.md) | [Python](algoexpert.io/python/Monotonic_Array.py) |
+|12| [Move_Element_To_End](algoexpert.io/questions/Move_Element_To_End.md) | [Python](algoexpert.io/python/Move_Element_To_End.py) |
 
 </p>
 </details>

algoexpert.io/python/Move_Element_To_End.py

@@ -0,0 +1,10 @@
+def moveElementToEnd(array, toMove):
+    left, right = 0, len(array) - 1
+	while left < right:
+		if array[right] == toMove:
+			right -= 1
+		if array[left] != toMove:
+			left += 1
+		if array[left] == toMove and array[right] != toMove:
+			array[left], array[right] = array[right], array[left]
+	return array

algoexpert.io/python/Multi_String_Search.py

@@ -1,22 +1,18 @@
-
 #   Solution 02
 #   O(b^2 + ns) time | O(b^2 + n) space
 def multiStringSearch(bigString, smallStrings):
     modifiedSuffixTrie = ModifiedSuffixTrie(bigString)
     return [modifiedSuffixTrie.conntains(string) for string in smallStrings]
 
-
 class ModifiedSuffixTrie:
     def __init__(self, string):
         self.root = {}
         self.populateModifiedSuffixTrieFrom(string)
 
-
     def populateModifiedSuffixTrieFrom(self, string):
         for i in range(len(string)):
             self.insertSubstringStartinngAt(i, string)
 
-
     def insertSubstringStartinngAt(self, idx, string):
         node = self.root
         for j in range(idx, len(string)):
@@ -25,7 +21,6 @@ def insertSubstringStartinngAt(self, idx, string):
                 node[letter] = {}
             node = node[letter]
 
-
     def conntains(self, string):
         node = self.root
         for letter in string:
@@ -35,10 +30,6 @@ def conntains(self, string):
         return True
 
 
-
-
-
-
 #   Solution 03
 #   O(bs + ns) time | O(ns) space
 def multiStringSearch(bigString, smallStrings):
@@ -50,7 +41,6 @@ def multiStringSearch(bigString, smallStrings):
         findSmallStringsIn(bigString, i, trie, containedString)
     return [string in containedString for string in smallStrings]
 
-
 def findSmallStringsIn(string, startIdx, trie, containedStringns):
     currentNode = trie.root
     for i in range(startIdx, len(string)):
@@ -61,13 +51,11 @@ def findSmallStringsIn(string, startIdx, trie, containedStringns):
         if trie.endSymbol in currentNode:
             containedStringns[currentNode[trie.endSymbol]] = True
 
-
 class Trie:
     def __init__(self):
         self.root = {}
         self.endSymbol = '*'
 
-
     def insert(self, string):
         current = self.root
         for i in range(len(string)):