Anything

고정 헤더 영역

글 제목

메뉴 레이어

Anything

메뉴 리스트

    • 분류 전체보기
      • Troubleshooting
      • Codility Lessons 풀이
      • 백준 알고리즘 풀이
      • 프로그래머스 코딩테스트 풀이
      • 업무 이력
      • MCP

    검색 레이어

    Anything

    검색 영역

    컨텐츠 검색

    분류 전체보기

    • [Lesson 5] Prefix Sums - CountDiv

      2025.01.03 by 발발개발

    • [Lesson 5] Prefix Sums - PassingCars

      2025.01.03 by 발발개발

    • [Lesson 4] Counting Elements - MissingInteger

      2025.01.02 by 발발개발

    • [Lesson 4] Counting Elements - MaxCounters

      2025.01.02 by 발발개발

    [Lesson 5] Prefix Sums - CountDiv

    https://app.codility.com/programmers/lessons/5-prefix_sums/count_div/ CountDiv coding task - Learn to Code - CodilityCompute number of integers divisible by k in range [a..b].app.codility.comclass Solution { public int solution(int A, int B, int K) { return (int) Math.floor(B / (double) K) - (int) Math.ceil(A / (double) K) + 1; }}

    Codility Lessons 풀이 2025. 1. 3. 10:55

    [Lesson 5] Prefix Sums - PassingCars

    https://app.codility.com/programmers/lessons/5-prefix_sums/passing_cars/ PassingCars coding task - Learn to Code - CodilityCount the number of passing cars on the road.app.codility.comclass Solution { public int solution(int[] A) { int sum = 0; int result = 0; for (int i = A.length - 1; i >= 0; i--) { if (A[i] == 1) { sum += 1; } else ..

    Codility Lessons 풀이 2025. 1. 3. 10:45

    [Lesson 4] Counting Elements - MissingInteger

    https://app.codility.com/programmers/lessons/4-counting_elements/missing_integer/ MissingInteger coding task - Learn to Code - CodilityFind the smallest positive integer that does not occur in a given sequence.app.codility.comclass Solution { public int solution(int[] A) { int[] arr = new int[1000001]; for (int num : A) { if (num > 0) { arr[num]++; ..

    Codility Lessons 풀이 2025. 1. 2. 17:27

    [Lesson 4] Counting Elements - MaxCounters

    https://app.codility.com/programmers/lessons/4-counting_elements/max_counters/ MaxCounters coding task - Learn to Code - CodilityCalculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.app.codility.comclass Solution { public int[] solution(int N, int[] A) { int[] arr = new int[N]; int max = 0..

    Codility Lessons 풀이 2025. 1. 2. 17:19

    페이징

    이전
    1 ··· 3 4 5 6 7 8 9 ··· 116
    다음
    wjdwo951219@gmail.com
    Resume

    티스토리툴바