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.
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.
wikipedia-viewer
derektypist's Repositories
derektypist/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.
derektypist/project-euler-055
Counts the number of Lychrel Numbers below the limit (e.g. 10000)
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/project-euler-036
The decimal number 585 = 1001001001 (Base 2) is palindromic in both bases. The aim is to find the sum of all numbers less than n, whereas n is between 1000 and 1000000, which are palindromic in base 10 and base 2. (Please note that the palindromic number, in either base, may not include leading zeros.)
derektypist/project-euler-037
Find the sum of the only n (between 8 and 11) primes that are both truncatable from left to right and from right to left. NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.
derektypist/project-euler-038
Find the largest 1 to k pandigital k-digit number that can be formed as the concatenated product of an integer (1,2,...,n) where n is greater than 1.
derektypist/project-euler-039
Find the perimeter less than or equal to n (e.g. 1000), for which the number of solutions is maximised.
derektypist/project-euler-040
An irrational decimal fraction is created by concatenating the positive integers 0.123456789101112131415161718192021... If dn represents the nth digit of the fractional part, the aim is to find the value of d1 x d10 x d100 x d1000 x d10000 x d100000 x d1000000
derektypist/project-euler-041
An n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. The aim is to find the largest n-length digit pandigital prime.
derektypist/project-euler-043
The aim is to find the sum of 0 to n pandigital numbers with sub-strings fulfilling n-2 of the properties (Divisible by 2, 3, 5, 7, 11, 13 and 17).
derektypist/project-euler-044
Pentagonal Numbers are generated by the formula Pn = n(3n-1)/2. The first ten pentagonal numbers are 1, 5, 12, 22, 35, 51, 70, 92, 117, 145. The aim is to find the pair of pentagonal numbers, Pj and Pk , for which their sum and difference is pentagonal and D = |Pk - Pj| is minimised. Find the value of D.
derektypist/project-euler-045
Triangle Numbers are generated by the formula Tn = n(n+1)/2 - Its numbers are 1, 3, 6, 10, 15,.... Pentagonal Numbers are generated by the formula Pn = n(3n-1)/2 - Its numbers are 1, 5, 12, 22, 35,.... Hexagonal numbers are generated by the formula Hn = n(2n-1) - Its numbers are 1, 6, 15, 28, 45,.... It can be verified that T285 = P165 = H143 = 40755. Find the next triangle number that is also pentagonal and hexagonal.
derektypist/project-euler-046
Find the smallest odd composite that cannot be written as the sum of a prime and twice a square as described in https://projecteuler.net/problem=46
derektypist/project-euler-047
Finds the first consecutive number in the consecutive numbers to have a certain number of distinct prime factors each. For example, 14 is the first consecutive number of two consecutive numbers (14 and 15) to have two distinct prime factors.
derektypist/project-euler-048
The series 1**1 + 2**2 + 3**3 + ... + 10**10 = 10405071317. The aim is to find the last 10 digits in the series 1**1 + 2**2 + ... + 1000**1000
derektypist/project-euler-049
The arithmetic sequence 1487, 4817 and 8147 increases by 3330. Each of the three terms is prime and each of the 4-digit numbers are permutations of one another. The aim is to find the 12-digit number formed by concatenating the three terms in another increasing sequence.
derektypist/project-euler-050
Find the prime below one-million or other limits that can be written as the sum of the most consecutive primes.
derektypist/project-euler-051
Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an n prime value family.
derektypist/project-euler-052
Find the smallest positive integer, such that multiplied by integers 2, 3, ..., n contain the same digits.
derektypist/project-euler-053
Find the number of values of nCr for 1 ≤ n ≤ 100, greater than one-million or other limits.
derektypist/project-euler-054
The aim is to find the number of hands Player 1 wins using the provided array.
derektypist/project-euler-056
Considering natural numbers in the form of a to the power of b, where a and b are less than n, the aim is to find the maximum digital sum.
derektypist/project-euler-057
In the first n expansions, find the number of fractions that contain a numerator with more digits than the denominator. n is a number between 10 and 1000.
derektypist/project-euler-058
Find the side length of the square spiral for which the percent of primes along both diagonals falls below a given percent.
derektypist/project-euler-059
Find the sum of the ASCII values in the original text.
derektypist/project-euler-060
Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.
derektypist/project-euler-061
Find the sum of n cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, [hexagonal, heptagonal, and octagonal], is represented by a different number in the set
derektypist/project-euler-062
Find the smallest cube for which exactly n permutations of its digits are cube as described in https://projecteuler.net/problem=62
derektypist/project-euler-063
Find the number of positive integers of length n and an nth power