Add solutions

Author: jrmanrique

README.md

@@ -1,10 +1,11 @@
 # codingchallenges
-Answers to challenges from [r/DailyProgrammer](https://www.reddit.com/r/dailyprogrammer/), [Project Euler](https://projecteuler.net/archives), and [Daily Coding Problem](https://www.dailycodingproblem.com/) .
+Answers to various coding challenges and problems around the internet.
 
 ## Index
 
 | Challenge | Problems List |
 | --------- | ------------- |
-| Daily Programmer | [Index](../master/dailyprogrammer/index.md) |
-| Project Euler | [Index](../master/projecteuler/index.md) |
-| Daily Coding Problem | [Index](../master/dailycodingproblem/index.md) |
+| [r/DailyProgrammer](https://www.reddit.com/r/dailyprogrammer/) | [Index](../master/dailyprogrammer/index.md) |
+| [Project Euler](https://projecteuler.net/archives) | [Index](../master/projecteuler/) |
+| [Daily Coding Problem](https://www.dailycodingproblem.com/) | [Index](../master/dailycodingproblem/) |
+| [UVa Online Judge](https://uva.onlinejudge.org/) | [Index](../master/uvaonlinejudge/) |

dailycodingproblem/day_5.py

@@ -0,0 +1,38 @@
+# Explanation: https://stackoverflow.com/questions/21769348/use-of-lambda-for-cons-car-cdr-definition-in-sicp
+
+def cons(a, b):
+    return lambda f: f(a, b)
+
+
+def car(cons):
+    return cons(lambda a, b: a)
+
+
+def cdr(cons):
+    return cons(lambda a, b: b)
+
+
+def main():
+    print('car(cons(3, 4)) == 3:', car(cons(3, 4)) == 3)
+    print('cdr(cons(3, 4)) == 4:', cdr(cons(3, 4)) == 4)
+
+    # [STEP BY STEP SOLUTION]
+
+    # cons(3, 4) == lambda f: f(3, 4)
+
+    # (lambda f: f(3, 4))(f) == 3
+    # f(3, 4) == 3
+    # f == (lambda a, b: a)
+
+    # (lambda a, b: a)(3, 4) == 3
+    # f(3, 4) == 3
+
+    # (lambda f: f(3, 4))(lambda a, b: a) == 3
+    # (cons(3, 4))(lambda a, b: a) == 3
+    # car(cons(3, 4)) == 3
+
+    # car(cons(3, 4)) == (cons(3, 4))(lambda a, b: a)
+
+
+if __name__ == '__main__':
+    main()

dailyprogrammer/index.md

@@ -2,6 +2,7 @@
 
 | ID  | Difficulty | Title | Solution |
 | --- | ---------- | ----- | -------- |
+| 355 | Easy | Alphabet Cipher | :small_blue_diamond: [Python](../master/dailyprogrammer/python/355_easy.py)
 | 354 | Intermediate | Integer Complexity 2 | :small_orange_diamond: [Python](../master/dailyprogrammer/python/354_intermediate.py)
 | 354 | Easy | Integer Complexity 1 | :small_blue_diamond: [Python](../master/dailyprogrammer/python/354_easy.py)
 | 353 | Intermediate | Pancake Sorting | :small_orange_diamond: [Python](../master/dailyprogrammer/python/353_intermediate.py)

dailyprogrammer/python/355_easy.py

@@ -0,0 +1,51 @@
+# https://www.reddit.com/r/dailyprogrammer/comments/879u8b/20180326_challenge_355_easy_alphabet_cipher/
+
+from itertools import cycle
+
+
+def cipher(char, key, decipher=False):
+    alpha = 'abcdefghijklmnopqrstuvwxyz'
+    shift = ord(key.lower()) - 97
+    if decipher:
+        return alpha[(alpha[shift:] + alpha[:shift]).index(char.lower())]
+    else:
+        alpha = alpha[shift:] + alpha[:shift]
+        return alpha[ord(char.lower()) - 97]
+
+
+def encrypt(text, key):
+    return ''.join(cipher(v, k) for v, k in zip(text, cycle(key)))
+
+
+def decrypt(text, key):
+    return ''.join(cipher(v, k, decipher=True) for v, k in zip(text, cycle(key)))
+
+
+def main():
+    inputs = [
+        'snitch thepackagehasbeendelivered',
+        'bond theredfoxtrotsquietlyatmidnight',
+        'train murderontheorientexpress',
+        'garden themolessnuckintothegardenlastnight',
+    ]
+
+    for inp in inputs:
+        key, text = inp.split()
+        print('{} {} => {}'.format(key, text, encrypt(text, key)))
+
+
+def bonus():
+    inputs = [
+        'cloak klatrgafedvtssdwywcyty',
+        'python pjphmfamhrcaifxifvvfmzwqtmyswst',
+        'moore rcfpsgfspiecbcc',
+    ]
+
+    for inp in inputs:
+        key, text = inp.split()
+        print('{} {} => {}'.format(key, text, decrypt(text, key)))
+
+
+if __name__ == '__main__':
+    main()
+    bonus()

uvaonlinejudge/c/v1-100.c

@@ -0,0 +1,58 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+
+int collatz(int num) {
+    int counter = 1;
+
+    while (num > 1) {
+        num = (num % 2 == 0) ? (num / 2) : (3 * num + 1);
+        counter++;
+    }
+
+    return counter;
+}
+
+
+int maxcollatz(int i, int j) {
+    int n;
+    int counter;
+    int max = 0;
+
+    for (n = i; n <= j; n++) {
+        counter = collatz(n);
+        if (counter > max) {
+            max = counter;
+        }
+    }
+
+    return max;
+}
+
+
+int main(void) {
+    const char NEWLINE = '\n';
+    int size;
+    int i, j;
+    
+    char line[512];
+
+    fgets(line, sizeof(line), stdin);
+    sscanf(line, "%d", &size);
+
+    int input[size][2];
+    for (int s = 0; s < size; ++s) {
+        fgets(line, sizeof(line), stdin);
+        sscanf(line, "%d %d", &input[s][0], &input[s][1]);
+    }
+
+    for (int s = 0; s < size; ++s) {
+        i = input[s][0];
+        j = input[s][1];
+        int max = maxcollatz(i, j);
+        printf("%d %d %d", i, j, max);
+        printf("%c", NEWLINE);
+    }
+
+    return EXIT_SUCCESS;
+}