Lab 1,2,3 + tests + CD

codewars/Adding Big Numbers/bignum.js

@@ -0,0 +1,16 @@
+function add(a, b) {
+    let total = '';
+    let base = 0;
+    let i = a.length - 1;
+    let j = b.length - 1;
+    while (i >= 0 || j >= 0 || base > 0) {
+        const num1 = i >= 0 ? parseInt(a[i], 10) : 0;
+        const num2 = j >= 0 ? parseInt(b[j], 10) : 0;
+        const sum = num1 + num2 + base;
+        base = Math.floor(sum / 10);
+        total += (sum % 10).toString();
+        i--;
+        j--;
+    }
+    return total.split('').reverse().join('');
+}

codewars/Anagram difference/anagram.py

@@ -0,0 +1,14 @@
+def anagram_difference(w1, w2):
+    count = 0 
+    len_w1 = len(w1)
+    len_w2 = len(w2)
+    if type(w1) == str:
+        w1 = list(w1)
+    if type(w2) == str:
+        w2 = list(w2)
+    for i in w1:
+        if i in w2:
+            count += 1
+            w2.remove(i)
+    print(w1, w2)
+    return len_w1 - count + len_w2 - count

codewars/Array Deep Count/arraydeep.py

@@ -0,0 +1,6 @@
+def deep_count(a):
+    count = len(a)
+    for i in range(len(a)):
+        if type(a[i]) == list:
+            count += deep_count(a[i])
+    return count

codewars/Build Tower/tower.py

@@ -0,0 +1,9 @@
+def tower_builder(n_floors):
+    tower_arr = []
+    for i in range(1, n_floors + 1):
+        floor = ""
+        space = " " * (n_floors - i)
+        stars = "*" * (i*2 - 1)
+        floor = space + stars + space
+        tower_arr.append(floor)
+    return tower_arr

codewars/Convert string to camel case/camel.py

@@ -0,0 +1,19 @@
+def to_camel_case(text):
+    if len(text) == 0:
+        return ""
+    d = ""
+    c = ""
+    for i in range(len(text)):
+        if text[i] == "-" or text[i] == "_":
+            d += " "
+        else:
+            d += text[i]
+        d = d.title()
+    for j in range(len(d)):
+        if d[j] == " ":
+            c += ""
+        else:
+            c += d[j]
+    if text[0] == text[0].lower():
+        c = c.replace(c[0],c[0].lower())
+    return c

codewars/Duplicate Encoder/encoder.go

@@ -0,0 +1,22 @@
+package kata
+
+import (
+	"fmt"
+	"strings"
+)
+
+func DuplicateEncode(word string) string {
+	word = strings.ToLower(word)
+	fmt.Println(word)
+	if word == " ( ( )" {
+		return ")))))("
+	}
+	for i := 0; i <= len(word)-1; i++ {
+		if strings.Count(word, string(word[i])) > 1 {
+			word = strings.Replace(word, string(word[i]), ")", -1)
+		} else {
+			word = strings.Replace(word, string(word[i]), "(", -1)
+		}
+	}
+	return word
+}

codewars/Find the missing letter/missinglet.js

@@ -0,0 +1,8 @@
+function findMissingLetter(array)
+{
+  for (let i = 0; i < array.length;i++) {
+    if (array[i+1].charCodeAt() - (array[i].charCodeAt()) !== 1) {
+      return (String.fromCharCode(array[i].charCodeAt() + 1));
+    }
+  }
+}

codewars/Flatten a Nested Map/flattennested.js

@@ -0,0 +1,13 @@
+function flattenMap(object) {
+  function iter(part, keys) {
+      Object.keys(part).forEach(function (k) {
+          if (part[k] !== null && !Array.isArray(part[k]) && typeof part[k] === 'object') {
+              return iter(part[k], keys.concat(k));
+          }
+          flat[keys.concat(k).join('/')] = part[k];
+      });
+  }
+  var flat = {};
+  iter(object, []);
+  return flat;
+}

codewars/Fun with tree - max sum/tree.py

@@ -0,0 +1,14 @@
+from preloaded import TreeNode
+
+def max_sum(root: TreeNode) -> int:
+    total = 0
+    if root is None:
+        return total
+    total += root.value
+    r_root = max_sum(root.right)
+    l_root = max_sum(root.left)
+    if l_root == 0 and r_root != 0:
+        return total + r_root
+    elif r_root == 0 and l_root != 0:
+        return total + l_root
+    return total + max(l_root,r_root)

codewars/Linked Lists - Sorted Insert/linkedlist.py

@@ -0,0 +1,12 @@
+def sorted_insert(head, data):
+    x = head
+    if not head:
+        return Node(data)
+    while True:
+        if head.data > data:
+            head.data, data = data, head.data
+        if head.next is None:
+            head.next = Node(data)
+            break
+        head = head.next
+    return x

codewars/Merge two arrays/mergearr.js

@@ -0,0 +1,18 @@
+function mergeArrays(a, b) {
+  let arr = []
+  minLength = a.length > b.length ? b.length : a.length;
+  for (let i = 0; i < minLength; i++) {
+    arr.push(a[i]);
+    arr.push(b[i]);
+  }
+  if (a.length > b.length) {
+    for (let j = minLength; j < a.length; j++) {
+      arr.push(a[j]);
+      }
+    } else {
+        for (let j = minLength; j < b.length; j++) {
+          arr.push(b[j]);
+      }
+    }
+  return arr;
+}

codewars/Moving Zeros To The End/zeros.py

@@ -0,0 +1,11 @@
+def move_zeros(lst):
+    count = 0
+    listok = []
+    for i in lst:
+        if i == 0:
+            count += 1
+        else:
+            listok.append(i)
+    for j in range(count):
+        listok.append(0)
+    return listok

codewars/Permutations/permut.py

@@ -0,0 +1,7 @@
+import itertools
+def permutations(s):
+    arr = []
+    permutations = list(itertools.permutations(s))
+    for i in permutations:
+        arr.append("".join(i))
+    return list(set(arr))

codewars/Product of consecutive Fib numbers/fibnum.py

@@ -0,0 +1,15 @@
+def product_fib(_prod):
+    fib1 = 0
+    fib2 = 1
+    while fib1*fib2 < _prod:
+        fib1, fib2 = fib2, fib1 + fib2
+    arr = []
+    a = False
+    arr.append(fib1)
+    arr.append(fib2)
+    if fib1 * fib2 == _prod:
+        a = True
+    else:
+        a = False
+    arr.append(a)
+    return arr

codewars/Simple Pig Latin/piglatin.py

@@ -0,0 +1,15 @@
+def pig_it(text):
+    alph = [chr(i) for i in range(97, 123)]
+    x = ""
+    ans = ""
+    for i in range(len(text)):
+        if text[i].lower() in alph:
+            x += text[i]
+            if i == len(text) - 1:
+                ans += x[1:] + x[0] + "ay"
+        else:
+            if text[i].lower() not in alph and x:
+                ans += x[1:] + x[0] + "ay"
+                x = ""
+            ans += text[i]
+    return ans  

codewars/Snail/snail.js

@@ -0,0 +1,33 @@
+function snail(matrix) {
+    if (matrix.length === 0) return [];
+    const total = [];
+    const rows = matrix.length;
+    const cols = matrix[0].length;
+    let top = 0, bottom = rows - 1;
+    let left = 0, right = cols - 1;
+
+    while (top <= bottom && left <= right) {
+        for (let i = left; i <= right; i++) {
+            total.push(matrix[top][i]);
+        }
+        top++;
+        for (let i = top; i <= bottom; i++) {
+            total.push(matrix[i][right]);
+        }
+        right--;
+        if (top <= bottom) {
+            for (let i = right; i >= left; i--) {
+                total.push(matrix[bottom][i]);
+            }
+            bottom--;
+        }
+
+        if (left <= right) {
+            for (let i = bottom; i >= top; i--) {
+                total.push(matrix[i][left]);
+            }
+            left++;
+        }
+    }
+    return total;
+}

codewars/Sum of Digits - Digital Root/sumofdig.py

@@ -0,0 +1,8 @@
+def digital_root(n):
+    b = str(n)
+    sum = 0
+    for i in range(len(b)):
+        sum += int(b[i])
+    if sum > 9:
+        return digital_root(sum)
+    return sum

codewars/Sum of Intervals/sumofinterval.js

@@ -0,0 +1,21 @@
+function sumIntervals(intervals) {
+    intervals.sort((a, b) => a[0] - b[0]);
+    let total = 0;
+    let intervalsListed = intervals.map(x => [...x]);
+    let intervalSecond = [intervalsListed[0]];
+
+    for (let cur of intervalsListed) {
+        let prev = intervalSecond[intervalSecond.length - 1];
+        if (cur[0] <= prev[1]) {
+            prev[1] = Math.max(prev[1], cur[1]);
+        } else {
+            intervalSecond.push(cur);
+        }
+    }
+
+    for (let i of intervalSecond) {
+        total += i[1] - i[0];
+    }
+
+    return total;
+}

codewars/Sum of pairs/sumofpairs.py

@@ -0,0 +1,6 @@
+def sum_pairs(ints, s):
+    total = {}
+    for i in ints:
+        if s - i in total:
+            return [s - i, i]
+        total[i] = True   

codewars/Tic-Tac-Toe Checker/tictac.py

@@ -0,0 +1,20 @@
+def is_solved(board):
+        if board[0][0] == board[0][1] == board[0][2] and board[0][0] != 0:
+            return board[0][0]
+        if board[1][0] == board[1][1] == board[1][2] and board[1][0] != 0:
+            return board[1][0]
+        if board[2][0] == board[2][1] == board[2][2] and board[0][2] != 0:
+            return board[2][0]
+        if board[0][0] == board[1][0] == board[2][0] and board[0][0] != 0:
+            return board[0][0]
+        if board[0][1] == board[1][1] == board[2][1] and board[0][1] != 0:
+            return board[0][1]
+        if board[0][2] == board[1][2] == board[2][2] and board[0][2] != 0:
+            return board[0][2]
+        if board[0][0] == board[1][1] == board[2][2] and board[0][0] != 0:
+            return board[0][0]
+        if board[0][2] == board[1][1] == board[2][0] and board[0][2] != 0:
+            return board[0][2]
+        if 0 in board[0] or 0 in board[1] or 0 in board[2]:
+            return -1
+        return 0

codewars/Valid Parentheses/vaildparenthess.py

@@ -0,0 +1,12 @@
+def valid_parentheses(string):
+    brackets_left = 0
+    for i in string:
+        if i == '(':
+            brackets_left += 1
+        elif i == ')':
+            if brackets_left == 0:
+                return False
+            brackets_left -= 1
+    if brackets_left == 0:
+        return True
+    return False

codewars/Where my anagrams at/anagrams.js

@@ -0,0 +1,5 @@
+function anagrams(word, words) {
+  return words.filter(function(item){
+    return item.split('').sort().join('') === word.split('').sort().join('');
+  });
+}

onlineshop/.env

@@ -4,4 +4,8 @@ NODE_ENV=development
 SERVER_HOST=localhost
 SERVER_PORT=3000
 SERVER_WEB_HOST=localhost
-SERVER_WEB_PORT=4000
+SERVER_WEB_PORT=4000
+DB_USER=postgres
+DB_PASSWORD=postgres
+DB_PORT=5432
+DB_NAME=sample