Merge pull request larissalages#107 from abdzitter/master

UtopianTree

Author: larissalages

Hackerrank/Problem Solving/Anagram.cpp

@@ -0,0 +1,61 @@
+//Problem Link : https://www.hackerrank.com/challenges/anagram/problem
+#include <bits/stdc++.h>
+
+using namespace std;
+
+// Complete the anagram function below.
+int anagram(string s) 
+{
+    long n=s.size(),k=0;
+    string a,b;
+    if(n%2==1)
+    return -1;
+    else
+    {
+        for(int i=0;i<n/2;i++)
+        {
+            a[i]=s[i];
+        }
+        for(int i=n/2;i<n;i++)
+        {
+            b[i]=s[i];
+        }
+        for(int i=n/2;i<n;i++)
+        {
+            for(int j=0;j<n/2;j++)
+            {
+                        if(b[i]==a[j])
+                            {
+                                k++;
+                                 a[j]='0';
+                                j=n/2;
+                               
+                            }
+            }
+        }
+        return (n/2-k);
+    }
+}
+
+int main()
+{
+    ofstream fout(getenv("OUTPUT_PATH"));
+
+    int q;
+    cin >> q;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    for (int q_itr = 0; q_itr < q; q_itr++) {
+        string s;
+        getline(cin, s);
+
+        int result = anagram(s);
+
+        fout << result << "\n";
+    }
+
+    fout.close();
+
+    return 0;
+}
+

Hackerrank/Problem Solving/UtopianTree

@@ -0,0 +1,88 @@
+#include <assert.h>
+#include <limits.h>
+#include <math.h>
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+char* readline();
+
+// Complete the utopianTree function below.
+int utopianTree(int n) 
+{
+    int sum=1;
+    for(int i=1;i<=n;i++)
+    {
+        if(i%2==0)
+        {
+            sum=sum+1;
+        }
+        else 
+        {
+            sum=sum*2;
+        }
+    }
+    return sum;
+}
+
+int main()
+{
+    FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
+
+    char* t_endptr;
+    char* t_str = readline();
+    int t = strtol(t_str, &t_endptr, 10);
+
+    if (t_endptr == t_str || *t_endptr != '\0') { exit(EXIT_FAILURE); }
+
+    for (int t_itr = 0; t_itr < t; t_itr++) {
+        char* n_endptr;
+        char* n_str = readline();
+        int n = strtol(n_str, &n_endptr, 10);
+
+        if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
+
+        int result = utopianTree(n);
+
+        fprintf(fptr, "%d\n", result);
+    }
+
+    fclose(fptr);
+
+    return 0;
+}
+
+char* readline() {
+    size_t alloc_length = 1024;
+    size_t data_length = 0;
+    char* data = malloc(alloc_length);
+
+    while (true) {
+        char* cursor = data + data_length;
+        char* line = fgets(cursor, alloc_length - data_length, stdin);
+
+        if (!line) { break; }
+
+        data_length += strlen(cursor);
+
+        if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') { break; }
+
+        size_t new_length = alloc_length << 1;
+        data = realloc(data, new_length);
+
+        if (!data) { break; }
+
+        alloc_length = new_length;
+    }
+
+    if (data[data_length - 1] == '\n') {
+        data[data_length - 1] = '\0';
+    }
+
+    data = realloc(data, data_length);
+
+    return data;
+}

Hackerrank/Problem Solving/UtopianTree.cpp

@@ -0,0 +1,89 @@
+//Problem Link:https://www.hackerrank.com/challenges/utopian-tree/problem
+#include <assert.h>
+#include <limits.h>
+#include <math.h>
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+char* readline();
+
+// Complete the utopianTree function below.
+int utopianTree(int n) 
+{
+    int sum=1;
+    for(int i=1;i<=n;i++)
+    {
+        if(i%2==0)
+        {
+            sum=sum+1;
+        }
+        else 
+        {
+            sum=sum*2;
+        }
+    }
+    return sum;
+}
+
+int main()
+{
+    FILE* fptr = fopen(getenv("OUTPUT_PATH"), "w");
+
+    char* t_endptr;
+    char* t_str = readline();
+    int t = strtol(t_str, &t_endptr, 10);
+
+    if (t_endptr == t_str || *t_endptr != '\0') { exit(EXIT_FAILURE); }
+
+    for (int t_itr = 0; t_itr < t; t_itr++) {
+        char* n_endptr;
+        char* n_str = readline();
+        int n = strtol(n_str, &n_endptr, 10);
+
+        if (n_endptr == n_str || *n_endptr != '\0') { exit(EXIT_FAILURE); }
+
+        int result = utopianTree(n);
+
+        fprintf(fptr, "%d\n", result);
+    }
+
+    fclose(fptr);
+
+    return 0;
+}
+
+char* readline() {
+    size_t alloc_length = 1024;
+    size_t data_length = 0;
+    char* data = malloc(alloc_length);
+
+    while (true) {
+        char* cursor = data + data_length;
+        char* line = fgets(cursor, alloc_length - data_length, stdin);
+
+        if (!line) { break; }
+
+        data_length += strlen(cursor);
+
+        if (data_length < alloc_length - 1 || data[data_length - 1] == '\n') { break; }
+
+        size_t new_length = alloc_length << 1;
+        data = realloc(data, new_length);
+
+        if (!data) { break; }
+
+        alloc_length = new_length;
+    }
+
+    if (data[data_length - 1] == '\n') {
+        data[data_length - 1] = '\0';
+    }
+
+    data = realloc(data, data_length);
+
+    return data;
+}