Goyummy

public class MyString { public String str; public MyString(String str) { this.str = str; } public boolean isHexadecimalChar(char ch) { return (ch>= 'a' && ch ='A' && ch

import java.util.Arrays; public class StringMagic { public boolean areAnagrams(String str1, String str2) { if(str1 == null || str2 == null){ return false; }else if(str1.length() != str2.length()){ return false; } str1 = str1.toLowerCase(); str2 = str2.toLowerCase(); char[] charArray1 = str1.toCharArray(); char[] charArray2 = str2.toCharArray(); Arrays.sort(charArray1); Arrays.sort(charArray2); r..

package com.collection; import java.util.HashMap; import java.util.Map; public class MapRunner { public static void main(String[] args){ String str = "This is an awesome occasion." + "This has never happend before."; Map occurances = new HashMap(); char[] characters = str.toCharArray(); //String을 char로 쪼개서 배열에 넣기 for(char character:characters) { Integer integer = occurances.get(character); //Map..

import java.util.ArrayList; import java.util.List; public class NumberMagic { public List determineMultiples(int number, int limit) { int multiple = number; ArrayList resultArray = new ArrayList(); if(number

import java.util.ArrayList; import java.util.List; public class NumberMagic { public List determineAllFactors(int number) { ArrayList resultArray = new ArrayList(); for(int i=1; i

public class ArrayMagic { public int[] reverseArray(int[] array) { if(array.length

public class ArrayMagic { public int findSecondLargestElement(int[] array) { //TODO: Write your code here if(array.length largest){ largest = num; } } int secondLargest = Integer.MIN_VALUE; for(int num: array){ if(num = secondLargest) { secondLargest = num; } } if(secondLargest == Integer.MIN_VALUE){ return -1; } return secondLargest; } } if(secondLargest == Integer.MIN_VALUE){..

public class BiNumber { private int number1; private int number2; public BiNumber(int number1, int number2) { this.number1 = number1; this.number2 = number2; } public int getNumber1() { return number1; } public int getNumber2() { return number2; } public int calculateGCD() { // Write your code here if(number1 == 0 || number2 == 0){ return 0; }else if(number1 < 0 || number2 < 0){ return 1; } if(n..

public class BiNumber { private int number1; private int number2; public BiNumber(int number1, int number2) { this.number1 = number1; this.number2 = number2; } public int getNumber1() { return number1; } public int getNumber2() { return number2; } public int calculateLCM() { // TODO: Write your code here if(number1 < 0 || number2 < 0){ return -1; } else if(number1 == 0 || number2 == 0){ return 0..