From 2ec2f922844f53f0d764186133e165d11ddfe0c9 Mon Sep 17 00:00:00 2001
From: Andre Lammers <andre.lammers@mni.thm.de>
Date: Sat, 26 Oct 2019 16:02:44 +0200
Subject: [PATCH 1/2] Adding leetcode Rotate Array (189.c) and Count Primes
 (204.c)

---
 leetcode/README.md |  2 ++
 leetcode/src/189.c | 11 +++++++++++
 leetcode/src/204.c | 16 ++++++++++++++++
 3 files changed, 29 insertions(+)
 create mode 100644 leetcode/src/189.c
 create mode 100644 leetcode/src/204.c

diff --git a/leetcode/README.md b/leetcode/README.md
index fe701f666..4a62b6a3e 100644
--- a/leetcode/README.md
+++ b/leetcode/README.md
@@ -36,9 +36,11 @@ LeetCode
 |160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [C](./src/160.c)|Easy|
 |169|[Majority Element](https://leetcode.com/problems/majority-element/) | [C](./src/169.c)|Easy|
 |173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [C](./src/173.c)|Medium|
+|189|[Rotate Array](https://leetcode.com/problems/rotate-array) | [C](./src/189.c)|Easy|
 |190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [C](./src/190.c)|Easy|
 |191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C](./src/191.c)|Easy|
 |203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [C](./src/203.c)|Easy|
+|204|[Count Primes](https://leetcode.com/problems/count-primes) | [C](./src/204.c)|Easy|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C](./src/206.c)|Easy|
 |215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c)|Medium|
 |217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c)|Easy|
diff --git a/leetcode/src/189.c b/leetcode/src/189.c
new file mode 100644
index 000000000..192993280
--- /dev/null
+++ b/leetcode/src/189.c
@@ -0,0 +1,11 @@
+void rotate(int* nums, int numsSize, int k){
+  for(int i = 1; i <= k; i++){
+    int j;
+    int lastElement;
+    lastElement = nums[numsSize - 1];
+    for(j = numsSize - 1; j > 0; j--){
+       nums[j] = nums[j - 1];
+    }
+    nums[0] = lastElement;
+  }
+}
\ No newline at end of file
diff --git a/leetcode/src/204.c b/leetcode/src/204.c
new file mode 100644
index 000000000..5614b8f8c
--- /dev/null
+++ b/leetcode/src/204.c
@@ -0,0 +1,16 @@
+int countPrimes(int n){
+    int count = 0;
+    int isPrime;
+    for (int i = 2; i <= n; i++){
+        isPrime = 1;
+        for(int j = 2; j < i; j++){
+            if(i % j == 0){
+                isPrime = 0;
+            }
+        }
+        if(isPrime == 1){
+            count++;
+        }   
+    } 
+    return count;
+}
\ No newline at end of file

From 7c0e52f794b5ab87263cfd3f2b12eb534ed26281 Mon Sep 17 00:00:00 2001
From: Andre Lammers <andre.lammers@mni.thm.de>
Date: Tue, 29 Oct 2019 12:17:07 +0100
Subject: [PATCH 2/2] Remove leetcode Count Primes (204.c)

---
 leetcode/README.md |  1 -
 leetcode/src/204.c | 16 ----------------
 2 files changed, 17 deletions(-)
 delete mode 100644 leetcode/src/204.c

diff --git a/leetcode/README.md b/leetcode/README.md
index 4a62b6a3e..ac18e6933 100644
--- a/leetcode/README.md
+++ b/leetcode/README.md
@@ -40,7 +40,6 @@ LeetCode
 |190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [C](./src/190.c)|Easy|
 |191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [C](./src/191.c)|Easy|
 |203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [C](./src/203.c)|Easy|
-|204|[Count Primes](https://leetcode.com/problems/count-primes) | [C](./src/204.c)|Easy|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C](./src/206.c)|Easy|
 |215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [C](./src/215.c)|Medium|
 |217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C](./src/217.c)|Easy|
diff --git a/leetcode/src/204.c b/leetcode/src/204.c
deleted file mode 100644
index 5614b8f8c..000000000
--- a/leetcode/src/204.c
+++ /dev/null
@@ -1,16 +0,0 @@
-int countPrimes(int n){
-    int count = 0;
-    int isPrime;
-    for (int i = 2; i <= n; i++){
-        isPrime = 1;
-        for(int j = 2; j < i; j++){
-            if(i % j == 0){
-                isPrime = 0;
-            }
-        }
-        if(isPrime == 1){
-            count++;
-        }   
-    } 
-    return count;
-}
\ No newline at end of file