Coming soon!
Goal: Using pseudocode, write up the steps to transform a time in digits into the time in words.
#Level 1 - Trick or Treat Write a program that displays the numbers 1 to 100. Instead of every multiple of 3, display "Trick". Instead of every multiple of 5, display "Treat". If a number is a multiple of both 3 and 5, display "Trick or Treat".
#Level 2 - Dividing up the Loot
You have been given a chocolate bar with n rows and m columns of squares of size 1 x 1. What is the minimum number of breaks you need to make in order to divide it up into individual squares?
#Bonus - Infinite Chocolate
Still want more? Well superstar, try this variation of the level 2 challenge:
You sneak into an evil wizard's workshop and see a bar of infinite chocolate, made up of squares of size 1 x 1. You are only able to make n cuts before she returns. What is the maximum number of squares you can cut off?
Goal: Return array containing smallest number of coins to make change for given amount
Input: An integer representing the number of cents
Output: Array where A[0] = pennies A[1] = nickels A[2] = dimes A[3] = quarters
Goal: Dive into the Quantum Gates, and working with Qubits!
Implement an AI for Tic Tac Toe using MiniMax
Goal: Use a divide and conquer algorithm to find the one missing letter in a sequence of otherwise contiguous letters
Input: An array of letters, all lowercase
Output: The letter missing from the sequence
Example: ['a','b','c','d','f'] -> 'e'
Goal: Validate a sudoku board
Input: An array of n arrays, each containing n elements
Output: True if each row, column, and 3x3 square contains the digits 1-9; False otherwise
Given an n x n array, return the array elements arranged from outermost elements to the middle element, traveling clockwise.
Example: array = [[1,2,3], [4,5,6], [7,8,9]] snail(array) => [1,2,3,6,9,8,7,4,5]