derektypist
Trainee Web Developer with IT Career Switch | HTML | CSS | JavaScript | Python | Bootstrap | jQuery | Font Awesome | Google Fonts
IT Career SwitchManea, Cambridgeshire
Pinned Repositories
build-a-pokemon-search-app
Build an app that searches for Pokémon by name or ID and displays the results to the user. This project makes use of freeCodeCamp's PokéAPI proxy.
build-a-rock-paper-scissors-game
Review DOM Manipulation by building a Rock, Paper, Scissors game.
coding-traineeship-projects
This repo is part of the IT Career Switch Coding Traineeship Program. I have practiced the projects and gained wide range of projects and gained wide range of web knowledge across multiple programming languages and libraries.
national-contiguity
Show National Contiguity with a Force Directed Graph
project-euler-031
Find the number of ways to make n pence using any number of coins
project-euler-042
Find the number of triangle words in the provided array. A PDF File is available for viewing the words. A triangle word is whose word value is a triangle number. A word value is the sum of numbers corresponding to its alphabetical position. For example, SKY has a word value of 55, because 19 + 11 + 25 = 55. SKY is a triangle word, because 55 is a triangle number.
project-euler-055
Counts the number of Lychrel Numbers below the limit (e.g. 10000)
ravenous
simon-game
Simon is a memory skill game
tic-tac-toe
Tic Tac Toe is a game for 2 players. You can play against the computer or another human player.
derektypist's Repositories
derektypist/project-euler-031
Find the number of ways to make n pence using any number of coins
derektypist/build-a-cafe-menu
Design a Menu Page for a cafe webpage using CSS
derektypist/build-a-city-skyline
Build a City Skyline using CSS Variables
derektypist/build-a-ferris-wheel
Build a Ferris Wheel using CSS Animation
derektypist/build-a-magazine
Build a Magazine using CSS Grid
derektypist/build-a-penguin
Build a Penguin using CSS Transforms
derektypist/build-a-piano
The aim is to build a piano using CSS and Responsive Design
derektypist/css-colored-markers
Build a Set of Colored Markers
derektypist/project-euler-014
Find the starting number, under the limit (e.g. 1000000), which produces the longest chain
derektypist/project-euler-015
Starting at the top left corner of a 2x2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner. How many such routes are there through a given grid size?
derektypist/project-euler-016
2 to the power of 15 gives 32768, and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. The aim is to find the sum of the digits of 2 to the power of exponent, where exponent is a number (e.g. 1000).
derektypist/project-euler-017
If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. The aim is to find the number of letters used if all the numbers from 1 to n (e.g. 1000) inclusive are written in words.
derektypist/project-euler-018
Find the maximum total from top to bottom in the triangle
derektypist/project-euler-019
Find the number of Sundays that fall on the first of each month during the given years
derektypist/project-euler-020
n! means n x (n-1) x ... x 3 x 2 x 1. For example, 10! = 10 x 9 x ... x 3 x 2 x 1 = 3628800. The sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. The aim is to find the sum of the digits in the number 100! as well as other numbers (e.g. 25!).
derektypist/project-euler-021
Let d(n) be the sum of the proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a does not equal b, then a and b are an amicable pair and each of a and b are called amicable numbers. For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220. The aim is to find the sum of all the amicable numbers less than a certain value (e.g. 10000)
derektypist/project-euler-022
Finds the total of all names scores in the array. A PDF file of the names is supplied.
derektypist/project-euler-023
Find the sum of all positive numbers that cannot be written as the sum of two abundant numbers.
derektypist/project-euler-024
A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all the permutations are listed alphabetically or numerically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are 012, 021, 102, 120, 201 and 210. The aim is to find the nth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.
derektypist/project-euler-025
Find the index of the first term in the Fibonacci sequence to contain n digits. For example, the index of the first term in the Fibonacci sequence to contain 3 digits is 12.
derektypist/project-euler-026
Find the value of d<n, for which 1/d contains the longest recurring cycle in its decimal fraction part.
derektypist/project-euler-027
Find the product of the coefficients a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n=0. In the form of (n*n) + an + b.
derektypist/project-euler-028
Find the sum of the numbers on the diagonals in an n x n spiral
derektypist/project-euler-029
Find the number of distinct terms in the sequence generated by a to the power of b, where a is between 2 and n and b is between 2 and n. For example, if n is 15 there would be 177 distinct terms.
derektypist/project-euler-030
Find the sum of all the numbers that can be written as the sum of nth powers of their digits.
derektypist/project-euler-032
Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through n pandigital, where n is the number of digits.
derektypist/project-euler-033
If the product of the four fractions is given in its lowest common terms, find the value of the denominator.
derektypist/project-euler-034
Find the sum of all numbers which are equal to the sum of the factorial of their digits. Note: As 1! = 1 and 2! = 2 are not sums, they are not included.
derektypist/project-euler-035
197 is an example of a circular prime, because its rotations 197, 971 and 719 are also prime. There are 13 circular primes below 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 and 97. The aim is to find the number of circular primes below a certain number (e.g. 1000000).
derektypist/Python
All Algorithms implemented in Python