자바 자료구조#18. Stack/Queue 연습문제_기능 개발
프로그래머스 팀에서는 기능 개선 작업을 수행 중입니다. 각 기능은 진도가 100%일 때 서비스에 반영할 수 있습니다.
코딩테스트#016 Brackets
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
코딩테스트#015 Triangle
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 >
코딩테스트#014 MaxProductOfThree
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
코딩테스트#013 Distinct
Write a functionclass Solution { public int solution(int\[] A); }that, given an array A consisting of N integers, returns the number of distinct value
코딩테스트#012 PassingCars
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
코딩테스트##011 FrogRiverOne
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
코딩테스트##010 PermCheck
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,
코딩테스트##009 PermMissingElem
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
코딩테스트##008 FrogJmp
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
코딩테스트##007 OddOccurrencesInArray
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
코딩테스트#006 CyclicRotation
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
코딩테스트#005 Binary Gap
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