THIS REPO IS NO LONGER USED PLEASE CHECK https://github.com/CodeCaveServer/Code-Cave-weekly-challenges
Twice a week, a challenge is posted on the discord server. This Github repo is to keep track of them.
In each challenge folder, please upload the file with your discord username as the file name. There will be a new folder made for each challenge.
Discord: https://discord.gg/RaV8zjXfJG
The app needs to ask for a imput for high and you have to give generate a mario triangle
for example i give the height as 4 it would print
#
##
###
####
if you want a harder one it would print
# #
## ##
### ###
#### ####
Instructions
Given a number determine whether or not it is valid per the Luhn formula.
The Luhn algorithm is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers.
The task is to check if a given string is valid. Validating a Number
Strings of length 1 or less are not valid. Spaces are allowed in the input, but they should be stripped before checking. All other non-digit characters are disallowed. Example 1: valid credit card number
4539 3195 0343 6467
The first step of the Luhn algorithm is to double every second digit, starting from the right. We will be doubling
4_3_ 3_9_ 0_4_ 6_6_
If doubling the number results in a number greater than 9 then subtract 9 from the product. The results of our doubling:
8569 6195 0383 3437
Then sum all of the digits:
8+5+6+9+6+1+9+5+0+3+8+3+3+4+3+7 = 80
If the sum is evenly divisible by 10, then the number is valid. This number is valid! Example 2: invalid credit card number
8273 1232 7352 0569
Double the second digits, starting from the right
7253 2262 5312 0539
Sum the digits
7+2+5+3+2+2+6+2+5+3+1+2+0+5+3+9 = 57
57 is not evenly divisible by 10, so this number is not valid.
Instructions
Given a phrase, count the occurrences of each word in that phrase.
For the purposes of this exercise you can expect that a word will always be one of:
A number composed of one or more ASCII digits (ie "0" or "1234") OR
A simple word composed of one or more ASCII letters (ie "a" or "they") OR
A contraction of two simple words joined by a single apostrophe (ie "it's" or "they're")
When counting words you can assume the following rules:
The count is case insensitive (ie "You", "you", and "YOU" are 3 uses of the same word)
The count is unordered; the tests will ignore how words and counts are ordered
Other than the apostrophe in a contraction all forms of punctuation are ignored
The words can be separated by any form of whitespace (ie "\t", "\n", " ")
For example, for the phrase "That's the password: 'PASSWORD 123'!", cried the Special Agent.\nSo I fled. the count would be:
that's: 1
the: 2
password: 2
123: 1
cried: 1
special: 1
agent: 1
so: 1
i: 1
fled: 1
Caesar Cipher The Caesar cypher shifts the letters that the user imputers but the amount input. If the original ``` a b c d e f g h i j k l m n o p q r s t u v w x y z
Then a shift by 3 should be
``` ```
d e f g h i j k l m n o p q r s t u v w x y z a b c
The user should be able to choose the amount they shift by.
Challenge: keep the punctuation in place @Pings
The "Reverser" takes a string as input and returns that string in reverse order, with the opposite case.
Examples reverse("Hello World") ➞ "DLROw OLLEh"
reverse("ReVeRsE") ➞ "eSrEvEr"
reverse("Radar") ➞ "RADAr"
Note: punctuation is not checked
Create a function that takes a number as an argument and returns "Fizz", "Buzz" or "FizzBuzz".
If the number is a multiple of 3 the output should be "Fizz".
If the number given is a multiple of 5, the output should be "Buzz".
If the number given is a multiple of both 3 and 5, the output should be "FizzBuzz".
If the number is not a multiple of either 3 or 5, the number should be output on its own as shown in the examples below.
The output should always be a string even if it is not a multiple of 3 or 5.
Examples
fizz_buzz(3) ➞ "Fizz"
fizz_buzz(5) ➞ "Buzz"
fizz_buzz(15) ➞ "FizzBuzz"
fizz_buzz(4) ➞ "4"
Create a function that takes a string as an argument and returns the Morse code equivalent.
Examples encode_morse("EDABBIT CHALLENGE") ➞ ". -.. .- -... -... .. - -.-. .... .- .-.. .-.. . -. --. ."
encode_morse("HELP ME !") ➞ ".... . .-.. .--. -- . -.-.--" Help if needed This dictionary can be used for coding:
char_to_dots = { 'A': '.-', 'B': '-...', 'C': '-.-.', 'D': '-..', 'E': '.', 'F': '..-.', 'G': '--.', 'H': '....', 'I': '..', 'J': '.---', 'K': '-.-', 'L': '.-..', 'M': '--', 'N': '-.', 'O': '---', 'P': '.--.', 'Q': '--.-', 'R': '.-.', 'S': '...', 'T': '-', 'U': '..-', 'V': '...-', 'W': '.--', 'X': '-..-', 'Y': '-.--', 'Z': '--..', ' ': ' ', '0': '-----', '1': '.----', '2': '..---', '3': '...--', '4': '....-', '5': '.....', '6': '-....', '7': '--...', '8': '---..', '9': '----.', '&': '.-...', "'": '.----.', '@': '.--.-.', ')': '-.--.-', '(': '-.--.', ':': '---...', ',': '--..--', '=': '-...-', '!': '-.-.--', '.': '.-.-.-', '-': '-....-', '+': '.-.-.', '"': '.-..-.', '?': '..--..', '/': '-..-.' }
Convert to Hex Create a function that takes a string's characters as ASCII and returns each character's hexadecimal value as a string.
Examples convert_to_hex("hello world") ➞ "68 65 6c 6c 6f 20 77 6f 72 6c 64"
convert_to_hex("Big Boi") ➞ "42 69 67 20 42 6f 69"
convert_to_hex("Marty Poppinson") ➞ "4d 61 72 74 79 20 50 6f 70 70 69 6e 73 6f 6e" Notes Each byte must be seperated by a space. All alpha hex characters must be lowercase.
The Karaca's Encryption Algorithm Make a function that encrypts a given input with these steps:
Input: "apple"
Step 1: Reverse the input: "elppa"
Step 2: Replace all vowels using the following chart:
a => 0
e => 1
i => 2
o => 2
u => 3
"1lpp0"
Step 3: Add "aca" to the end of the word: "1lpp0aca"
Output: "1lpp0aca"
Examples``` encrypt("banana") ➞ "0n0n0baca"
encrypt("karaca") ➞ "0c0r0kaca"
encrypt("burak") ➞ "k0r3baca"
encrypt("alpaca") ➞ "0c0pl0aca"``` Notes All inputs are strings, no uppercases and all output must be strings.
Is This a Haiku?
Haikus are poems formed by three lines of 5, 7, and 5 syllables. Your task is to write a function that determines if a given poem scans as a Haiku.
How to count syllables:
Every syllable must contain at least one vowel.
If two or more vowels appear back to back, they should be counted as a single vowel (e.g. "fair").
If an "e" appears at the end of a word, it shouldn't be counted, as those aren't usually pronounced. That extends to words ending in es or e's.
An exception to the previous point is a word whose only vowel appears at the end (e.g. "the" or "She's").
"Y" counts as a vowel.
Examples
haiku("New vids ev'ry day / Never skipped a single day / I'll see you in March") ➞ True
haiku("Delightful display / Snowdrops bow their pure white heads / To the sun's glory") ➞ True
haiku("Superman's my fav / Wonder Woman is pretty dope / Don't forget Rorschach") ➞ False
Notes
Each new line of the poem will be marked with a /.
You may find commas, apostrophes, and other punctuation marks.
##task 11
Binary To ASCII Conversion
Create a function that takes a string of 1's and 0's (binary) as an argument and return the equivalent decoded ASCII text. Characters can be in the range of "00000000" to "11111111", which means every eight digits of binary input represents a single character.
a = 01100001 b = 01100010 c = 01100011
If you were to combine these characters into the string "abc", the corresponding binary would be 011000010110001001100011. Use the resources tab for more info on how to approach this.
Examples
binaryConversion("010010010010000001101100011011110111011001100101001000000101010001100101011100110110100000100001") ➞ "I love Tesh!"
binaryConversion("001100010011001000110001001100110011000100110111") ➞ "121317"
binaryConversion("010000010110110101100001011110100110100101101110011001110010000001000101011001000110000101100010011010010111010000100001") ➞ "Amazing Edabit!"
Notes
If you are given an empty string as input, you must also return an empty string. Otherwise, the input will always be a valid binary string.
Interview question
This problem was asked by Microsoft.
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example, given [100, 4, 200, 1, 3, 2], the longest consecutive element sequence is [1, 2, 3, 4]. Return its length: 4.
Your algorithm should run in O(n) complexity.
Create a function that takes two arguments as input:
A positive integer that describes the size of a grid. For example, when the value of the argument is 10, a 10x10 grid will be used.
A list of one or more tuples of size 3. Each tuple represents a block of the grid, and the meanings of the tuple's elements are: 1. The x coordinate. 2. The y coordinate. 3. The range of the block.
The range of a block is the maximum distance from the block situated at the x and y coordinates to other blocks. The distance can't be calculated vertically. The function returns the block that has the most overlaps. Worked Examples
The tuple (3, 3, 2) covers the following blocks: (1, 3), (2, 4), (2, 3), (2, 2), (3, 5), (3, 4), (3, 3), (3, 2), (3, 1), (4, 4), (4, 3), (4, 2), (5, 3).
Here is a visualization of that, when the first argument is 5, and the second argument is [(3, 3, 2)]:
00100
01110
11111
01110
00100
The 1s represent the blocks covered by (3, 3, 2), while the 0s represent empty blocks. The biggest value on the grid is 1, hence most_overlapped_block(5, [(3, 3, 2)]) returns 1.
If the first argument is 5, and the second argument is [(3, 3, 2), (1, 1, 2)], the grid will look like this:
00100
01110
21111
12110
11200
The 2s represent the blocks of (3, 3, 2) and (1, 1, 2) that overlap. The biggest value on the grid is 2, hence most_overlapped_block(5, [(3, 3, 2, (1, 1, 2))]) returns 2.
Examples
most_overlapped_block(10, [(3, 3, 3), (1, 1, 4)]) ➞ 2
most_overlapped_block(10, [(5, 5, 2), (1, 1, 1)]) ➞ 1
most_overlapped_block(10, [(1, 1, 1), (1, 1, 2), (1, 1, 3)]) ➞ 3
Notes
There can be more than one tuples that look the same in the second argument, like `[(3, 3, 2), (3, 3, 2)]`.
Remember to not count the blocks that are outside the grid.
`most_overlapped_block(1, [(10, 10, 1), (10, 10, 1)])` returns `0`.
Create two functions toCamelCase() and toSnakeCase() that each take a single string and convert it into either camelCase or snake_case. Examples``` toCamelCase("hello_edabit") ➞ "helloEdabit"
toSnakeCase("helloEdabit") ➞ "hello_edabit"
toCamelCase("is_modal_open") ➞ "isModalOpen"
toSnakeCase("getColor") ➞ "get_color"
Notes
Test input will always be appropriately formatted as either camelCase or snake_case, depending on the function being called.