내 인생에도 예쁜 꽃이 피었으면 좋겠다

https://www.hackerrank.com/challenges/java-1d-array-introduction/problem?isFullScreen=true Java 1D Array | HackerRank Get started with one-dimensional arrays. www.hackerrank.com import java.util.*; public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int[] a = new int[n]; for(int i = 0; i < n; i++){ a[i] = scan.nextInt();..

https://www.hackerrank.com/challenges/java-biginteger/problem?isFullScreen=true Java BigInteger | HackerRank Learn to handle huge integers using Java Biginteger class. www.hackerrank.com import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { /* Enter your code here. Read input from S..

https://www.hackerrank.com/challenges/java-exception-handling-try-catch/problem?isFullScreen=true Java Exception Handling (Try-catch) | HackerRank Use try-catch to test a block of code for errors. www.hackerrank.com import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { /* Enter your..

https://www.hackerrank.com/challenges/java-primality-test/problem?isFullScreen=true Java Primality Test | HackerRank Use Java's built-in primality test method. www.hackerrank.com import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.regex.*; public class Solution { public static void main(String[] arg..

https://www.hackerrank.com/challenges/valid-username-checker/problem?isFullScreen=true Valid Username Regular Expression | HackerRank Determine if a username is valid using the power of regex! www.hackerrank.com //글자수 8~30 //영어로 시작, 숫자로 시작하면 안됨 //특수문자 안됨. 1차) public static final String regularExpression = "^[A-Za-z]([A-Za-z0-9]{7,29})$"; input값 중에 Samantha_21 가 Valid로 나와야 함. 조건 하나 놓쳤었음. 특수문자는 _ ..

https://www.hackerrank.com/challenges/duplicate-word/problem?isFullScreen=true Java Regex 2 - Duplicate Words | HackerRank Identify repeated words in the sentence, and delete all recurrences of each word after the very first word. www.hackerrank.com https://docs.oracle.com/javase/tutorial/essential/regex/pattern.html Methods of the Pattern Class (The Java™ Tutorials > Essential Java Classes > Re..

https://www.hackerrank.com/challenges/java-regex/problem?isFullScreen=true Java Regex | HackerRank Use the power of Java regex to detect valid IP address. www.hackerrank.com IP주소 조건 : IP 주소는 "A.B.C.D" 형태의 문자열로, 여기서 A, B, C, D의 값은 0에서 255 사이일 수 있습니다. 선두에 오는 0은 허용됩니다. A, B, C 또는 D의 길이는 3을 초과할 수 없습니다. 정규식 확인할 수 있는 사이트 https://regexr.com/ RegExr: Learn, Build, & Test RegEx RegExr is an online tool t..

https://www.hackerrank.com/challenges/java-string-tokens/problem?isFullScreen=true Java String Tokens | HackerRank Find the number of alphabetic tokens in a string. www.hackerrank.com import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { Scanner scan = new Scanner(System.in); String s = scan.nextLine().trim(); if(s.length()

Anagram, 애니어그램 단어나 문장의 나열의 순서를 변경했을 때 다른 의미를 가지는 단어나 문장 https://www.hackerrank.com/challenges/java-anagrams/problem?isFullScreen=true Java Anagrams | HackerRank Given two strings, determine of they are anagrams of each other. www.hackerrank.com import java.util.Scanner; public class Solution { static boolean isAnagram(String a, String b) { // Complete the function boolean result = false; String ..

palindrome 팰린드롬, 회문 순서를 거꾸로 읽어도 제대로 읽은 것과 같은 단어와 문장. 예) "level", "SOS", "rotator", "nurses run".. https://www.hackerrank.com/challenges/java-string-reverse/problem?isFullScreen=true Java String Reverse | HackerRank Learn how to reverse a string. Given a string, determine if its a palindrome. www.hackerrank.com import java.io.*; import java.util.*; public class Solution { public static void main(..