Aracade Intro #26 evenDigitsOnly. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar
Aracade Intro #26 evenDigitsOnly. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, 예제, example, c++ java c# scalar Q. Check if all digits of the given integer are even. 모든 자릿수 숫자가 짝수인지 확인하라 e.g. Input -> n = 248622 Output -> evenDigitsOnly(n) = true Input -> n = 642386 Output -> evenDigitsOnly(n) = false //처리과정//1. 정수를 입력받는다.//2. 정수의 자릿수 시작부터 끝까지 반복한다.// 2.1. 숫자가 짝수인지 확인한다.//3. 결과를 리턴한다. /..
LeetCode problem #2 Add Two Numbers. Algorithm, 알고리즘, 코딩 문제풀이, LeetCode, 릿코드, 기술면접, CodeFights, CodeSignal, 코드파이트, 코드시그널, c++ java c#
LeetCode problem #2 Add Two Numbers. Algorithm, 알고리즘, 코딩 문제풀이, LeetCode, 릿코드, 기술면접, CodeFights, CodeSignal, 코드파이트, 코드시그널, c++ java c# Q.You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not cont..
Aracade Intro #24 minesweeper. Algorithm, 알고리즘, Codefights, CodeSignal, regx, 정규표현식, 코드파이트, 코드시그널, c++ java c# scalar
Aracade Intro #24 minesweeper. Algorithm, 알고리즘, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar Q. In the popular Minesweeper game you have a board with some mines and those cells that don't contain a mine have a number in it that indicates the total number of mines in the neighboring cells. Starting off with some arrangement of mines we want to create a Minesweeper game setup. 지뢰찾기 게임에..
Aracade Intro #22 avoidObstacles. Algorithm, 알고리즘, Codefights, CodeSignal, regx, 정규표현식, 코드파이트, 코드시그널, c++ java c# scalar
Aracade Intro #22 avoidObstacles. Algorithm, Codefights, CodeSignal, regx, 정규표현식, 코드파이트, 코드시그널, c++ java c# scalar Q. You are given an array of integers representing coordinates of obstacles situated on a straight line. Assume that you are jumping from the point with coordinate 0 to the right. You are allowed only to make jumps of the same length represented by some integer. Find the minimal len..
Aracade Intro #21 isIPv4Address. Algorithm, 알고리즘, Codefights, CodeSignal, regx, 정규표현식, 코드파이트, 코드시그널, c++ java c# scalar
Aracade Intro #21 isIPv4Address. Algorithm, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar Q. An IP address is a numerical label assigned to each device (e.g., computer, printer) participating in a computer network that uses the Internet Protocol for communication. There are two versions of the Internet protocol, and thus two versions of addresses. One of them is the IPv4 address. IP주소..
Aracade Intro #20 arrayMaximalAdjacentDifference. Algorithm, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar
Aracade Intro #20 arrayMaximalAdjacentDifference. Algorithm, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar Q.Given an array of integers, find the maximal absolute difference between any two of its adjacent elements. 주어진 정수 배열 중에서, 인접한 정수끼리 최대의 차이값(절대값) 을 구하여라 e.g.Input -> inputArray = [2, 4, 1, 0]Output -> arrayMaximalAdjacentDifference(inputArray) = 3. ? index 1, 2 -> 4 and 1 -> 3 //..
Aracade Intro #19 AreEquallyStrong. Algorithm, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar
Aracade Intro #19 AreEquallyStrong. Algorithm, Codefights, CodeSignal, 코드파이트, 코드시그널, c++ java c# scalar Q. Call two arms equally strong if the heaviest weights they each are able to lift are equal. Call two people equally strong if their strongest arms are equally strong (the strongest arm can be both the right and the left), and so are their weakest arms. Given your and your friend's arms' lift..