diff --git a/.github/.keep b/.github/.keep
new file mode 100644
index 0000000..e69de29
diff --git a/src/.idea/.gitignore b/src/.idea/.gitignore
new file mode 100644
index 0000000..ab1f416
--- /dev/null
+++ b/src/.idea/.gitignore
@@ -0,0 +1,10 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Ignored default folder with query files
+/queries/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml
+# Editor-based HTTP Client requests
+/httpRequests/
diff --git a/src/.idea/misc.xml b/src/.idea/misc.xml
new file mode 100644
index 0000000..a20905f
--- /dev/null
+++ b/src/.idea/misc.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/.idea/modules.xml b/src/.idea/modules.xml
new file mode 100644
index 0000000..31eaf94
--- /dev/null
+++ b/src/.idea/modules.xml
@@ -0,0 +1,10 @@
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/.idea/vcs.xml b/src/.idea/vcs.xml
new file mode 100644
index 0000000..6c0b863
--- /dev/null
+++ b/src/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/main/java/com/codedifferently/coding/level/beginner/set01/Problem.java b/src/main/java/com/codedifferently/coding/level/beginner/set01/Problem.java
index f419b34..56b03a9 100644
--- a/src/main/java/com/codedifferently/coding/level/beginner/set01/Problem.java
+++ b/src/main/java/com/codedifferently/coding/level/beginner/set01/Problem.java
@@ -16,7 +16,20 @@ public class Problem {
public static Boolean avengersAssemble(boolean dcHero, boolean avengerHero) {
- return null;
+ if (dcHero == false && avengerHero == false){
+ return true;
+ }
+
+ else if(dcHero == false && avengerHero){
+ return true;
+ }
+
+ else if (dcHero && avengerHero == false){
+ return false;
+ }
+ else {
+ return true;
+ }
}
@@ -32,8 +45,13 @@ public static Boolean avengersAssemble(boolean dcHero, boolean avengerHero) {
*/
public static Boolean nearValue(int n) {
+ if(( Math.abs(n) >=90 && Math.abs(n)<=100) || (Math.abs(n) >= 190 && Math.abs(n)<=200)){
+ return true;
+ }
+
+
+ return false;
- return null;
}
/* Problem 4
@@ -47,8 +65,9 @@ public static Boolean nearValue(int n) {
*/
public static String missingLetter(String letter, int n) {
-
- return null;
+ String firstHalf = letter.substring(0,n);
+ String secondHalf = letter.substring(n+1, letter.length());
+ return firstHalf+secondHalf;
}
/* Problem 5
@@ -62,8 +81,8 @@ public static String missingLetter(String letter, int n) {
*/
public static String wordOfDay(String word) {
-
- return null;
+ char lastLetter = word.charAt(word.length()-1);
+ return lastLetter + word + lastLetter;
}
/* Problem 6
@@ -75,8 +94,10 @@ public static String wordOfDay(String word) {
*/
public static Boolean beginWithHi(String phrase) {
-
- return null;
+ if (phrase.substring(0,2).equals("hi")){
+ return true;
+ }
+ return false;
}
/* Problem 7
@@ -89,8 +110,7 @@ public static Boolean beginWithHi(String phrase) {
*/
public static Boolean containTeen(int one, int two, int three){
-
- return null;
+ return(!(one >= -12 && one <=12) || !(two >= -12 && two <=12) || !(three >= -12 && three <=12));
}
/* Problem 8
@@ -104,12 +124,11 @@ public static Boolean containTeen(int one, int two, int three){
*/
public static Boolean startWithIx(String phrase) {
-
- return null;
+ return (phrase.substring(0,3) .equals("mix") || phrase.substring(1,3).equals("ix"));
}
/* Problem 9
- Provide two numbers, evalute both numbers to see which one is nearest to the value 10.
+ Provide two numbers, evaluate both numbers to see which one is nearest to the value 10.
Some numbers may have the same range in how near they are to 10; such as 13 and 7 both are 3 from 10;
In that case, we would consider that event a tie.
Tip: Math.abs(n) returns the absolute value of a number
@@ -119,9 +138,18 @@ public static Boolean startWithIx(String phrase) {
near10(13, 7) --> 0
*/
- public static Integer near10(int one, int two){
+ public static Integer near10(int one, int two) {
+ if (Math.abs(10-one) < Math.abs(10 - two)) {
+ return one;
+ }
- return null;
+ else if (Math.abs(10-one) > Math.abs(10-two)) {
+ return two;
+ }
+
+ else {
+ return 0;
+ }
}
/* Problem 10
@@ -133,7 +161,17 @@ public static Integer near10(int one, int two){
*/
public static Boolean containE(String str) {
-
- return null;
+ int eCounter = 0;
+ for (int i=0; i true
+avengersAssemble(false, true) --> true
+avengersAssemble(true, false) --> false
+avengersAssemble(true, true) --> true
+```
+
+### Problem 03
+You and your friends are out walking on the boardwalk at Atlantic City
+and decided to go to Casino for the fun of it. One person won
+___ amount of money. You're trying to find out if the amount was between 90-100 or 190-200.
+
+Return true if the amount of money is within 10 of 100 or 200.
+
+Tip: Math.abs(num) computes the absolute value of a number.
+
+Example:
+```java
+nearValue(93) --> true
+nearValue(90) --> true
+nearValue(89) --> false
+```
+### Problem 04
+The instructor provided you with a non-empty string and a number n.
+The instructor wants you to remove the letter at index n and provide a new string.
+
+Tip: Value of n should be a valid index of a given letter in the original string,
+such as 0 or str.length()-1 inclusive
+
+Example:
+```java
+missingLetter("kitten", 1) --> "ktten"
+missingLetter("kitten", 0) --> "itten"
+missingLetter("kitten", 4) --> "kittn"
+```
+
+### Problem 05
+Given the word of the day, take the last letter and
+return a new word of the day when you add the last letter to the front and back of the word.
+For example, "founder" yields "rfounderr".
+
+Tip: The word of the day will be a length 1 or more
+
+Example:
+```java
+wordOfDay("cat") --> "tcatt"
+wordOfDay("Hello" --> "oHelloo"
+wordOfDay("a") --> "aaa"
+```
+
+### Problem 06
+Johnnys favorite pharse to say is hi, he wants to know if the pharses given start with "hi".
+Provide Johnny with a string, and return true if the string starts with "hi" and false otherwise.
+
+Example:
+```java
+beginWithHi("hi there") --> true
+beginWithHi("hi") --> true
+beginWithHi("hello hi") --> false
+```
+
+### Problem 07
+If you think of the basic numbers 0-20, you will notice that 13-19 contain the word "teen" in them.
+The math instructor provides you with 3 numbers, you need to decided if 1 or more of them contain teen.
+
+Return true if 1 or more of them contain teen.
+
+Example:
+```java
+containTeen(13, 20, 10) --> true
+containTeen(20, 19, 10) --> true
+containTeen(20, 10, 13) --> true
+```
+
+### Problem 08
+Your local rapper is looking to create his next hook for his next track. He wants to add phrases that begin with "mix".
+But he decides he wants to take it a step further and accept any phrase except the "m" can be any letter or number.
+He needs your help to make sure the list of given phrases begin with what was asked.
+
+Return true if the given phrase begins with "mix", or any beginning letter or number following "ix"
+
+Example:
+```java
+startWithIx("mix snacks") --> true
+startWithIx("pix snacks") --> true
+startWithIx("piz snacks") --> false
+```
+
+### Problem 09
+Provide two numbers, evalute both numbers to see which one is nearest to the value 10.
+Some numbers may have the same range in how near they are to 10; such as 13 and 7 both are 3 from 10;
+In that case, we would consider that event a tie.
+
+Tip: Math.abs(n) returns the absolute value of a number
+
+Return whichever number is nearest to 10, or return 0 for the event of a tie.
+
+Example:
+```java
+near10(8, 13) --> 8
+near10(13, 8) --> 8
+near10(13, 7) --> 0
+```
+
+### Problem 10
+Determine if the given string contains between 1 and 3 'e' characters.
+Only if the string contains between 1 and 3 'e' characters; return true.
+
+Example:
+```java
+containE("Hello") --> true
+containE("Heelle") --> true
+containE("Heelele") --> false
+```
+
+
+## Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set02/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set02/Problem.class
new file mode 100644
index 0000000..e6c3fc6
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set02/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set02/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set02/ReadMe.md
new file mode 100644
index 0000000..0c15fb4
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set02/ReadMe.md
@@ -0,0 +1,138 @@
+# Problem Set 02
+
+You will be solving the given problems below.
+
+### Problem 11
+An elementary school teacher needs your help to create new strings for a fun activity they have planned. You will be
+provided a non-empty string and a number N. To create a new string, you will start with the character 0. Next you will
+add every Nth character of the string to the new string.
+
+Return the new string.
+
+Tip: If N is 3, use char 0, 3, 6 ... and so on. N is 1 or more.
+
+Example:
+```java
+everyOther("Miracle", 2) --> "Mrce"
+everyOther("abcdefg", 2) --> "aceg"
+everyOther("abcdefg", 3) --> "adg"
+```
+### Problem 12
+It's a nice day, and you're at the park and see two dogs, bulldog and lab.
+The parameters bulldogGrowl and labGrowl indicates if each dog is growling.
+Surrounding people are in a bit of trouble if both dogs are growling or if neither are growling but are in a stare down.
+
+Return true if those people are in trouble.
+
+Example:
+```java
+ dogTrouble(true, true) --> true
+ dogTrouble(false, false) --> true
+ dogTrouble(true, false) --> false
+```
+### Problem 13
+We have a loud crying puppy in an apartment building. The "hour" parameter is the current hour time
+in the range 0...23. We will get in trouble if the puppy is crying and the time is before 7 or after 20.
+
+Return true if we will get in trouble based on if the puppy is crying during a specfic time of day.
+
+Example:
+```java
+puppyCry(true, 6) --> true
+puppyCry(true, 7) --> false
+puppyCry(false, 6) --> false
+```
+### Problem 14
+Looking at your math worksheet, your given 2 number values of either positive or negative.
+Evaluate a problem and find out if one of those numbers is positive and the other is negative.
+
+Return true if one is negative and one is positive.
+
+An exception to this is if the parameter "negative" is true, then only return true if both are negative.
+
+Example:
+```java
+checkPosOrNeg(1, -1, false) --> true
+checkPosOrNeg(-1, 1, false) --> true
+checkPosOrNeg(-4, -5, true) --> true
+```
+### Problem 15
+With the provided string, you need to exchange the first and last characters to create a new string.
+
+Return the new string.
+
+Example:
+```java
+exchange("code") --> "eodc
+exchange("a") --> "a"
+exchange("ab") --> "ba"
+```
+### Problem 16
+We are looking to write down a list of all possible numbers that can be a
+multiple of 3 or 5.
+You will be given any number, but to be put on the list the number has to be a non-negative number.
+
+Return true if the given number can be added to the list.
+
+Tip: Think about using the % "mod" operator
+
+Example:
+```java
+multipleOf(3) --> true
+multipleOf(10) --> true
+multipleOf(8) --> false
+```
+### Problem 17
+You are given two random temperatures from different states.
+Between these two temperatures, we need to check if one state is freezing while the other is having an extreme hot day.
+Both of these statements need to be true to prove that some states have extreme cases of temperatures.
+
+Return true, if one temp is less than 0 and the other is greater than 100.
+
+Example:
+```java
+checkTemp(120, -1) --> true
+checkTemp(-1, 120) --> true
+checkTemp(2, 120) --> false
+```
+### Problem 18
+An upcoming artist's concert is coming to town.
+The concert manager is only allowing one person of a pair to be a "teen".
+Your at the front gate checking tickets and verifying ages.
+You allowed to let a pair in as long as only one person is a teen but both can't be a "teen".
+A "teen" is considered someone within the range of 13...19 inclusive.
+
+Return true if one or the other person in the pair is a teen, but not both.
+
+Example:
+```java
+oneTeen(13, 99) --> true
+oneTeen(21, 19) --> true
+oneTeen(13, 13) --> false
+```
+### Problem 19
+We're on the look-out for ounces "oz" within a string. You will be given a string,
+and you need to determine if the first two characters yields "oz".
+We need you to return a new string made of the first 2 chars (if present).
+
+Only include first char if it is 'o' and only include second char if it is 'z'.
+
+Example:
+```java
+beginWithOz("ozymandias") --> "oz"
+beginWithOz("bzoo") --> "z"
+beginWithOz("oxx") --> "o"
+```
+### Problem 20
+We are looking for numbers within two different ranges. You will be provided two numbers
+and need to see if they are both in the range of 30...40 inclusive or 40...50 inclusive.
+The numbers were looking for have to be within either one of those ranges.
+
+Return true if both numbers are in the range 30...40, or both numbers are in the range 40...50.
+
+Example:
+```java
+range3050(30, 31) --> true
+range3050(30, 41) --> false
+range3050(40, 50) --> true
+```
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set03/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set03/Problem.class
new file mode 100644
index 0000000..97172cd
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set03/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set03/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set03/ReadMe.md
new file mode 100644
index 0000000..672a76f
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set03/ReadMe.md
@@ -0,0 +1,145 @@
+# Problem Set 03
+
+You will be solving the given problems below.
+
+### Problem 21
+We're on the lookout for values that contain the same last digit.
+You will be given two non-negative numbers to compare.
+
+Tip: Note that the % "mod" operator computes remainders, so 17 % 10 is 7.
+
+Return true if both digits have the same last digit.
+
+Example:
+```java
+compareLastDigit(7, 17) --> true
+compareLastDigit(6, 17) --> false
+compareLastDigit(3, 113) --> true
+```
+### Problem 22
+A group of students is given an addition worksheet during class to compete against each other.
+The main goal is the find the sum of all the given values; you will be given a set of two numbers.
+The teacher decided to put a twist on the contest by providing one rule.
+
+Return the sum of two int values; but if the values are the same then return double their sum.
+
+Example:
+```java
+doubleTheSum(1, 2) --> 3
+doubleTheSum(3, 2) --> 5
+doubleTheSum(2, 2) --> 8
+```
+### Problem 23
+Tom's favorite number is ten, and he is on the look-out for the value 10 or the sum 10 out of the values given to him.
+Tom needs you to confirm if any of the values given have what he is looking for.
+
+Return true if one value is 10 or return true if the sum of both values is 10.
+
+Example:
+```java
+lookOut10(9, 10) --> true
+lookOut10(9, 9) --> false
+lookOut10(1, 9) --> true
+```
+### Problem 24
+Every string needs to begin with "not", in order to do that you need to add "not" to the beginning of a provided string.
+But if the string already begins with "not" we will leave it alone, no need to have a "not not".
+
+Return a new string where "not" has been added to the front.
+
+Tip: Use .equals() to compare 2 strings
+
+Example:
+```java
+beginWithNot("candy") --> "not candy"
+beginWithNot("x") --> "not x"
+beginWithNot("not bad") --> "not bad"
+```
+### Problem 25
+The most popular number today is 3. We need the first 3 characters of a string, and we need to make
+3 copies of those 3 characters. The front of a string is considered those 3 characters. The front can
+be less than 3, just need to provide whatever is there.
+
+Return a new string which is 3 copies of the front of the string.
+
+Example:
+```java
+popular3("Java") --> "JavJavJav"
+popular3("Chocolate") --> "ChoChoCho"
+popular3("abc") --> "abcabcabc"
+```
+
+### Problem 26
+With the provided string, we need you to provide a new scrambled string.
+Take the first two characters of the string or take whatever characters are present there.
+
+Return the new string with the first 2 characters added at both the front and back of the original string.
+
+Example:
+```java
+double22("kitten") --> "kikittenki"
+double22("Ha") --> "HaHaHa"
+double22("abc") --> "ababcab"
+```
+### Problem 27
+We need to check if the given numbers are within the range 10...20 inclusive.
+You are given 2 int values, return true if either number is in the range of 10...20.
+
+Example:
+```java
+range1020(12, 99) --> true
+range1020(21, 12) --> true
+range1020(8, 99) --> false
+```
+### Problem 28
+Starting at index 1, we need to see if the word "del" appears.
+If "del" appears at that index then we need to delete the word "del".
+
+Return a new string where "del" has been deleted if appeared at index 1;
+return the string unchanged if "del" doesn't appear.
+
+Example:
+```java
+deleteDel("adelbc") --> "abc"
+deleteDel("adelHello") --> "aHello"
+deleteDel("adedbc") --> "adedbc"
+```
+### Problem 29
+Out of the given 3 int values, we need to find the max number.
+
+Return the largest int value out of the given 3.
+
+Example:
+```java
+maxNumber(1, 2, 3) --> 3
+maxNumber(1, 3, 2) --> 3
+maxNumber(3, 2, 1) --> 3
+```
+### Problem 30
+Again, we are looking for numbers that are within the range 10...20 inclusive.
+But this time we are looking for the max value within that range out of the 2 positive int values.
+
+Return the larger value that is in the range 10...20,
+or return 0 if neither number is in that range.
+
+Example:
+```java
+larger1020(11, 19) --> 19
+larger1020(19, 11) --> 19
+larger1020(11, 9) --> 11
+```
+### Problem 31
+Create the string to look like it's going up; like a hill. To do this we need to take the last 3 characters
+and make them uppercase. Even if there's less than 3 characters, just make whatever is there uppercase.
+Doing this allows the string to look like it's going up and down depending on if begins with uppercase or not.
+
+Tip: str.toUpperCase() returns the uppercase version of a string
+
+Return a new string where the last 3 characters are now in upper case.
+
+Example:
+```java
+goingUp("Hello") --> "HeLLO"
+goingUp("hi there") --> "hi thERE"
+goingUp("hi") --> "HI"
+```
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set04/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set04/Problem.class
new file mode 100644
index 0000000..77bbdbc
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set04/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set04/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set04/ReadMe.md
new file mode 100644
index 0000000..3e7b81e
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set04/ReadMe.md
@@ -0,0 +1,22 @@
+# Coding Level Beginner Problem 04
+
+You will be solving the given problem below.
+
+## Problem
+The instructor provided you with a non-empty string and a number n.
+The instructor wants you to remove the letter at index n and provide a new string.
+
+Tip: Value of n should be a valid index of a given letter in the original string,
+such as 0 or str.length()-1 inclusive
+
+Example:
+
+missingLetter("kitten", 1) --> "ktten"
+
+missingLetter("kitten", 0) --> "itten"
+
+missingLetter("kitten", 4) --> "kittn"
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set05/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set05/Problem.class
new file mode 100644
index 0000000..8005d20
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set05/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set05/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set05/ReadMe.md
new file mode 100644
index 0000000..07f0692
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set05/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 05
+
+You will be solving the given problem below.
+
+## Problem
+Given the word of the day, take the last letter and
+return a new word of the day when you add the last letter to the front and back of the word.
+
+For example, "founder" yields "rfounderr".
+
+Tip: The word of the day will be a length 1 or more
+
+Example:
+
+wordOfDay("cat") --> "tcatt"
+
+wordOfDay("Hello" --> "oHelloo"
+
+wordOfDay("a") --> "aaa"
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set06/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set06/Problem.class
new file mode 100644
index 0000000..026fecd
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set06/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set06/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set06/ReadMe.md
new file mode 100644
index 0000000..2f6d519
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set06/ReadMe.md
@@ -0,0 +1,19 @@
+# Problem 06
+
+You will be solving the given problem below.
+
+## Problem
+Johnny's favorite pharse to say is hi, he wants to know if the pharses given start with "hi".
+Provide Johnny with a string, and return true if the string starts with "hi" and false otherwise.
+
+Example:
+
+beginWithHi("hi there") --> true
+
+beginWithHi("hi") --> true
+
+beginWithHi("hello hi") --> false
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set07/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set07/Problem.class
new file mode 100644
index 0000000..19b9e51
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set07/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set07/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set07/ReadMe.md
new file mode 100644
index 0000000..2870dc3
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set07/ReadMe.md
@@ -0,0 +1,21 @@
+# Problem 07
+
+You will be solving the given problem below.
+
+## Problem
+If you think of the basic numbers 0-20, you will notice that 13-19 contain the word "teen" in them.
+The math instructor provides you with 3 numbers, you need to decided if 1 or more of them contain teen.
+
+Return true if 1 or more of them contain teen.
+
+Example:
+
+containTeen(13, 20, 10) --> true
+
+containTeen(20, 19, 10) --> true
+
+containTeen(20, 10, 13) --> true
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set08/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set08/Problem.class
new file mode 100644
index 0000000..a7d2ca9
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set08/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set08/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set08/ReadMe.md
new file mode 100644
index 0000000..a55c610
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set08/ReadMe.md
@@ -0,0 +1,22 @@
+# Problem 08
+
+You will be solving the given problem below.
+
+## Problem
+Your local rapper is looking to create his next hook for his next track. He wants to add phrases that begin with "mix".
+But he decides he wants to take it a step further and accept any phrase except the "m" can be any letter or number.
+He needs your help to make sure the list of given phrases begin with what was asked.
+
+Return true if the given phrase begins with "mix", or any beginning letter or number following "ix"
+
+Example:
+
+startWithIx("mix snacks") --> true
+
+startWithIx("pix snacks") --> true
+
+startWithIx("piz snacks") --> false
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set09/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set09/Problem.class
new file mode 100644
index 0000000..dcd5029
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set09/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set09/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set09/ReadMe.md
new file mode 100644
index 0000000..fe264eb
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set09/ReadMe.md
@@ -0,0 +1,24 @@
+# Problem 09
+
+You will be solving the given problem below.
+
+## Problem
+Provide two numbers, evalute both numbers to see which one is nearest to the value 10.
+Some numbers may have the same range in how near they are to 10; such as 13 and 7 both are 3 from 10.
+In that case, we would consider that event a tie.
+
+Tip: Math.abs(n) returns the absolute value of a number
+
+Return whichever number is nearest to 10, or return 0 for the event of a tie.
+
+Example:
+
+near10(8, 13) --> 8
+
+near10(13, 8) --> 8
+
+near10(13, 7) --> 0
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set10/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set10/Problem.class
new file mode 100644
index 0000000..d095fe4
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set10/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set10/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set10/ReadMe.md
new file mode 100644
index 0000000..f1af571
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set10/ReadMe.md
@@ -0,0 +1,20 @@
+# Problem 10
+
+You will be solving the given problem below.
+
+## Problem
+Determine if the given string contains between 1 and 3 'e' characters.
+
+Only if the string contains between 1 and 3 'e' characters; return true.
+
+Example:
+
+containE("Hello") --> true
+
+containE("Heelle") --> true
+
+containE("Heelele") --> false
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set11/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set11/Problem.class
new file mode 100644
index 0000000..dff1dfa
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set11/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set11/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set11/ReadMe.md
new file mode 100644
index 0000000..79ecb7f
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set11/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 11
+
+You will be solving the given problem below.
+
+## Problem
+
+An elementary school teacher needs your help to create new strings for a fun activity they have planned.
+You will be provided a non-empty string and a number N. To create a new string, you will start with the character 0.
+Next you will add every Nth character of the string to the new string. Return the new string.
+
+Tip: If N is 3, use char 0, 3, 6 ... and so on. N is 1 or more.
+
+Example:
+
+everyOther("Miracle", 2) --> "Mrce"
+
+everyOther("abcdefg", 2) --> "aceg"
+
+everyOther("abcdefg", 3) --> "adg"
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set12/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set12/Problem.class
new file mode 100644
index 0000000..a676550
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set12/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set12/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set12/ReadMe.md
new file mode 100644
index 0000000..8fc44b2
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set12/ReadMe.md
@@ -0,0 +1,22 @@
+# Problem 12
+
+You will be solving the given problem below.
+
+## Problem
+
+It's a nice day, and you're at the park and see two dogs, bulldog and lab.
+The parameters bulldogGrowl and labGrowl indicates if each dog is growling.
+Surrounding people are in a bit of trouble if both dogs are growling or if neither are growling but are in a stare down.
+Return true if those people are in trouble.
+
+Example:
+
+dogTrouble(true, true) --> true
+
+dogTrouble(false, false) --> true
+
+dogTrouble(true, false) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
\ No newline at end of file
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set13/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set13/Problem.class
new file mode 100644
index 0000000..1857814
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set13/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set13/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set13/ReadMe.md
new file mode 100644
index 0000000..3b60f85
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set13/ReadMe.md
@@ -0,0 +1,22 @@
+# Problem 13
+
+You will be solving the given problem below.
+
+## Problem
+
+We have a loud crying puppy in an apartment building. The "hour" parameter is the current hour time
+in the range 0...23. We will get in trouble if the puppy is crying and the time is before 7 or after 20.
+
+Return true if we will get in trouble based on if the puppy is crying during a specfic time of day.
+
+Example:
+
+puppyCry(true, 6) --> true
+
+puppyCry(true, 7) --> false
+
+puppyCry(false, 6) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set14/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set14/Problem.class
new file mode 100644
index 0000000..7f8d553
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set14/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set14/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set14/ReadMe.md
new file mode 100644
index 0000000..83bfedc
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set14/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 14
+
+You will be solving the given problem below.
+
+## Problem
+
+Looking at your math worksheet, your given 2 number values of either positive or negative.
+Evaluate a problem and find out if one of those numbers is positive and the other is negative.
+
+Return true if one is negative and one is positive.
+An exception to this is if the parameter "negative" is true, then only return true if both are negative.
+
+Example:
+
+checkPosOrNeg(1, -1, false) --> true
+
+checkPosOrNeg(-1, 1, false) --> true
+
+checkPosOrNeg(-4, -5, true) --> true
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set15/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set15/Problem.class
new file mode 100644
index 0000000..57e2d75
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set15/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set15/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set15/ReadMe.md
new file mode 100644
index 0000000..29c0175
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set15/ReadMe.md
@@ -0,0 +1,20 @@
+# Problem 15
+
+You will be solving the given problem below.
+
+## Problem
+
+With the provided string, you need to exchange the first and last characters to create a new string.
+Return the new string.
+
+Example:
+
+exchange("code") --> "eodc
+
+exchange("a") --> "a"
+
+exchange("ab") --> "ba"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set16/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set16/Problem.class
new file mode 100644
index 0000000..3239132
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set16/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set16/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set16/ReadMe.md
new file mode 100644
index 0000000..cee0e85
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set16/ReadMe.md
@@ -0,0 +1,25 @@
+# Problem 16
+
+You will be solving the given problem below.
+
+## Problem
+
+We are looking to write down a list of all possible numbers that can be a
+multiple of 3 or 5.
+You will be given any number, but to be put on the list the number has to be a non-negative number.
+
+Return true if the given number can be added to the list.
+
+Tip: Think about using the % "mod" operator
+
+Example:
+
+multipleOf(3) --> true
+
+multipleOf(10) --> true
+
+multipleOf(8) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set17/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set17/Problem.class
new file mode 100644
index 0000000..2bc7e3f
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set17/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set17/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set17/ReadMe.md
new file mode 100644
index 0000000..57f6b00
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set17/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 17
+
+You will be solving the given problem below.
+
+## Problem
+
+You are given two random temperatures from different states.
+Between these two temperatures, we need to check if one state is freezing while the other is having an extreme hot day.
+Both of these statements need to be true to prove that some states have extreme cases of temperatures.
+
+Return true, if one temp is less than 0 and the other is greater than 100.
+
+Example:
+
+checkTemp(120, -1) --> true
+
+checkTemp(-1, 120) --> true
+
+checkTemp(2, 120) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set18/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set18/Problem.class
new file mode 100644
index 0000000..6544a95
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set18/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set18/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set18/ReadMe.md
new file mode 100644
index 0000000..b2b5186
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set18/ReadMe.md
@@ -0,0 +1,25 @@
+# Problem 18
+
+You will be solving the given problem below.
+
+## Problem
+
+An upcoming artist's concert is coming to town. The concert manager is only allowing one person of a pair to be a "teen".
+Your at the front gate checking tickets and verifying ages. You allowed to let a pair in as long as only one person is a teen
+but both can't be a "teen".
+
+A "teen" is considered someone within the range of 13...19 inclusive.
+
+Return true if one or the other person in the pair is a teen, but not both.
+
+Example:
+
+oneTeen(13, 99) --> true
+
+oneTeen(21, 19) --> true
+
+oneTeen(13, 13) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set19/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set19/Problem.class
new file mode 100644
index 0000000..d5ed9d1
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set19/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set19/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set19/ReadMe.md
new file mode 100644
index 0000000..de0ed08
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set19/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 19
+
+You will be solving the given problem below.
+
+## Problem
+
+We're on the look-out for ounces "oz" within a string. You will be given a string,
+and you need to determine if the first two characters yields "oz".
+We need you to return a new string made of the first 2 chars (if present).
+
+Only include first char if it is 'o' and only include second char if it is 'z'.
+
+Example:
+
+beginWithOz("ozymandias") --> "oz"
+
+beginWithOz("bzoo") --> "z"
+
+beginWithOz("oxx") --> "o"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set20/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set20/Problem.class
new file mode 100644
index 0000000..3579e67
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set20/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set20/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set20/ReadMe.md
new file mode 100644
index 0000000..5a54a9e
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set20/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 20
+
+You will be solving the given problem below.
+
+## Problem
+
+We are looking for numbers within two different ranges. You will be provided two numbers
+and need to see if they are both in the range of 30...40 inclusive or 40...50 inclusive.
+The numbers were looking for have to be within either one of those ranges.
+
+Return true if both numbers are in the range 30...40, or both numbers are in the range 40...50.
+
+Example:
+
+range3050(30, 31) --> true
+
+range3050(30, 41) --> false
+
+range3050(40, 50) --> true
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set21/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set21/Problem.class
new file mode 100644
index 0000000..e93e018
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set21/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set21/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set21/ReadMe.md
new file mode 100644
index 0000000..67fbd74
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set21/ReadMe.md
@@ -0,0 +1,24 @@
+# Problem 21
+
+You will be solving the given problem below.
+
+## Problem
+
+We're on the lookout for values that contain the same last digit.
+You will be given two non-negative numbers to compare.
+
+Tip: Note that the % "mod" operator computes remainders, so 17 % 10 is 7.
+
+Return true if both digits have the same last digit.
+
+Example:
+
+compareLastDigit(7, 17) --> true
+
+compareLastDigit(6, 17) --> false
+
+compareLastDigit(3, 113) --> true
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set22/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set22/Problem.class
new file mode 100644
index 0000000..dcb86ee
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set22/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set22/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set22/ReadMe.md
new file mode 100644
index 0000000..02e9b8c
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set22/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 22
+
+You will be solving the given problem below.
+
+## Problem
+
+A group of students is given an addition worksheet during class to compete against each other.
+The main goal is the find the sum of all the given values; you will be given a set of two numbers.
+The teacher decided to put a twist on the contest by providing one rule.
+
+Return the sum of two int values; but if the values are the same then return double their sum.
+
+Example:
+
+doubleTheSum(1, 2) --> 3
+
+doubleTheSum(3, 2) --> 5
+
+doubleTheSum(2, 2) --> 8
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set23/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set23/Problem.class
new file mode 100644
index 0000000..5fc1f1a
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set23/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set23/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set23/ReadMe.md
new file mode 100644
index 0000000..1082a62
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set23/ReadMe.md
@@ -0,0 +1,22 @@
+# Problem 23
+
+You will be solving the given problem below.
+
+## Problem
+
+Tom's favorite number is ten, and he is on the look-out for the value 10 or the sum 10 out of the values given to him.
+Tom needs you to confirm if any of the values given have what he is looking for.
+
+Return true if one value is 10 or return true if the sum of both values is 10;
+
+Example:
+
+lookOut10(9, 10) --> true
+
+lookOut10(9, 9) --> false
+
+lookOut10(1, 9) --> true
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set24/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set24/Problem.class
new file mode 100644
index 0000000..0d8ba38
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set24/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set24/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set24/ReadMe.md
new file mode 100644
index 0000000..034164d
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set24/ReadMe.md
@@ -0,0 +1,24 @@
+# Problem 24
+
+You will be solving the given problem below.
+
+## Problem
+
+Every string needs to begin with "not", in order to do that you need to add "not" to the beginning of a provided string.
+But if the string already begins with "not" we will leave it alone, no need to have a "not not".
+
+Return a new string where "not" has been added to the front.
+
+Tip: Use .equals() to compare 2 strings
+
+Example:
+
+beginWithNot("candy") --> "not candy"
+
+beginWithNot("x") --> "not x"
+
+beginWithNot("not bad") --> "not bad"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set25/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set25/Problem.class
new file mode 100644
index 0000000..c6014ee
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set25/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set25/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set25/ReadMe.md
new file mode 100644
index 0000000..07c5b9c
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set25/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 25
+
+You will be solving the given problem below.
+
+## Problem
+
+The most popular number today is 3. We need the first 3 characters of a string, and we need to make
+3 copies of those 3 characters. The front of a string is considered those 3 characters. The front can
+be less than 3, just need to provide whatever is there.
+
+Return a new string which is 3 copies of the front of the string.
+
+Example:
+
+popular3("Java") --> "JavJavJav"
+
+popular3("Chocolate") --> "ChoChoCho"
+
+popular3("abc") --> "abcabcabc"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set26/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set26/Problem.class
new file mode 100644
index 0000000..7c09ca7
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set26/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set26/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set26/ReadMe.md
new file mode 100644
index 0000000..0ef6d5f
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set26/ReadMe.md
@@ -0,0 +1,22 @@
+# Problem 26
+
+You will be solving the given problem below.
+
+## Problem
+
+With the provided string, we need you to provide a new scrambled string.
+Take the first two characters of the string or take whatever characters are present there.
+
+Return the new string with the first 2 characters added at both the front and back of the original string.
+
+Example:
+
+double22("kitten") --> "kikittenki"
+
+double22("Ha") --> "HaHaHa"
+
+double22("abc") --> "ababcab"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set27/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set27/Problem.class
new file mode 100644
index 0000000..7b4f556
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set27/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set27/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set27/ReadMe.md
new file mode 100644
index 0000000..1a038d1
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set27/ReadMe.md
@@ -0,0 +1,20 @@
+# Problem 27
+
+You will be solving the given problem below.
+
+## Problem
+
+We need to check if the given numbers are within the range 10...20 inclusive.
+You are given 2 int values, return true if either number is in the range of 10...20.
+
+Example:
+
+range1020(12, 99) --> true
+
+range1020(21, 12) --> true
+
+range1020(8, 99) --> false
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set28/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set28/Problem.class
new file mode 100644
index 0000000..bf96cb6
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set28/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set28/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set28/ReadMe.md
new file mode 100644
index 0000000..127eddc
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set28/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 28
+
+You will be solving the given problem below.
+
+## Problem
+
+Starting at index 1, we need to see if the word "del" appears.
+If "del" appears at that index then we need to delete the word "del".
+
+Return a new string where "del" has been deleted if appeared at index 1;
+return the string unchanged if "del" doesn't appear.
+
+Example:
+
+deleteDel("adelbc") --> "abc"
+
+deleteDel("adelHello") --> "aHello"
+
+deleteDel("adedbc") --> "adedbc"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set29/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set29/Problem.class
new file mode 100644
index 0000000..1b29535
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set29/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set29/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set29/ReadMe.md
new file mode 100644
index 0000000..737cd51
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set29/ReadMe.md
@@ -0,0 +1,21 @@
+# Problem 29
+
+You will be solving the given problem below.
+
+## Problem
+
+Out of the given 3 int values, we need to find the max number.
+
+Return the largest int value out of the given 3.
+
+Example:
+
+maxNumber(1, 2, 3) --> 3
+
+maxNumber(1, 3, 2) --> 3
+
+maxNumber(3, 2, 1) --> 3
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set30/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set30/Problem.class
new file mode 100644
index 0000000..8b6bd2f
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set30/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set30/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set30/ReadMe.md
new file mode 100644
index 0000000..9eaa929
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set30/ReadMe.md
@@ -0,0 +1,23 @@
+# Problem 30
+
+You will be solving the given problem below.
+
+## Problem
+
+Again, we are looking for numbers that are within the range 10...20 inclusive.
+But this time we are looking for the max value within that range out of the 2 positive int values.
+
+Return the larger value that is in the range 10...20,
+or return 0 if neither number is in that range.
+
+Example:
+
+larger1020(11, 19) --> 19
+
+larger1020(19, 11) --> 19
+
+larger1020(11, 9) --> 11
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set31/Problem.class b/src/out/production/main/com/codedifferently/coding/level/beginner/set31/Problem.class
new file mode 100644
index 0000000..7968b18
Binary files /dev/null and b/src/out/production/main/com/codedifferently/coding/level/beginner/set31/Problem.class differ
diff --git a/src/out/production/main/com/codedifferently/coding/level/beginner/set31/ReadMe.md b/src/out/production/main/com/codedifferently/coding/level/beginner/set31/ReadMe.md
new file mode 100644
index 0000000..f0702af
--- /dev/null
+++ b/src/out/production/main/com/codedifferently/coding/level/beginner/set31/ReadMe.md
@@ -0,0 +1,25 @@
+# Problem 31
+
+You will be solving the given problem below.
+
+## Problem
+
+Create the string to look like it's going up; like a hill. To do this we need to take the last 3 characters
+and make them uppercase. Even if there's less than 3 characters, just make whatever is there uppercase.
+Doing this allows the string to look like it's going up and down depending on if begins with uppercase or not.
+
+Tip: str.toUpperCase() returns the uppercase version of a string
+
+Return a new string where the last 3 characters are now in upper case.
+
+Example:
+
+goingUp("Hello") --> "HeLLO"
+
+goingUp("hi there") --> "hi thERE"
+
+goingUp("hi") --> "HI"
+
+### Submission
+
+Commit and push your solution to GitHub
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set01/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set01/ProblemTest.class
new file mode 100644
index 0000000..23b8042
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set01/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set02/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set02/ProblemTest.class
new file mode 100644
index 0000000..ecefa1a
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set02/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set03/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set03/ProblemTest.class
new file mode 100644
index 0000000..3beaf06
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set03/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set04/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set04/ProblemTest.class
new file mode 100644
index 0000000..8f3136e
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set04/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set05/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set05/ProblemTest.class
new file mode 100644
index 0000000..246d6e5
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set05/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set06/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set06/ProblemTest.class
new file mode 100644
index 0000000..85fa0fd
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set06/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set07/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set07/ProblemTest.class
new file mode 100644
index 0000000..74c8363
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set07/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set08/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set08/ProblemTest.class
new file mode 100644
index 0000000..e029da4
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set08/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set09/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set09/ProblemTest.class
new file mode 100644
index 0000000..cba6415
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set09/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set10/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set10/ProblemTest.class
new file mode 100644
index 0000000..a907910
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set10/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set11/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set11/ProblemTest.class
new file mode 100644
index 0000000..2c30340
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set11/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set12/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set12/ProblemTest.class
new file mode 100644
index 0000000..c44daf8
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set12/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set13/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set13/ProblemTest.class
new file mode 100644
index 0000000..e96b56b
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set13/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set14/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set14/ProblemTest.class
new file mode 100644
index 0000000..a2c1677
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set14/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set15/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set15/ProblemTest.class
new file mode 100644
index 0000000..a18512b
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set15/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set16/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set16/ProblemTest.class
new file mode 100644
index 0000000..ab40037
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set16/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set17/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set17/ProblemTest.class
new file mode 100644
index 0000000..e128abd
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set17/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set18/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set18/ProblemTest.class
new file mode 100644
index 0000000..7c3b991
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set18/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set19/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set19/ProblemTest.class
new file mode 100644
index 0000000..3d11af4
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set19/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set20/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set20/ProblemTest.class
new file mode 100644
index 0000000..49f8813
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set20/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set21/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set21/ProblemTest.class
new file mode 100644
index 0000000..d808f48
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set21/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set22/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set22/ProblemTest.class
new file mode 100644
index 0000000..f060dfe
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set22/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set23/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set23/ProblemTest.class
new file mode 100644
index 0000000..ab1b634
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set23/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set24/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set24/ProblemTest.class
new file mode 100644
index 0000000..d5efbcf
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set24/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set25/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set25/ProblemTest.class
new file mode 100644
index 0000000..2529adb
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set25/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set26/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set26/ProblemTest.class
new file mode 100644
index 0000000..21c2e6a
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set26/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set27/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set27/ProblemTest.class
new file mode 100644
index 0000000..6a5fe1f
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set27/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set28/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set28/ProblemTest.class
new file mode 100644
index 0000000..3d6fdc6
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set28/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set29/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set29/ProblemTest.class
new file mode 100644
index 0000000..8444e3d
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set29/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set30/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set30/ProblemTest.class
new file mode 100644
index 0000000..909bf0f
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set30/ProblemTest.class differ
diff --git a/src/out/test/test/com/codedifferently/coding/level/beginner/set31/ProblemTest.class b/src/out/test/test/com/codedifferently/coding/level/beginner/set31/ProblemTest.class
new file mode 100644
index 0000000..31858ae
Binary files /dev/null and b/src/out/test/test/com/codedifferently/coding/level/beginner/set31/ProblemTest.class differ