added target array in given order

Author: willdoescode

README.md

@@ -7,4 +7,5 @@
 * [Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)
 * [FizzBuzz](https://leetcode.com/problems/fizz-buzz/)
 * [Smaller Numbers Then Current](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)
-* [Number Of Steps To Reach Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)
+* [Number Of Steps To Reach Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)
+* [Create Target Array In Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)

haskell-things.cabal

@@ -18,4 +18,9 @@ executable haskell-things
   main-is:             Main.hs
   default-language:    Haskell2010
   build-depends:       base >= 4.7 && < 5, containers
-  other-modules:       TwoSum, FizzBuzz, RunningSum, SmallerNumbersThanCurrent, NumOfStepsToReduceNumToZero
+  other-modules:       TwoSum
+                       , FizzBuzz
+                       , RunningSum
+                       , SmallerNumbersThanCurrent
+                       , NumOfStepsToReduceNumToZero
+                       , TargetArrayInGivenOrder

src/Main.hs

@@ -5,6 +5,7 @@ import TwoSum
 import RunningSum
 import SmallerNumbersThanCurrent
 import NumOfStepsToReduceNumToZero
+import TargetArrayInGivenOrder
 
 main :: IO ()
 main = do
@@ -22,3 +23,6 @@ main = do
   print $ numOfStepsToReduceNumToZero 14
   print $ numOfStepsToReduceNumToZero 8
   print $ numOfStepsToReduceNumToZero 123
+  putStrLn "<-- Target Array In Given Order -->"
+  print $ targetArrayInGivenOrder [0, 1, 2, 3, 4] [0, 1, 2, 2, 1]
+  print $ targetArrayInGivenOrder [1, 2, 3, 4, 0] [0, 1, 2, 3, 0]

src/TargetArrayInGivenOrder.hs

@@ -0,0 +1,13 @@
+module TargetArrayInGivenOrder ( targetArrayInGivenOrder ) where
+
+-- https://leetcode.com/problems/create-target-array-in-the-given-order/submissions/
+
+targetArrayInGivenOrder :: [Int] -> [Int] -> [Int]
+targetArrayInGivenOrder nums index = targetArrayInGivenOrder' l []
+  where l = zip nums index
+
+targetArrayInGivenOrder' :: [(Int, Int)] -> [Int] -> [Int]
+targetArrayInGivenOrder' (h:t) l =
+  targetArrayInGivenOrder' t (let (ys, xs) = splitAt (snd h) l in ys ++ [fst h] ++ xs)
+
+targetArrayInGivenOrder' [] x = x