hello jiniworld

hello jiniworld

  • hello jiniworld (220)
    • Spring (59)
      • Basic (16)
      • 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 (20)
      • MySQL (9)
      • 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)
09-16 02:44
  • 전체보기
  • 방명록
  • jini's GitHub
  • demo api
  • chaeking api
RSS 피드
로그인
로그아웃 글쓰기 관리

hello jiniworld

컨텐츠 검색

태그

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

최근글

댓글

공지사항

  • SSL 인증서 설정하기

아카이브

hello jiniworld(220)

  • [HackerRank - Java] Day 3 - 2. Tower Breakers

    2023.01.28
  • [HackerRank - Java] Day 2 - 3. Counting Sort 1

    2023.01.27
  • [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 3 - 2. Tower Breakers

Tower Breakers Two players are playing a game of Tower Breakers! Player always moves first, and both players always play optimally.The rules of the game are as follows: Initially there are nnn towers. Each tower is of height mmm. The players move in alternating turns. In each turn, a player can choose a tower of height xxx and reduce its height to yyy, where 1

2023. 1. 28. 02:42
[HackerRank - Java] Day 2 - 3. Counting Sort 1

Counting Sort 1 Comparison Sorting Quicksort usually has a running time of nnn x log(n)log(n)log(n), but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are comparison sorts, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cannot beat nnn x log(n)log(n)log(n) (worst-case) running time, sin..

2023. 1. 27. 21:49
[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
1 ··· 7 8 9 10 11 12 13 ··· 37
JINIWORLD
© jiniworld. All rights reserved.

티스토리툴바