hello jiniworld

hello jiniworld

  • hello jiniworld (218)
    • Spring (58)
      • Basic (15)
      • Spring Docs (6)
      • Spring Data JPA Tutorial (14)
      • Spring Boot Tutorial (17)
      • Jersey (6)
    • Go (17)
    • Dev (10)
      • Clean Architecture (3)
      • System Design (2)
      • Documents (2)
      • Client (2)
    • Infrastructure (5)
      • Docker (1)
      • Kubernetes (4)
    • DB (19)
      • MySQL (8)
      • MariaDB (9)
      • Oracle (1)
    • Java (52)
      • Basic (14)
      • coding test (27)
      • Effective Java (11)
    • Python (7)
      • Flask (1)
      • Basic (3)
      • Effective Python (1)
      • coding test (2)
    • Front-end (3)
      • Vanilla JS (2)
      • Basic (1)
    • Linux (11)
      • Basic (2)
      • Command-line (9)
    • Web Server (6)
      • CentOS 7 (5)
      • Oracle Linux 8 (1)
    • WAS (3)
    • CentOS 7 (17)
      • Basic (9)
      • Jenkins (8)
    • Etc (10)
      • Windows 10 (3)
      • trash bin (3)
05-14 00:11
  • 전체보기
  • 방명록
  • jini's GitHub
  • demo api
  • chaeking api
RSS 피드
로그인
로그아웃 글쓰기 관리

hello jiniworld

컨텐츠 검색

태그

centos7 springboot Spring Boot Tutorial effectivejava https hackerrank SpringBoot2 JAX-RS Java Command-Line MariaDB Jersey go jenkins week1 spring docs codility MySQL Spring Boot Spring

최근글

댓글

공지사항

  • SSL 인증서 설정하기

아카이브

hello jiniworld(218)

  • [HackerRank - Java] Day 2 - 2. Diagonal Difference

    2023.01.27
  • [HackerRank - Java] Day 2 - 1. Lonely Integer

    2023.01.27
  • [HackerRank - Java] Day 1 - 3. Time Conversion

    2023.01.27
  • [HackerRank - Java] Day 1 - 2. Mini-Max Sum

    2023.01.27
  • [HackerRank - Java] Day 1 - 1. Plus Minus

    2023.01.27
  • [Codility - Java] 10. Prime and composite numbers - 1. CountFactors

    2023.01.11
[HackerRank - Java] Day 2 - 2. Diagonal Difference

Diagonal Difference Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal 1+5+9=151 + 5 + 9 = 151+5+9=15. The right to left diagonal 3+5+9=173 + 5 + 9 = 173+5+9=17. Their absolute difference is ∣15−17∣=2|15 - 17| = 2∣15−17∣=2. Function description Complete the diagona..

2023. 1. 27. 14:47
[HackerRank - Java] Day 2 - 1. Lonely Integer

Lonely Integer Given an array of integers, where all elements but one occur twice, find the unique element. Example a=[1,2,3,4,3,2,1]a = [1, 2, 3, 4, 3, 2, 1]a=[1,2,3,4,3,2,1] The unique element is 4. Function Description Complete the lonelyinteger function in the editor below. lonelyinteger has the following parameter(s): int a[n]: an array of integers Returns int: the element that occurs only ..

2023. 1. 27. 14:26
[HackerRank - Java] Day 1 - 3. Time Conversion

Time Conversion Given a time in 12-hour AM/PM format, convert it to military (24-hour) time. Note: 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock. Example s = '12:01:00PM' Return '12:01:00'. s = '12:01:00AM' Return '00:01:00'. Function Description Complete the timeConversion functi..

2023. 1. 27. 14:09
[HackerRank - Java] Day 1 - 2. Mini-Max Sum

Mini-Max Sum Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. Example arr=[1,3,5,7,9]arr = [1, 3, 5, 7, 9]arr=[1,3,5,7,9] The minimum sum is 1 + 3 + 5 + 7 = 16 and the maximum sum is 3 + 5 + 7 + 9 = 24. T..

2023. 1. 27. 13:28
[HackerRank - Java] Day 1 - 1. Plus Minus

Plus Minus Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero. Print the decimal value of each fraction on a new line with places after the decimal. Note: This challenge introduces precision problems. The test cases are scaled to six decimal places, though answers with absolute error of up to are acceptable. Example arr = [1, 1, 0, -1, -1] Ther..

2023. 1. 27. 12:52
[Codility - Java] 10. Prime and composite numbers - 1. CountFactors

CountFactors Prime number 소수 1보다 큰 자연수이면서, 1과 자기 자신만을 약수로 가지는 수 Composite number 합성수 1보다 큰 자연수이면서, 소수가 아닌 수 Divisor, Factor 약수 어떤 수를 나누어 떨어지게 하는 수 A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M. For example, 6 is a factor of 24, because M = 4 satisfies the above condition (24 = 6 * 4). Write a function: class Solution { public int soluti..

2023. 1. 11. 14:04
1 ··· 7 8 9 10 11 12 13 ··· 37
JINIWORLD
© jiniworld. All rights reserved.

티스토리툴바