Continuing on from my last post, I am posting my succesful output for the Day 2 Part 1 below.
A full explanation of Day 2 part 1 can be found at: https://adventofcode.com/2018/day/2 and the input can be found
at: https://adventofcode.com/2018/day/2/input
A brief description of this exercise is that you receive a sequence of strings.
You have to count the if any duplicate or triplicate chars exist in the string. Multiples will exist, but if you find multiple ldupicates / triplicates you will count them once.
At the end of sequence of strings you have to SUM the no. of duplicate / triplicate chars a

After many sleepless nights it's a pleasure to announce the newer, better, moderner ObjectScript compiler which implemented pretty much everything you ever wanted to have in 

