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

컨텐츠 검색

태그

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

최근글

댓글

공지사항

  • SSL 인증서 설정하기

아카이브

hello jiniworld(218)

  • [Codility - Java] 5. Prefix Sums - 4. MinAvgTwoSlice

    2023.02.01
  • [Codility - Java] 4. Counting Elements - 1. FrogRiverOne

    2023.01.31
  • [Codility - Java] 3. Time Complexity - 2. PermMissingElem

    2023.01.31
  • [Codility - Java] 3. Time Complexity - 1. FrogJmp

    2023.01.31
  • [Codility - Java] 2. Array - 2. OddOccurrencesInArray

    2023.01.31
  • [Codility - Java] 2. Array - 1. CyclicRotation

    2023.01.31
[Codility - Java] 5. Prefix Sums - 4. MinAvgTwoSlice

MinAvgTwoSlice A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + ... + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + ... + A[Q]) / (Q − P + 1). Fo..

2023. 2. 1. 01:21
[Codility - Java] 4. Counting Elements - 1. FrogRiverOne

FrogRiverOne Find the earliest time when a frog can jump to the other side of a river. A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers representing the falling lea..

2023. 1. 31. 15:34
[Codility - Java] 3. Time Complexity - 2. PermMissingElem

PermMissingElem Find the missing element in a given permutation. An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: class Solution { public int solution(int[] A); } that, given an array A, returns the value of the missing elemen..

2023. 1. 31. 15:09
[Codility - Java] 3. Time Complexity - 1. FrogJmp

FrogJmp Count minimal number of jumps from position X to Y. A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: class Solution { public..

2023. 1. 31. 14:49
[Codility - Java] 2. Array - 2. OddOccurrencesInArray

OddOccurrencesInArray Find value that occurs in odd number of elements. A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired. For example, in array A such that: A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 ..

2023. 1. 31. 13:30
[Codility - Java] 2. Array - 1. CyclicRotation

CyclicRotation Rotate an array to the right by a given number of steps. An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the fir..

2023. 1. 31. 13:16
1 ··· 5 6 7 8 9 10 11 ··· 37
JINIWORLD
© jiniworld. All rights reserved.

티스토리툴바