Added solutions to challenge 163

2 files changed, 39 insertions, 0 deletions

diff --git a/challenge-163/deadmarshal/c/ch-1.c b/challenge-163/deadmarshal/c/ch-1.c
new file mode 100644
index 0000000000..3c5676c25b
--- /dev/null
+++ b/challenge-163/deadmarshal/c/ch-1.c
@@ -0,0 +1,20 @@
+#include<stdio.h>
+
+int sum_bitwise_operator(int* arr, size_t sz)
+{
+  int sum = 0;
+  for(size_t i = 0; i < sz; ++i)
+    for(size_t j = i+1; j < sz; ++j)
+      sum += arr[i] & arr[j];
+  return sum;
+}
+
+int main(void)
+{
+  int n1[] = {1,2,3};
+  int n2[] = {2,3,4};
+  size_t sz = 3; 
+  printf("%d\n", sum_bitwise_operator(n1,sz));
+  printf("%d\n", sum_bitwise_operator(n2,sz));
+  return 0;
+}
diff --git a/challenge-163/deadmarshal/c/ch-2.c b/challenge-163/deadmarshal/c/ch-2.c
new file mode 100644
index 0000000000..d9e64f50e0
--- /dev/null
+++ b/challenge-163/deadmarshal/c/ch-2.c
@@ -0,0 +1,19 @@
+#include<stdio.h>
+
+int summations(int *arr, size_t sz)
+{
+  for(size_t i = 0; i < sz; ++i)
+    for(size_t j = i+1; j < sz; ++j)
+      arr[j+1] = arr[j] + arr[j+1];
+  return arr[sz-1];
+}
+
+int main(void)
+{
+  int arr[] = {1,2,3,4,5};
+  int arr2[] = {1,3,5,7,9};
+  size_t sz = 5;
+  printf("%d\n", summations(arr, sz));
+  printf("%d\n", summations(arr2, sz)); 
+  return 0;
+}