Pinned Repositories
grocer
Grocer for Team Based Mobile App Dev
C-Sharp-Playground
Isaq
This is a weather bot for Disocrd.
RESTful-Web-API
This is a potential design of a RESTful web API that is documented in markdown. The challenge requires that the documentation is to be hosted on GitHub in a public repository.
super-waddle
This is a script that will look for log files for Star Citizen
Text-to-Speech
This is a for iOS 3 Challenge 1
turbo-sniffle
This is a project for working with Pandas using Json files from Foundry VTT Chat box
okrek6's Repositories
okrek6/C-Sharp-Playground
okrek6/super-waddle
This is a script that will look for log files for Star Citizen
okrek6/Isaq
This is a weather bot for Disocrd.
okrek6/RESTful-Web-API
This is a potential design of a RESTful web API that is documented in markdown. The challenge requires that the documentation is to be hosted on GitHub in a public repository.
okrek6/turbo-sniffle
This is a project for working with Pandas using Json files from Foundry VTT Chat box
okrek6/Bullseye
This is my walkthrough of the Bullseye app lessons from www.raywenderlich.com
okrek6/C-Questions
This is a collection of C sharp questions
okrek6/Create-Phone-Number
Write a function that accepts an array of 10 integers (between 0 and 9), that returns a string of those numbers in the form of a phone number.
okrek6/CrimeAnalyzer
This is a challenge for 2040, C#
okrek6/Document
This is for module 4
okrek6/DocumentMerger
Merge text documents provided by the user into a new file in C#
okrek6/Dog
This application provides experience with creating classes and instances of objects in C#.
okrek6/Even-Fibonacci-Numbers
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
okrek6/FizzBuzz
This is code that I wrote for the FizzBuzz challenge in Module 1, which we were given a choice in what language we wanted to use to complete it so I chose Python in this case.
okrek6/Groove
This a repo for my routine app called Groove
okrek6/Largest-palindrome-product
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers.
okrek6/LargestPrimeFactor
Write a Python program to find the largest prime factor of a given number. The prime factors of 330 are 2, 3, 5 and 11. Therefore 11 is the largest prime factor of 330. Sample Example: 330 = 2 × 3 × 5 × 11
okrek6/Laudios
Brendan and Jordan Colab
okrek6/learn-tdd
:white_check_mark: A brief introduction to Test Driven Development (TDD) in JavaScript (Complete Beginner's Step-by-Step Tutorial)
okrek6/Multiples3and5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.
okrek6/nuget
This is a dumb script that will scran your drives for Fortnite, and delete it because.. well it is cancer.
okrek6/okrek6
okrek6/okrek6-Sum-w-o-high-and-low
Sum all the numbers of the array (in F# and Haskell you get a list) except the highest and the lowest element (the value, not the index!). (The highest/lowest element is respectively only one element at each edge, even if there are more than one with the same value!)
okrek6/Pets
This is a challenge to demonstrate the knowledge of Classes in C#
okrek6/pzmap2dzi
A command-line tool to convert Project Zomboid map data into Deep Zoom format
okrek6/screaming-dollop
okrek6/Smallest-Multiple
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
okrek6/special-enigma
Excercise from Code Wars
okrek6/SQL-Sanitizer
okrek6/URLEncoder
This is a repository for the URLEncoder challenge from module 5.