신입사원 무지는 게시판 불량 이용자를 신고하고 처리 결과를 메일로 발송하는 시스템을 개발하려 합니다.
점심시간에 도둑이 들어, 일부 학생이 체육복을 도난당했습니다. 다행히 여벌 체육복이 있는 학생이 이들에게 체육복을 빌려주려 합니다.
총 N개의 시험장이 있고, 각각의 시험장마다 응시자들이 있다.
수많은 마라톤 선수들이 마라톤에 참여하였습니다. 단 한 명의 선수를 제외하고는 모든 선수가 마라톤을 완주하였습니다.
A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representa
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
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
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 eq
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 m
A non-empty array A consisting of N integers is given.A permutation is a sequence containing each element from 1 to N once, and only once.For example,
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 op
A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road.Array A contains only
Write a functionclass Solution { public int solution(int\[] A); }that, given an array A consisting of N integers, returns the number of distinct value
A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to AP AQ AR (0 ≤ P < Q < R < N). For exampl
An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P < Q < R < N and:AP + AQ > AR,AQ + AR > AP,AR + AP >
A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:S is empty;S has the form "(U)" o
Softeer level1
Softeer level1
Softeer level1