December of Algorithm - Raja Vishalini G

December 01/question1.txt

@@ -0,0 +1,17 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        int n=s.nextInt();
+        int[] arr=new int[n-1];
+        int sum=0;
+        for(int i=0;i<n-1;i++)
+        {
+            arr[i]=s.nextInt();
+            sum+=arr[i];
+        }
+        int total=n*(n+1)/2;
+        int result=Math.abs(total-sum);
+        System.out.print(result);
+    }
+}

December 02/question2.txt

@@ -0,0 +1,36 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        int n=s.nextInt();
+        int[] arr=new int[n];
+        for(int i=0;i<n;i++)
+        {
+            arr[i]=s.nextInt();
+        }
+        solution(arr);
+    }
+    public static void solution(int[] arr)
+    {
+        int t;
+        for(int i=0;i<arr.length-1;i++)
+        {
+            if(i%2==0&&arr[i]>arr[i+1]){
+                   t=arr[i];
+                  arr[i]=arr[i+1];
+                  arr[i+1]=t;
+            }
+
+            if(i%2!=0&&arr[i]<arr[i+1])
+            {
+                t=arr[i];
+                arr[i]=arr[i+1];
+                arr[i+1]=t;
+            }
+        }
+        for(int i=0;i<arr.length;i++)
+        {
+            System.out.println(arr[i]);
+        }
+    }
+}

December 03/question3.txt

@@ -0,0 +1,43 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        int n1=s.nextInt();
+        int n2=s.nextInt();
+        System.out.println(solution(n1, n2));
+    }
+    public static String solution(int n1,int n2)
+    {
+        StringBuilder s=new StringBuilder();
+        if(Math.abs(n1-n2)>1)
+        return "not possible";
+        else
+        {
+            if(n1>=n2)
+            {
+            for(int i=0;i<n1+n2;i++)
+            {
+                if(i%2==0)
+                {
+                    s.insert(i,"R");
+                }
+                else
+                s.insert(i,"B");
+            }
+           }
+           else
+           {
+            for(int i=0;i<n1+n2;i++)
+            {
+                if(i%2==0)
+                {
+                    s.insert(i,"B");
+                }
+                else
+                s.insert(i,"R");
+                }
+            }
+        }
+        return s.toString();
+        }
+    }

December 04/question4.txt

@@ -0,0 +1,20 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        int n=s.nextInt();
+        int a=1;
+        int c;
+        int b=1;
+        for(int i=3;i<=n;i++)
+        {
+            c=a+b;
+            if(i==n)
+            {
+            System.out.print(c);
+            break;
+            }
+            a=b;b=c;
+        }
+    }
+}

December 05/question5.txt

@@ -0,0 +1,24 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+       Scanner s=new Scanner(System.in);
+       int n=s.nextInt();
+       int k=s.nextInt();
+       solution(n,k);
+    }
+    public static void solution(int n,int k)
+    {
+        List<Integer>l1=new ArrayList<>();
+        for(int i=0;i<n;i++)
+        {
+            l1.add(i);
+        }
+        int j=0;
+        while(l1.size()>1)
+        {
+            j=(j+k-1)%l1.size();
+            l1.remove(j);
+        }
+        System.out.print(l1.get(0));
+    }   
+}

December 06/question6.txt

@@ -0,0 +1,31 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        int n=s.nextInt();
+        int target=s.nextInt();
+        int[] arr=new int[n];
+        for(int i=0;i<n;i++)
+        {
+            arr[i]=s.nextInt();
+        }
+        solution(arr,target);
+    }
+    public static void solution(int[] arr,int target)
+    {
+        int n=arr.length;
+        HashMap<Integer,Integer>h1=new HashMap<>();
+        HashSet<int[]> set = new HashSet<>();
+        for (int i = 0; i <arr.length; i++) {
+            int complement = target - arr[i];
+            if (h1.containsValue(complement)) {
+                set.add(new int[]{complement,arr[i]});
+            }
+            h1.put(i,arr[i]);
+        }
+         for(int[] s:set)
+        {
+            System.out.println(Arrays.toString(s));
+        }
+    }
+}

December 07/question7.txt

@@ -0,0 +1,27 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+       Scanner s=new Scanner(System.in);
+       int n=s.nextInt();
+       solution(n);
+    }
+    public static void solution(int n)
+    {
+        List<List<Integer>>l1=new ArrayList<>();
+        for(int i=0;i<n;i++)
+        {
+            List<Integer>cur=new ArrayList<>();
+            cur.add(1);
+            for(int j=1;j<i;j++)
+            {
+                int val=l1.get(i-1).get(j-1)+l1.get(i-1).get(j);
+                cur.add(val);
+            }
+            if(i>0)
+            cur.add(1);
+
+            l1.add(cur);
+        }
+        System.out.print(l1);
+    }
+}

December 08/question8.txt

@@ -0,0 +1,25 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+       Scanner s=new Scanner(System.in);
+       int n=s.nextInt();
+       solution(n);
+    }
+    public static void solution(int n)
+    {
+        int s,res=0,j;
+        for(int i=1;i<=n;i++)
+        { 
+            s=0;
+            j=i;
+            while(j>0)
+            {
+            int r=j%10;
+            s+=r*r;
+            j/=10;
+            }
+            res+=s;
+        }
+        System.out.print(res);
+    }
+}

December 09/question9.txt

@@ -0,0 +1,24 @@
+import java.util.*;
+class Main {
+	public static void main(String[] args) {
+		Scanner s=new Scanner(System.in);
+		int n=s.nextInt();
+		List<Integer>l1=new ArrayList<>();
+		for(int i=0; i<n; i++)
+		{
+		    l1.add(s.nextInt());
+		}
+		solution(l1);
+	}
+	public static void solution(List<Integer>l1)
+	{             int c=0;
+		for(int i=0; i<l1.size(); i++)
+		{
+			if(l1.get(i)==1)
+			{
+				c++;
+			}
+		}
+		System.out.print(c);
+	}
+}

December 10/question10.txt

@@ -0,0 +1,59 @@
+from collections import defaultdict
+
+def find_concurrent_jobs(tasks):
+    graph = defaultdict(list)
+    for task, dependencies in tasks:
+        graph[task].extend(dependencies)
+
+    level_map = {}
+    visited = set()
+    current_path = set()
+
+    def dfs(task):
+        if task in current_path:
+            return False
+        if task in visited:
+            return True
+
+        current_path.add(task)
+        max_level = 0
+        for dep in graph[task]:
+            if not dfs(dep):
+                return False
+            max_level = max(max_level, level_map[dep])
+        current_path.remove(task)
+
+        visited.add(task)
+        level_map[task] = max_level + 1
+        return True
+
+    for task, _ in tasks:
+        if task not in visited:
+            if not dfs(task):
+                return "Error: Cyclic dependency detected"
+
+    result = defaultdict(list)
+    for task, level in level_map.items():
+        result[level].append(task)
+
+    return [result[level] for level in sorted(result)]
+
+def get_tasks_from_user():
+    tasks = []
+    while True:
+        task = input("Enter task name (or 'done' to finish): ").strip()
+        if task.lower() == "done":
+            break
+        dependencies = input(f"Enter dependencies for task '{task}' (comma-separated, or leave blank if none): ").strip()
+        dependencies_list = dependencies.split(",") if dependencies else []
+        dependencies_list = [dep.strip() for dep in dependencies_list if dep.strip()]
+        tasks.append((task, dependencies_list))
+    return tasks
+
+tasks = get_tasks_from_user()
+result = find_concurrent_jobs(tasks)
+if isinstance(result, str):
+    print(result)
+else:
+    for level, jobs in enumerate(result, 1):
+        print(f"Level {level}: {', '.join(jobs)}")

December 11/question11.txt

@@ -0,0 +1,28 @@
+import java.util.*;
+class Main {
+    public static void main(String[] args) {
+        Scanner s=new Scanner(System.in);
+        String s1=s.nextLine();
+        solution(s1);
+    }
+    public static void solution(String s)
+    {
+        int org=0;
+        for(int i=0;i<s.length();i++)
+        {
+            char ch=s.charAt(i);
+            if(ch=='R')
+            org++;
+            if(ch=='L')
+            org--;
+            if(ch=='U')
+            org++;
+            if(ch=='D')
+            org--;
+        }
+        if(org==0)
+        System.out.print("true");
+        else
+        System.out.print("false");
+            }
+}

December 12/question12.txt

@@ -0,0 +1,52 @@
+from collections import deque
+
+def process_ticket_requests(N, requests):
+    vip_queue = deque()
+    regular_queue = deque()
+    remaining_tickets = N
+    results = []
+
+    for request in requests:
+        name, tickets, *priority = request.split()
+        tickets = int(tickets)
+        if "VIP" in priority:
+            vip_queue.append((name, tickets))
+        else:
+            regular_queue.append((name, tickets))
+
+    def process_queue(queue):
+        nonlocal remaining_tickets
+        while queue and remaining_tickets > 0:
+            name, tickets = queue.popleft()
+            if tickets <= remaining_tickets:
+                remaining_tickets -= tickets
+                results.append(f"{name} purchased {tickets} tickets")
+            else:
+                results.append(f"{name} purchased {remaining_tickets} tickets")
+                remaining_tickets = 0
+
+    process_queue(vip_queue)
+    process_queue(regular_queue)
+
+    for queue in [vip_queue, regular_queue]:
+        while queue:
+            name, _ = queue.popleft()
+            results.append(f"{name} was not served")
+
+    return results
+
+def get_dynamic_input():
+    N = int(input("Enter the total number of tickets available: "))
+    requests = []
+    print("Enter ticket requests (name, number of tickets, optional VIP). Type 'done' to finish:")
+    while True:
+        request = input().strip()
+        if request.lower() == "done":
+            break
+        requests.append(request)
+    return N, requests
+
+N, requests = get_dynamic_input()
+output = process_ticket_requests(N, requests)
+for line in output:
+    print(line)