Completed DOA

.vscode/settings.json

@@ -0,0 +1,50 @@
+{
+  "files.associations": {
+    "array": "cpp",
+    "atomic": "cpp",
+    "bit": "cpp",
+    "*.tcc": "cpp",
+    "cctype": "cpp",
+    "clocale": "cpp",
+    "cmath": "cpp",
+    "compare": "cpp",
+    "concepts": "cpp",
+    "cstdarg": "cpp",
+    "cstddef": "cpp",
+    "cstdint": "cpp",
+    "cstdio": "cpp",
+    "cstdlib": "cpp",
+    "cwchar": "cpp",
+    "cwctype": "cpp",
+    "deque": "cpp",
+    "string": "cpp",
+    "unordered_map": "cpp",
+    "vector": "cpp",
+    "exception": "cpp",
+    "algorithm": "cpp",
+    "functional": "cpp",
+    "iterator": "cpp",
+    "memory": "cpp",
+    "memory_resource": "cpp",
+    "numeric": "cpp",
+    "random": "cpp",
+    "string_view": "cpp",
+    "system_error": "cpp",
+    "tuple": "cpp",
+    "type_traits": "cpp",
+    "utility": "cpp",
+    "initializer_list": "cpp",
+    "iosfwd": "cpp",
+    "iostream": "cpp",
+    "istream": "cpp",
+    "limits": "cpp",
+    "new": "cpp",
+    "numbers": "cpp",
+    "ostream": "cpp",
+    "stdexcept": "cpp",
+    "streambuf": "cpp",
+    "typeinfo": "cpp",
+    "sstream": "cpp"
+  },
+  "C_Cpp.errorSquiggles": "disabled"
+}

.vscode/tasks.json

@@ -0,0 +1,28 @@
+{
+    "tasks": [
+        {
+            "type": "cppbuild",
+            "label": "C/C++: gcc.exe build active file",
+            "command": "C:\\MinGW\\bin\\gcc.exe",
+            "args": [
+                "-fdiagnostics-color=always",
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}\\${fileBasenameNoExtension}.exe"
+            ],
+            "options": {
+                "cwd": "${fileDirname}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "detail": "Task generated by Debugger."
+        }
+    ],
+    "version": "2.0.0"
+}

December 01/java_Sunandita.java

@@ -0,0 +1,37 @@
+/*  ******* INPUT FORMAT ********
+
+Line 1 contains number of values n
+Line  two consists n space separated values
+
+EXAMPLE
+
+ 9
+ 10 20 30 40 50 60 70 80 90 
+
+ */
+
+
+import java.util.*;
+public class java_Sunandita {
+
+    public static void main(String args[]){
+        int max=0;
+        int sums=0;
+        try (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();
+            }
+
+            for(int i=0;i<n;i++){
+                sums+=arr[i];
+                if(arr[i]>arr[max]){
+                    max=i;
+                }
+            }
+        }
+        System.out.println(sums);
+        System.out.println(max);
+    }
+}

December 02/python3_Sunandita-R.py

@@ -0,0 +1,16 @@
+"""
+
+INPUT FORMAT    :One line of Space separated integers
+Example         : 2 2 3 4 5 6 2 4 6 7
+
+"""
+
+
+l=[int(x) for x in input().split()]
+freq=[]
+visited=[]
+for i in l:
+    if i not in visited:
+        freq.append(l.count(i))
+        visited.append(i)
+print(freq)

December 03/c_Sunandita-R.c

@@ -0,0 +1,29 @@
+/*  ******* INPUT FORMAT ********
+
+Line 1 contains number of values n
+Line  two consists n space separated values
+
+EXAMPLE
+
+ 5
+ 7 4 8 2 9
+
+ */
+
+
+#include<stdio.h>
+int main(){
+int n,i;
+scanf("%d",&n);
+int arr[n];
+for(i=0;i<n;i=i+1){scanf("%d",&arr[i]);}
+int count=1;
+int max=arr[0];
+for(i=1;i<n;i++){
+    if(arr[i]>max){
+        count++;
+        max=arr[i];
+    }
+}
+printf("%d",count);
+}

December 04/c_Sunandita-R_mirrormagic.c

@@ -0,0 +1,61 @@
+/* 
+
+    INPUT FORMAT: A single spaceless string without quotes
+    Example     : Hollow
+
+*/
+
+
+#include <stdio.h>
+#include <string.h>
+#include <stdbool.h>
+
+bool isPalindrome(char str[], int start, int end) {
+    while (start < end) {
+        if (str[start] != str[end]) {
+            return false;
+        }
+        start++;
+        end--;
+    }
+    return true;
+}
+
+void generateSmallestPalindrome(char str[]) {
+    int len = strlen(str);
+    int start=0;
+    int end=len-1;
+    int min=end-start;
+    char res[len];
+    bool flag=false;
+    while(start<end){
+        for(int i=0;i<len;i++)
+        {
+            res[i]=' ';
+        }
+        if (isPalindrome(str, start, end) && (end-start)<=min) {
+            min=end-start;
+            for(int j=start;j<=end;j++)
+
+            res[j-start]=str[j];
+            flag=true;
+        }
+        start++;
+        end--;
+    }
+    if(flag)
+    printf("%s",res);
+    else
+    printf("Error\n");
+}
+
+int main() {
+    char input[100];
+
+
+    scanf("%s", input);
+
+    generateSmallestPalindrome(input);
+
+    return 0;
+}

December 05/python_Sunandita-R_PeakyBlinders.py

@@ -0,0 +1,21 @@
+"""
+
+INPUT FORMAT    :One line of Space separated integers
+Example         : 2 2 3 4 5 6 2 4 6 7
+
+"""
+
+l=[int(x) for x in input().split()]
+avg=0
+sum=0
+for i in l:
+    sum+=i
+avg=sum/len(l)
+gtl=[]
+for i in l:
+    if(i>=avg):
+        gtl.append(i)
+sum=0
+for i in gtl:
+    sum+=i
+print(sum)

December 06/python_Sunandita-R_LostAlgorithmScrolls.py

@@ -0,0 +1,62 @@
+"""
+Approach chosen : All the words that can be obtained by adding/removing the first or last letter 
+                  from the previous word is also chosen to be a part of a chain.
+
+Example : [ dot, dote, eagle]  
+Output: [ dot, dote]  Here since addition of single letter in the end to dot gives the next word dote
+                      The two words form a sequence.
+
+In case of 2 or more sequence : Sequence with greatest length is chosen
+
+If the sequences are equal in length the first valid chain is chosen
+
+
+    ***********         INPUT FORMAT        ******
+
+    Single line of space separated strings without quotes
+
+    Example: cat cot dog doll coat
+
+"""
+
+l=[str(x) for x in input().split()]
+
+l2=[]
+res=[]
+for i in range(0,len(l)-1):
+    flag=False
+    if(len(l[i])==len(l[i+1])):
+        count=0
+        for j in range(0,len(l[i])):
+
+            if(l[i][j]!=l[i+1][j]):
+                count+=1
+        if(count==1):
+            flag=True
+    elif(len(l[i])+1==len(l[i+1])):
+        n=len(l[i])
+
+        if((l[i][0:n]==l[i+1][0:n]) or  (l[i][0:n+1]==l[i+1][1:n+1])):
+            flag=True
+    elif(len(l[i])==len(l[i+1])+1):
+        n=len(l[i+1])
+
+        if((l[i][0:n]==l[i+1][0:n])or  (l[i][1:n+1]==l[i+1][0:n+1]) ):
+            flag=True
+
+    if(flag==True):
+        if(l2==[]):
+            l2.append(l[i])
+            l2.append(l[i+1])
+        else:
+            l2.append(l[i+1])
+        if(len(l2)>len(res)):
+           res=l2
+    else:
+        l2=[]
+if(res==[]):
+    print("No valid chain")
+else:
+    print(res)
+
+

December 07/java_Sunandita_babyblocks.java

@@ -0,0 +1,38 @@
+/*
+ *      First two lines in the output is the Sample input output of Testcase 1
+ *
+ *      It is followwed by a prompt  to accept user input
+ * 
+ *      ******  INPUT FORMAT    *****
+ * 
+ *      A single line of Three space separated integers
+ * 
+ *      Example : 5 9 5
+ */
+
+import java.util.Scanner;
+
+public class java_Sunandita_babyblocks {
+
+    public static void main(String args[]){
+            int height,width,rad;
+            try (Scanner s = new Scanner(System.in)) {
+                System.out.println("rectangleInCircle(8, 6, 5)");
+                block(8,6,5);
+                width=s.nextInt();
+                height=s.nextInt();
+                rad=s.nextInt();
+                block(width, height, rad);
+            }
+
+    }
+    protected static void block(int wt,int ht,int r){
+        double hyp=Math.sqrt((ht*ht)+(wt*wt));
+        if( hyp>2*r){
+            System.out.println("false");
+        }
+        else
+        System.out.println("true");
+    }
+
+}