Juni_Dev_log

▶ Anagram 📌Problem Introduction An anagram is a rearrangement of letters to form a new word. : 아나그램은 새로운 단어로부터 철자의 재배열로 이루어진다. Given a word and a list of candidates, select the sublist of anagrams of the given word. : 단어와 후보 목록들이 주어지면, 주어진 단어의 아나그램의 하위 목록을 선택한다. Given "listen" and a list of candidates like "enlists" "google" "inlets" "banana" the program should return a list containing "inlets"...

▶ Perfect Numbers 📌 Problem Introduction Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers. : 양의 정수에 대한 Nicomachus의 (60-120 CE) 분류 체계를 기반으로 숫자가 완전, 풍부 또는 부족인지 확인합니다. The Greek mathematician Nicomachus devised a classification scheme for positive integers, identifying each as belonging uniquely to the categories..

▶ Difference Of Squares 📌 Problem Introduction Find the difference between the square of the sum and the sum of the squares of the first N natural numbers. : 합의 제곱과 처음 N 개의 자연수의 제곱의 합 사이의 차이를 찾으십시오. The square of the sum of the first ten natural numbers is (1 + 2 + ... + 10)² = 55² = 3025. : 1~10까지의 자연수들의 합의 제곱은 55² = 3025이다. The sum of the squares of the first ten natural numbers is 1² + 2² + ...

▶ Word Count 📌 Problem Introduction Given a phrase, count the occurrences of each word in that phrase. For the purposes of this exercise you can expect that a word will always be one of: A number composed of one or more ASCII digits (ie "0" or "1234") OR A simple word composed of one or more ASCII letters (ie "a" or "they") OR A contraction of two simple words joined by a single apostrophe (ie "..