December Algorithm 2024

December 01/Day1_java_Hari7467.java

@@ -0,0 +1,24 @@
+public class Day1_java_Hari7467 {
+
+    private static int find_missing_value(int race[])
+    {
+        int start=race[0];
+        for(int i=0;i<race.length;i++)
+        {
+            if(start==race[i])
+            {
+                start++;
+            }
+            else
+            {
+                return start;
+            }
+        }
+        return 0;
+    }
+    public static void main(String[] args)
+    {
+        int race[]={100,101,102,104,105};
+        System.out.println(Day1_java_Hari7467.find_missing_value(race));
+    }
+}

December 02/Day2_java_Hari7467.java

@@ -0,0 +1,46 @@
+class Day2_java_Hari7467 {
+
+    private int[] wavePattern(int arr[]) {
+        for (int i = 0; i < arr.length - 1; i++) {
+            if (i % 2 == 0) {
+
+                if (arr[i] > arr[i + 1]) {
+                    swap(arr, i, i + 1);
+                }
+            } else {
+
+                if (arr[i] < arr[i + 1]) {
+                    swap(arr, i, i + 1);
+                }
+            }
+        }
+        return arr;
+    }
+
+
+    private void swap(int[] arr, int i, int j) {
+        int temp = arr[i];
+        arr[i] = arr[j];
+        arr[j] = temp;
+    }
+
+
+    private void show(int arr[]) {
+        for (int i : arr) {
+            System.out.print(i + " ");
+        }
+        System.out.println();
+    }
+
+
+    public static void main(String[] args) {
+        int arr[] = {10, 5, 6, 3, 2, 20, 100, 80};
+        Day2_java_Hari7467 obj = new Day2_java_Hari7467();
+
+        if (arr.length > 1) {
+            obj.show(obj.wavePattern(arr));
+        } else {
+            System.out.println("Array should have at least two elements");
+        }
+    }
+}

December 03/Day3_java_Hari7467.java

@@ -0,0 +1,38 @@
+public class Day3_java_Hari7467 {
+    private  String square(int b,int r)
+    {
+        StringBuilder res=new StringBuilder();
+        if(Math.abs(b-r)>1) return "NOT POSSIBLE";
+        while (b>0 || r>0)
+        {
+            if(b>0 && b>r)
+            {
+                res.append("B");b--;
+                if(r>0)
+                {
+                    res.append("R");r--;
+                } 
+            }
+            else if(r>0 && r>b)
+            {
+                res.append("R");r--;
+                if(b>0)
+                {
+                    res.append("B");b--;
+                }
+            }
+            else
+            {
+                res.append("B");b--;
+                res.append("R");r--;
+            }
+        }
+        return res.toString();
+    }
+    public static void main(String[] args) {
+        int b=4,r=4;
+        Day3_java_Hari7467 obj=new Day3_java_Hari7467();
+        System.out.println(obj.square( b, r));
+    }
+
+}

December 04/Day4_java_Hari7467.java

@@ -0,0 +1,15 @@
+public class Day4_java_Hari7467 {
+    public static void main(String []args)
+    {
+        int a=0,b=1,c=0,n=12;
+        if(n<=1) c=1;
+        while(n>1)
+        {
+            c=a+b;
+            a=b;
+            b=c;
+            n--;
+        }
+        System.out.println(c);
+    }
+}

December 05/Day5_java_Hari7467.java

@@ -0,0 +1,28 @@
+import java.util.ArrayList;
+import java.util.List;
+
+public class Day5_java_Hari7467 {
+    public  int simulateSafePosition(List<Integer> circle, int k) {
+
+        int index = 0; 
+        while (circle.size() > 1) {
+            index = (index + k - 1) % circle.size(); 
+            circle.remove(index);
+        }
+
+        return circle.get(0);
+    }
+    public static void main(String[] args) {
+        int n=3,k=2;
+        Day5_java_Hari7467 obj=new Day5_java_Hari7467();
+        List<Integer> circle=new ArrayList<>();
+        for(int i=1;i<=n;i++)
+        {
+            circle.add(i);
+        }
+        System.out.println(obj.simulateSafePosition(circle,k));
+
+
+}
+}
+

December 06/Day6_java_Hari7467.java

@@ -0,0 +1,28 @@
+public class Day6_java_Hari7467 {
+    static int x=0;
+    public static void pairs(int[][] pair,int i,int j)
+    {
+        pair[x][0]=i;
+        pair[x][1]=j;
+        x++;
+    }
+    public static void main(String[] args) {
+        int pair[][]=new int[100][2];
+        int numbers[]={2, 4, 3, 7, 1, 5};
+        int target=6;
+        for(int i=0;i<numbers.length-1;i++)
+        {
+            for(int j=i;j<numbers.length;j++)
+            {
+                if(numbers[i]+numbers[j]==target)
+                {
+                    pairs(pair,numbers[i],numbers[j]);
+                }
+            }
+        }
+        for(int i=0;i<x;i++)
+        {
+            System.out.print("("+pair[i][0]+","+pair[i][1]+")"+",");
+        } 
+    }
+}

December 07/Day7_java_Hari7467.java

@@ -0,0 +1,30 @@
+import java.util.ArrayList;
+import java.util.List;
+public class Day7_java_Hari7467 {
+    public static void main(String[] args) {
+        List<List<Integer>> list=new ArrayList<>();
+        int n=2;
+        for(int i=0;i<n;i++)
+        {
+            list.add(new ArrayList<>());
+
+            for(int j=0;j<=i;j++)
+            {
+                if(j==0 || j==i)
+                {
+                    list.get(i).add(1);
+                }
+                else
+                {
+                    int ele=list.get(i-1).get(j-1)+list.get(i-1).get(j);
+                    list.get(i).add(ele);
+                }
+            }
+        }
+        for(List<Integer> row :list)
+        {
+            System.out.println(row);
+        }
+
+    }
+}

December 08/Day8_java_Hari7467.java

@@ -0,0 +1,24 @@
+class Day8_java_Hari7467
+{
+    static int digitsum(int n)
+    {
+        int sum=0;
+        while(n>0)
+        {
+            int digit=n%10;
+            sum+=(digit*digit);
+            n=n/10;
+        }
+        return sum;
+    }
+    public static void main(String[] args)
+    {
+        int n=20,totalsum=0;
+        for(int i=1;i<=n;i++)
+        {
+            totalsum+=digitsum(i);
+
+        }
+        System.out.println(totalsum);
+    }
+}

December 09/Day9_java_Hari7467.java

@@ -0,0 +1,14 @@
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Arrays;
+public class Day9_java_Hari7467 {
+    public static void main(String[] args) {
+        List<Integer> returns=new ArrayList<>(Arrays.asList(2, 1, 5, 1, 0, 3, 1, 4, 1));
+        int cus_count=0;
+        for(int frequency:returns)
+        {
+            if(frequency==1) cus_count++;
+        }
+        System.out.println(cus_count);
+    }
+}

December 10/Day10_java_Hari7467.java

@@ -0,0 +1,115 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.Queue;
+
+public class Day10_java_Hari7467 {
+    static private Map<Character,List<Character>> adjencymap=new HashMap<>();
+    static private Map<Character,Integer> in_degree=new HashMap<>();
+    static private Queue<Character> queue=new LinkedList<>();
+    static private List<List<Character>> list=new ArrayList<>();
+    static int i=0;
+    static boolean terminator=false;
+    public static void addedge(Character source,List<Character> list_destination)
+    {
+        adjencymap.putIfAbsent(source,new ArrayList<>());
+        for(Character destination:list_destination)
+        {
+            adjencymap.putIfAbsent(destination,new ArrayList<>());
+            adjencymap.get(source).add(destination);
+        }
+    }
+    public static boolean indegree()
+    {
+        for(Map.Entry<Character,List<Character>> vertex:adjencymap.entrySet())
+        {
+            in_degree.put(vertex.getKey(),vertex.getValue().size());
+            if(vertex.getValue().size()==0) terminator=true;
+        }
+        return terminator;
+    }
+    public static void addqueue()
+    {
+        boolean temp=true;
+        for(Map.Entry<Character,Integer> depend:in_degree.entrySet())
+        {
+            if(depend.getValue()==0)
+            {
+                if(temp)
+                {
+                    list.add(new ArrayList<>());
+                    temp=false;
+                }
+                queue.add(depend.getKey());
+                list.get(i).add(depend.getKey());
+                in_degree.put(depend.getKey(),-1);
+            }
+        }
+        if(!temp) i++;
+    }
+    public static void reduceindegree(Character task)
+    {
+        terminator = task==null?false:true;
+        for(Map.Entry<Character,List<Character>> popdepency:adjencymap.entrySet())
+        {
+            for(Character depended_task:popdepency.getValue())
+            {
+                if(depended_task.equals(task))
+                {
+                   for(Map.Entry<Character,Integer> decrement:in_degree.entrySet())
+                   {
+                        if(popdepency.getKey().equals(decrement.getKey()))
+                        {
+                            in_degree.put(decrement.getKey(),decrement.getValue()-1);
+                        }
+                   }
+                }
+            }
+        }
+    }
+    public static boolean process()
+    {
+        if(!indegree())
+        {
+            return false;
+        }
+        else
+        {
+            while(terminator)
+            {
+                addqueue();
+                reduceindegree(queue.poll());
+            }
+        }
+        return true;
+    }
+    public static void printlist()
+    {
+        for(List<Character> row :list)
+        {
+            System.out.print(row);
+        }
+    }
+    public static void main(String[] args) {
+            HashMap<Character,List<Character>> tasks=new HashMap<>();
+            tasks.put('A',new ArrayList<>(Arrays.asList('B')));
+            tasks.put('B',new ArrayList<>(Arrays.asList('A')));
+
+            for(Map.Entry<Character,List<Character>> task:tasks.entrySet())
+            {
+                addedge(task.getKey(),task.getValue());
+            } 
+            if(process())
+            {
+                printlist();   
+            }  
+            else
+            {
+                System.out.println("Error: Cyclic dependency detected");
+            }
+
+    }
+}