StandyMerizier

Alumni-Learning-Plan

baristaApp

Full Stack Barista Game

chessApp

full stack chess app

chessSTM

Chess game with user v computer, with a global chat of everyone in the network

codewars-simpleBeadsCount

code wars - Two red beads are placed between every two blue beads. There are N blue beads. After looking at the arrangement below work out the number of red beads. @ @@ @ @@ @ @@ @ @@ @ @@ @ Implement count_red_beads(N_blue) (in PHP count_red_beads($n); in Java, Javascript countRedBeads(n)) so that it returns the number of red beads. If there are less than 2 blue beads return 0.

codeWarsSolutions

A repo for all code wars solutions I have successfully completed.

portfolio

Personal portfolio that display live projects

rockPaperScissors

rock, paper, scissors with local host (Node)

stopLight

StopLight using Jquery and CSS KeyFrames

yugiohCards

an express app that display yugioh cards and comments

StandyMerizier/stopLight

StopLight using Jquery and CSS KeyFrames

StandyMerizier/portfolio

Personal portfolio that display live projects

StandyMerizier/codeWarsSolutions

A repo for all code wars solutions I have successfully completed.

StandyMerizier/Alumni-Learning-Plan

StandyMerizier/codewars-simpleBeadsCount

code wars - Two red beads are placed between every two blue beads. There are N blue beads. After looking at the arrangement below work out the number of red beads. @ @@ @ @@ @ @@ @ @@ @ @@ @ Implement count_red_beads(N_blue) (in PHP count_red_beads($n); in Java, Javascript countRedBeads(n)) so that it returns the number of red beads. If there are less than 2 blue beads return 0.

StandyMerizier/demo-user-profile-images

StandyMerizier/resilient-coders-talk

Materials for Resilient Coders systems talk

StandyMerizier/chessSTM

Chess game with user v computer, with a global chat of everyone in the network

StandyMerizier/alumni-class-coding-challenge01

StandyMerizier/alumni-class-coding-challenge02

StandyMerizier/alumni-class-coding-challenge03

StandyMerizier/alumni-exercises-0.1-0.6

StandyMerizier/alumni-exercises-1.1-1.14

StandyMerizier/alumni-week01-coding-challenges

StandyMerizier/alumni-week2-coding-challenges

StandyMerizier/alumni-week3-coding-challenges

StandyMerizier/awesome-courses

:books: List of awesome university courses for learning Computer Science!

StandyMerizier/bookReact

A React project using the Google's Books API

StandyMerizier/challenge

StandyMerizier/codewars-abbreviatedATwoWordName

code wars - Write a function to convert a name into initials. This kata strictly takes two words with one space in between them. The output should be two capital letters with a dot seperating them. It should look like this: Sam Harris => S.H Patrick Feeney => P.F

StandyMerizier/codewars-countingSheep

code wars - Task: Given a number, 3 for example, return a string with a murmur: "1 sheep...2 sheep...3 sheep..." Note: You will always receive a positive integer.

StandyMerizier/codewars-friendOrFoe

code wars - Make a program that filters a list of strings and returns a list with only your friends name in it. If a name has exactly 4 letters in it, you can be sure that it has to be a friend of yours! Otherwise, you can be sure he's not... Ex: Input = ["Ryan", "Kieran", "Jason", "Yous"], Output = ["Ryan", "Yous"] Note: keep the original order of the names in the output.

StandyMerizier/codewars-highestandlowest

code wars - In this little assignment you are given a string of space separated numbers, and have to return the highest and lowest number.

StandyMerizier/codewars-sumOfAllMultiplesOf3or5

code wars - Your task is to write function findSum. Up to and including n, this function will return the sum of all multiples of 3 and 5. For example: findSum(5) should return 8 (3 + 5) findSum(10) should return 33 (3 + 5 + 6 + 9 + 10)

StandyMerizier/codewars-twoFigthersOneWinner

code wars - Create a function that returns the name of the winner in a fight between two fighters. Each fighter takes turns attacking the other and whoever kills the other first is victorious. Death is defined as having health <= 0. Each fighter will be a Fighter object/instance. See the Fighter class below in your chosen language. Both health and damagePerAttack (damage_per_attack for python) will be integers larger than 0. You can mutate the Fighter objects.

StandyMerizier/fp-js

Functional programming exercises in javascript

StandyMerizier/noteToSelfReact

A React project that remembers a note written to yourself (like a to-do list) using technologies such as React and sfcookies

StandyMerizier/spootify

SolveFinance FrontEnd Engineer code challenge

StandyMerizier/standymerizier

My personal repository

StandyMerizier/week01-alumni-project-calculator