정렬 01 - K번째수, 프로그래머스, 알고리즘, Programmers, Stack, Queue, Hash, 코딩테스트, Algorithm, 풀이과정, Leetcode, 릿코드, 코딩테스트, Tech interview, Heap, 힙, 정렬, sort
# Process # 1. Input array, commands # 2. Iterate all commands # 2.1. Get sub array using commands # 2.2. Get target value from subarray # 2.3. Put target_value into the result_array # 3. Return result array def solution(array, commands): result_array = [] for command in commands: temp_array = array[command[0] - 1 : command[1]] temp_array.sort() result_array.append(temp_array[command[2]-1]) retu..
Aracade Intro #53 validTime. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제,문제해결능력,example, c++ java c# scalar
Aracade Intro #53 validTime. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제,문제해결능력,example, c++ java c# scalar Q. Check if the given string is a correct time representation of the 24-hour clock. 주어진 문자열이 24시간을 나타내는 시간에 맞는지 확인해봐라 e.g. Input -> time = "13:58" Output -> validTime(time) = true Input -> time = "25:51" Output -> validTime(time) = false Input -> time = "02:76" Output -> vali..
Aracade Intro #52 longestWord. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar
Aracade Intro #52 longestWord. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Define a word as a sequence of consecutive English letters. Find the longest word from the given string. 단어를 일련된 영문자들의 연속으로 정의해라. 주어진 문자열에서 가장 긴 단어를 찾아라. e.g. Input -> text = "Ready, steady, go!" Output -> longestWord(text) = "steady" //Process //1. Input text//2. Iterate from..
Aracade Intro #50 chessKnight. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar
Aracade Intro #50 chessKnight. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Given a position of a knight on the standard chessboard, find the number of different moves the knight can perform. The knight can move to a square that is two squares horizontally and one square vertically, or two squares vertically and one square horizontally away from it. T..
Aracade Intro #49 lineEncoding. Algorithm, 알고리즘 문제풀이, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar
Aracade Intro #49 lineEncoding. Algorithm, 알고리즘 문제풀이, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Given a string, return its encoding defined as follows: First, the string is divided into the least possible number of disjoint substrings consisting of identical charactersfor example, "aabbbc" is divided into ["aa", "bbb", "c"]Next, each substring with length greater t..
Perfecting OO's Small Classes and Short Methods. 완벽한 객체지향의 작은 클래스와 짧은 메소드, Book:ThoughtWorks Anthology, Java,cpp,자바,oop,좋은코드,객체지향프로그래밍 (1)
Perfecting OO's Small Classes and Short Methods. 완벽한 객체지향의 작은 클래스와 짧은 메소드, Book:ThoughtWorks Anthology, Java,cpp,자바,oop,좋은코드,객체지향프로그래밍 (1) Origin ( Here )원문 ( 여기 ) 난해한 내용 (8, 9번) 추가 포스팅 링크함Stuff difficult to understand, (#8, 9), added more info posting 2018/12/28 - [Programming/Software Architecture] - Perfecting OO's Small Classes and Short Methods. 완벽한 객체지향의 작은 클래스와 짧은 메소드, Book:ThoughtWorks A..
Aracade Intro #48 isDigit. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar
Aracade Intro #48 isDigit. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Determine if the given character is a digit or not. 주어진 문자가 숫자인지 아닌지 확인해봐라 e.g. Input -> symbol = '0' Output -> isDigit(symbol) = true Input -> symbol = '-' Output -> isDigit(symbol) = false //Process //1. Input char symbol//2. Check if it's in the range of digit (ascii)// 2.1. If..
