edit

Author: kallyy7

05.Arrays/Arrays

@@ -0,0 +1,58 @@
+using System;
+using System.Linq;
+
+public class LargestCommonEnd
+{
+    public static void Main()
+    {
+        string[] firstLine = Console.ReadLine().Split();
+        string[] secondLine = Console.ReadLine().Split();
+
+        GetLargestCommonEnd(firstLine, secondLine);
+    }
+    private static void GetLargestCommonEnd(string[] firstLine, string[] secondLine)
+    {
+        int min = Math.Min(firstLine.Length, secondLine.Length);
+        int halfLenght = min / 2;
+        int leftCount = 0;
+        int rightCount = 0;
+
+        if (firstLine.Length == 1 || secondLine.Length == 1)
+        {
+            if (firstLine.Contains(secondLine[0]) || secondLine.Contains(firstLine[0]))
+            {
+                Console.WriteLine(1);
+            }
+            else
+            {
+                Console.WriteLine(0);
+            }
+            return;
+        }
+
+        for (int i = 0; i < halfLenght - 1; i++)
+        {
+            if (firstLine.Contains(secondLine[i]))
+            {
+                leftCount++;
+            }
+        }
+
+        for (int i = halfLenght - 1; i < min; i++)
+        {
+            if (firstLine.Contains(secondLine[i]))
+            {
+                rightCount++;
+            }
+        }
+
+        if (rightCount == 0 && leftCount == 0)
+        {
+            Console.WriteLine(0);
+        }
+        else
+        {
+            Console.WriteLine(Math.Max(rightCount, leftCount));
+        }
+    }
+}

05.Arrays/Exercises/01.LargestCommonEnd/LargestCommonEnd.cs

@@ -0,0 +1,34 @@
+using System;
+using System.Linq;
+
+public class RotateAndSum
+{
+    public static void Main()
+    {
+        int[] arr = Console.ReadLine()
+            .Split()
+            .Select(int.Parse)
+            .ToArray();
+        int[] sum = new int[arr.Length];
+        int rotations = int.Parse(Console.ReadLine());
+
+        for (int i = 0; i < rotations; i++)
+        {
+            int[] rotated = new int[arr.Length];
+            rotated[0] = arr[arr.Length - 1];
+
+            for (int j = 1; j < rotated.Length; j++)
+            {
+                rotated[j] = arr[j - 1];
+            }
+
+            for (int j = 0; j < sum.Length; j++)
+            {
+                sum[j] += rotated[j];
+            }
+            arr = rotated;
+        }
+
+        Console.WriteLine(string.Join(" ", sum));
+    }
+}

05.Arrays/Exercises/01.LargestCommonEnd/Program.cs

@@ -0,0 +1,48 @@
+using System;
+using System.Linq;
+
+public class FoldAndSum
+{
+    public static void Main()
+    {
+        int[] numbers = Console.ReadLine()
+            .Split()
+            .Select(int.Parse)
+            .ToArray();
+
+        GetFoldAndSum(numbers);
+    }
+    private static void GetFoldAndSum(int[] numbers)
+    {
+        int[] left = new int[numbers.Length / 4];
+        int[] right = new int[numbers.Length / 4];
+        int[] upper = new int[numbers.Length / 2];
+        int[] down = new int[numbers.Length / 2];
+        int[] sum = new int[numbers.Length / 2];
+
+        int rev = numbers.Length / 4 - 1;
+        int a = numbers.Length - 1;
+        int b = numbers.Length / 4;
+
+        for (int i = 0; i <= (numbers.Length / 4) - 1; i++)
+        {
+            left[i] = numbers[rev];
+            right[i] = numbers[a];
+            rev--;
+            a--;
+        }
+        upper = left.Concat(right).ToArray();
+
+        for (int i = 0; i < numbers.Length / 2; i++, b++)
+        {
+            down[i] = numbers[b];
+        }
+
+        for (int i = 0; i < numbers.Length / 2; i++)
+        {
+            sum[i] += (upper[i] + down[i]);
+        }
+
+        Console.WriteLine(string.Join(" ", sum));
+    }
+}

05.Arrays/Exercises/02.RotateAndSum/RotateAndSum.cs

@@ -0,0 +1,32 @@
+using System;
+using System.Collections.Generic;
+
+public class SieveOfEratosthenes
+{
+    public static void Main()
+    {
+        int inputNumber = int.Parse(Console.ReadLine());
+        List<int> num = new List<int>();
+
+        for (int i = 2; i <= inputNumber; i++)
+        {
+            if (IsPrime(i))
+            {
+                num.Add(i);
+            }
+        }
+
+        Console.WriteLine(string.Join(" ", num));
+    }
+    private static bool IsPrime(int i)
+    {
+        int num = (int)Math.Floor(Math.Sqrt(i));
+
+        for (int j = 2; j <= num; ++j)
+        {
+            if (i % j == 0 || i == 0 || i == 1) return false;
+        }
+
+        return true;
+    }
+}

05.Arrays/Exercises/03.FoldAndSum/FoldAndSum.cs

@@ -0,0 +1,44 @@
+using System;
+using System.Linq;
+
+public class CompareCharArrays
+{
+    public static void Main()
+    {
+        char[] first = Console.ReadLine()
+            .Split()
+            .Select(char.Parse)
+            .ToArray();
+        char[] second = Console.ReadLine()
+            .Split()
+            .Select(char.Parse)
+            .ToArray();
+
+        int shorterArray = Math.Min(first.Length, second.Length);
+
+        if (first.Length == second.Length)
+        {
+            if (first[0] > second[0])
+            {
+                Console.WriteLine(string.Join("", second));
+                Console.WriteLine(string.Join("", first));
+            }
+            else
+            {
+                Console.WriteLine(string.Join("", first));
+                Console.WriteLine(string.Join("", second));
+            }
+        }
+
+        else if (first.Length == shorterArray)
+        {
+            Console.WriteLine(string.Join("", first));
+            Console.WriteLine(string.Join("", second));
+        }
+        else
+        {
+            Console.WriteLine(string.Join("", second));
+            Console.WriteLine(string.Join("", first));
+        }
+    }
+}