Skip to content

This repository was archived by the owner on Dec 1, 2021. It is now read-only.

Added challenge_text for [Easy] #22 and #31 #93

Merged

freddiev4 merged 1 commit into freddiev4:master from rowmatrix:master

Mar 24, 2016

Merged

Added challenge_text for [Easy] #22 and #31 #93

Changes from all commits

Commits

Show all changes

Select commit

Added challenge_text for [Easy] #22 and #31

rowmatrix Mar 24, 2016

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

3 changes: 3 additions & 0 deletions Easy Challenges/Challenge #0022 [Easy]/challenge_text.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,3 @@
	Write a program that will compare two lists, and append any elements in the second list that doesn't exist in the first.
	input: ["a","b","c",1,4,], ["a", "x", 34, "4"]
	output: ["a", "b", "c",1,4,"x",34, "4"]

3 changes: 3 additions & 0 deletions Easy Challenges/Challenge #0031 [Easy]/challenge_text.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,3 @@
	Write a function that takes two base-26 numbers in which digits are represented by letters with A=0, B=1, ... Z=25 and returns their product using the same notation. As an example, CSGHJ ×ばつ CBA = FNEUZJA.
	Your task is to write the base-26 multiplication function.
	Try to be very efficient in your code!