Jeswin Paul Dany D - December of Algorithms - Submission

December 01/C++_Jeswindany_Cricmetric.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin >> n;
+    int runs[n], total = 0, highest = 0;
+    for (int i = 0; i<n; i++){
+        cin >> runs[i];
+        total  += runs[i];
+        if(runs[i]>runs[highest]){
+            highest = i;
+        }
+    }
+    cout << total << endl;
+    cout << highest << endl;
+}

December 02/python3_Jeswindany_Shoppers_Choice.py

@@ -0,0 +1,8 @@
+sales = [int(i) for i in input().split()]
+visited = []
+frequency = []
+for i in sales:
+    if i not in visited:
+        visited.append(i)
+        frequency.append(sales.count(i))
+print(frequency)

December 03/C++_Jeswindany_Sunburnt.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n;
+    cin >> n;
+    int h[n];
+    for(int i=0; i<n; i++){
+        cin >> h[i];
+    }
+    int c = 0, f;
+    for(int i=0; i<n; i++){
+        f = 1;
+        for(int j=0; j<i; j++){
+            if(h[j] >= h[i]){
+                f = 0;
+                break;
+            }
+        }
+        if(f == 1)
+            c++;
+    }
+    cout << c;
+}

December 04/python3_Jeswindany_MirrorMagic.py

@@ -0,0 +1,22 @@
+def substrings(s):
+    substrings = []
+    n = len(s)
+
+    for i in range(n):
+        for j in range(i + 1, n + 1):
+            substrings.append(s[i:j])
+    return substrings
+
+def palindrome(s):
+    return s == s[::-1]
+
+word = input()
+sub = substrings(word)
+sub.sort(key = str.__len__)
+for i in range(len(word), len(sub)):
+    if(palindrome(sub[i].casefold())):
+        res = sub[i]
+        break
+else:
+    res = "Error"
+print(res)

December 05/python3_Jeswindany_PeakyBlinders.py

@@ -0,0 +1,7 @@
+loot = [int(i) for i in input().split()]
+avg = sum(loot)/len(loot)
+res_sum = 0
+for i in loot:
+    if(i>=avg):
+        res_sum += i
+print(res_sum)

December 06/python3_Jeswindany_TheLostAlgorithmScrolls.py

@@ -0,0 +1,36 @@
+def link(a, b):
+    if(len(a) == len(b)):
+        c = 0
+        for i in range(len(a)):
+            if(a[i] != b[i]):
+                c+=1
+        if(c == 1):
+            return True
+    elif(abs(len(a) - len(b)) == 1):
+        if((a in b) or (b in a)):
+            return True
+    return False
+
+words = input().split()
+start = ""
+res = []
+for i in words:
+    for j in words:
+        if(i!=j and link(i,j)):
+            start = i
+            res.append(i)
+            break
+    if(start != ""):
+        break
+if start == "":
+    print("No valid chain")
+else:
+    while(1):
+        for i in words:
+            if(i!=start and link(start,i) and (i not in res)):
+                start = i
+                res.append(i)
+                break
+        else:
+            break
+    print(res)

December 07/C++_Jeswindany_BabyBlocks.cpp

@@ -0,0 +1,18 @@
+#include <iostream>
+#include <math.h>
+using namespace std;
+
+void rectangleInCircle(double w,double h,double r){
+    double diag = sqrt((w*w)+(h*h));
+    if(diag>(2*r))
+        cout << "false" << endl;
+    else
+        cout << "true" << endl;
+}
+
+int main(){
+    double w, h, r;
+    cin >> w >> h >> r;
+    rectangleInCircle(w,h,r);
+    return 0;
+}

December 08/C++_Jeswindany_TheEnchantedForest.cpp

@@ -0,0 +1,48 @@
+#include <iostream>
+#include <string.h>
+using namespace std;
+
+
+void find_path(int n){
+    int sqr[n][n];
+    memset(sqr, 0, sizeof(sqr));
+    int i = n/2;
+    int j = n-1;
+
+    for(int num = 1; num <= n*n;){
+        if(i == -1 && j == n){
+            i = 0;
+            j = n-2;
+        }
+        else{
+            if(j == n)
+                j = 0;
+            if(i < 0)
+                i = n-1;
+        }
+        if(sqr[i][j]){
+            i += 1;
+            j -= 2;
+            continue;
+        }
+        else{
+            sqr[i][j] = num++;
+        }
+        i--;
+        j++; 
+    }
+
+    for (i = 0; i<n; i++){
+        for(j = 0;j<n; j++){
+            cout << sqr[i][j] << " ";
+        }
+        cout << endl;
+    }
+}
+
+int main(){
+    int n;
+    cin >> n;
+    find_path(n);
+    return 0;
+}

December 09/C++_Jeswindany_camelsOnAString.cpp

@@ -0,0 +1,16 @@
+#include <string.h>
+#include <iostream>
+using namespace std;
+
+int main(){
+    string text;
+    cin >> text;
+    int c = 1;
+    for(int i = 0; i<text.length(); i++){
+        if(text[i] >=65 && text[i] <= 90){
+            c += 1;
+        }
+    }
+    cout << c;
+    return 0;
+}

December 10/python3_Jeswindany_ForgotPassword.py

@@ -0,0 +1,12 @@
+import re
+
+def substring(name, a, b):
+    return name[a-1:a+b-1]
+
+data = [[100, "Shivnash Kumar"],[110,"Ragul Gupta"]]
+
+ind = re.findall('\d+',input())
+a,b= [int(i) for i in ind]
+
+for i,j in data:
+    print(substring(j,a,b))

December 11/python3_Jeswindany_CoderOfConversions.py

@@ -0,0 +1,5 @@
+def binsum(a,b):
+    return bin(a+b)[2:]
+
+a,b = [int(i) for i in input().split()]
+print(binsum(a,b))

December 12/python3_Jeswindany_TheHeist.py

@@ -0,0 +1,25 @@
+def binarySearch(box):
+    l = 0
+    h = len(box) - 1
+    while(l <= h):
+        m = (l+h)//2
+        if(box[m].lower() == "gold"):
+            return 1
+        elif(box[m].lower() < "gold"):
+            l = m+1
+        elif(box[m].lower() > "gold"):
+            h = m-1
+    return 0
+
+box1 = sorted([i.lower() for i in input().split()])
+box2 = sorted([i.lower() for i in input().split()])
+box3 = sorted([i.lower() for i in input().split()])
+
+if(binarySearch(box1)):
+    print("Box1 Contains the Gold")
+elif(binarySearch(box2)):
+    print("Box2 Contains the Gold")
+elif(binarySearch(box3)):
+    print("Box3 Contains the Gold")
+else:
+    print("Gold not Found")

December 13/C++_Jeswindany_CallCipher.cpp

@@ -0,0 +1,57 @@
+#include <string.h>
+#include <iostream>
+using namespace std;
+
+int textToNum(char c){
+    switch(c){
+        case 65:
+        case 66:
+        case 67:
+            return 2;
+        case 68:
+        case 69:
+        case 70:
+            return 3;
+        case 71:
+        case 72:
+        case 73:
+            return 4;
+        case 74:
+        case 75:
+        case 76:
+            return 5;
+        case 77:
+        case 78:
+        case 79:
+            return 6;
+        case 80:
+        case 81:
+        case 82:
+        case 83:
+            return 7;
+        case 84:
+        case 85:
+        case 86:
+            return 8;
+        case 87:
+        case 88:
+        case 89:
+        case 90:
+            return 9;
+    }
+}
+
+int main(){
+    string S;
+    cin >> S;
+    for (char i: S){
+        if(i>=65 && i<=90)
+            cout << textToNum(i);
+        else if(i>=97 && i<=122)
+            cout << textToNum(toupper(i));
+        else
+            cout << i;
+    }
+    cout << endl;
+    return 0;
+}

December 14/C++_Jeswindany_CallOfJustice.cpp

@@ -0,0 +1,74 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+class TreeNode {
+public:
+    int value;
+    TreeNode* left;
+    TreeNode* right;
+
+    TreeNode(int val) : value(val), left(nullptr), right(nullptr) {}
+};
+void findKDistanceNodes(TreeNode* root, int target, int k, vector<int>& result) {
+    if (!root)
+        return;
+
+    if (k == 0) {
+        result.push_back(root->value);
+        return;
+    }
+
+    findKDistanceNodes(root->left, target, k - 1, result);
+    findKDistanceNodes(root->right, target, k - 1, result);
+}
+
+int findTarget(TreeNode* root, int target, int k, vector<int>& result) {
+    if (!root)
+        return -1;
+
+    if (root->value == target) {
+        findKDistanceNodes(root, target, k, result);
+        return 0;
+    }
+
+    int leftDistance = findTarget(root->left, target, k, result);
+    if (leftDistance >= 0) {
+        if (leftDistance + 1 == k)
+            result.push_back(root->value);
+
+        findKDistanceNodes(root->right, target, k - leftDistance - 2, result);
+        return leftDistance + 1;
+    }
+
+    int rightDistance = findTarget(root->right, target, k, result);
+    if (rightDistance >= 0) {
+        if (rightDistance + 1 == k)
+            result.push_back(root->value);
+
+        findKDistanceNodes(root->left, target, k - rightDistance - 2, result);
+        return rightDistance + 1;
+    }
+    return -1;
+}
+
+int main() {
+    TreeNode* root = new TreeNode(17);
+    root->left = new TreeNode(8);
+    root->right = new TreeNode(27);
+    root->left->left = new TreeNode(4);
+    root->left->right = new TreeNode(14);
+    root->left->right->left = new TreeNode(10);
+    root->left->right->right = new TreeNode(16);
+    int targetNode = 8;
+    int kDistance = 2;
+    vector<int> output;
+    findTarget(root, targetNode, kDistance, output);
+    sort(output.begin(),output.end());
+    for (int node : output) {
+        cout << node << " ";
+    }
+    cout << endl;
+    return 0;
+}

December 15/python3_Jeswindany_SubsequenceSorcery.py

@@ -0,0 +1,13 @@
+def subsequence(s, sub, substr = ""):
+    if(len(s) == 0):
+        sub.append(substr)
+        return
+    subsequence(s[:-1], sub, substr + s[-1])
+    subsequence(s[:-1], sub, substr)
+    return
+
+s = input()
+sub = []
+subsequence(s, sub)
+
+print(len(set(sub)))