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

컨텐츠 검색

태그

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

최근글

댓글

공지사항

  • SSL 인증서 설정하기

아카이브

hello jiniworld(220)

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

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

    2023.01.11
  • [Codility - Java] 8. Leader - 2. EquiLeader

    2023.01.10
  • [Codility - Java] 4. Counting Elements - 4. MissingInteger

    2023.01.09
  • [Codility - Java] 4. Counting Elements - 3. MaxCounters

    2023.01.09
  • [Codility - Java] 5. Prefix Sums - 2. CountDiv

    2023.01.04
[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
[Codility - Java] 8. Leader - 2. EquiLeader

A non-empty array A consisting of N integers is given. The leader of this array is the value that occurs in more than half of the elements of A. An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value. For example, given array A such that: A[0] = 4 A[1] = 3 A[2] = 4 A[3] = 4 A[4] = 4 A[5] = ..

2023. 1. 10. 15:48
[Codility - Java] 4. Counting Elements - 4. MissingInteger

MissingInteger This is a demo task. Write a function: class Solution { public int solution(int[] A); } that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the function should return 1. Wr..

2023. 1. 9. 13:47
[Codility - Java] 4. Counting Elements - 3. MaxCounters

MaxCounters You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive operations: if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X), if A[K] = N + 1 then o..

2023. 1. 9. 01:46
[Codility - Java] 5. Prefix Sums - 2. CountDiv

CountDiv Write a function: class Solution { public int solution(int A, int B, int K); } that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 } For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6..

2023. 1. 4. 18:33
1 ··· 8 9 10 11 12 13 14 ··· 37
JINIWORLD
© jiniworld. All rights reserved.

티스토리툴바