Skip to content

Instantly share code, notes, and snippets.

@tonkatsu7
tonkatsu7 / coderbyte_alphabetSoup.java
Created July 12, 2018 14:09
CodeByte challenge Alphabet Soup
import java.util.*;
import java.io.*;
class Main {
public static String AlphabetSoup(String str) {
char[] chars = str.toCharArray();
Arrays.sort(chars);
return new String(chars);
}
@tonkatsu7
tonkatsu7 / coderbyte_longestWord.java
Last active July 12, 2018 14:09
CoderByte challenge Longest Word
import java.util.*;
import java.io.*;
class Main {
public static String LongestWord(String sen) {
String[] words = sen.split("\\W");
String longest = "";
for (String word : words)
longest = word.length() > longest.length() ? word : longest;
return longest;
@tonkatsu7
tonkatsu7 / coderbyte_timeConvert.java
Created July 10, 2018 07:02
CoderByte challenge Time Convert
import java.util.*;
import java.io.*;
class Main {
public static String TimeConvert(int num) {
return (num / 60) + ":" + (num % 60);
}
public static void main (String[] args) {
// keep this function call here
@tonkatsu7
tonkatsu7 / coderbyte_checkNums.java
Created July 10, 2018 06:58
CoderByte challenge Check Nums
import java.util.*;
import java.io.*;
class Main {
public static String CheckNums(int num1, int num2) {
if (num1 < num2)
return "true";
else if (num1 > num2)
return "false";
else
@tonkatsu7
tonkatsu7 / coderbyte_simpleAdding.java
Created July 10, 2018 06:53
CoderByte challenge Simple Adding
import java.util.*;
import java.io.*;
class Main {
public static int SimpleAdding(int num) {
return (num == 1) ? 1 : num + SimpleAdding(num - 1);
}
public static void main (String[] args) {
// keep this function call here
@tonkatsu7
tonkatsu7 / coderbyte_firstFactorial.java
Created July 10, 2018 06:48
CoderByte chalenge First Factorial
import java.util.*;
import java.io.*;
class Main {
public static int FirstFactorial(int num) {
return (num == 1) ? num : num * FirstFactorial(num - 1);
}
public static void main (String[] args) {
// keep this function call here
@tonkatsu7
tonkatsu7 / coderbyte_simpleSymbols.java
Created July 10, 2018 05:27
CoderByte challenge Simple Symbols
import java.util.*;
import java.io.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
class Main {
public static String SimpleSymbols(String str) {
Pattern regex = Pattern.compile("[a-zA-Z]");
Matcher match = regex.matcher(str);
while (match.find())
@tonkatsu7
tonkatsu7 / coderbyte_letterCapitalise.java
Created July 10, 2018 05:24
CoderByte challenge Letter Capitalise
import java.util.*;
import java.io.*;
class Main {
public static String LetterCapitalize(String str) {
String[] words = str.split(" ");
StringBuilder sb = new StringBuilder();
for (String word : words) { // for each word
if (Character.isLowerCase(word.charAt(0))) {// if first char is lower case
char[] chars = word.toCharArray();
@tonkatsu7
tonkatsu7 / gist:95b4e1519fe8212e3740943f2442fe8b
Created July 10, 2018 05:23
CoderByte challenge Letter Capitalise
We couldn’t find that file to show.
@tonkatsu7
tonkatsu7 / coderbyte_letterChanges.java
Last active July 10, 2018 05:12
CoderByte challenge Letter Change in java
import java.util.*;
import java.io.*;
class Main {
public static String LetterChanges(String str) {
char[] chars = str.toCharArray();
for (int i = 0; i < chars.length; i++) {
if (Character.isLetter(chars[i]))
if (('a' <= chars[i] && chars[i] < 'z') || ('A' <= chars[i] && chars[i] < 'Z'))
chars[i] = (char)(chars[i] + 1);