https://leetcode.com/problems/perfect-number/description/문제A perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. A divisor of an integer x is an integer that can divide x evenly.Given an integer n, return true if n is a perfect number, otherwise return false.Example 1:Input: num = 28Output: trueExplanation: 28 = 1 + 2 + 4 + 7 + 141..

344. Reverse String (Kotlin) 문제Write a function that reverses a string. The input string is given as an array of characters s.You must do this by modifying the input array in-place with O(1) extra memory.Example 1:Input: s = ["h","e","l","l","o"]Output: ["o","l","l","e","h"]Example 2:Input: s = ["H","a","n","n","a","h"]Output: ["h","a","n","n","a","H"]Constraints:1 s[i] is a printable ascii char..

Easy - 13. Roman to Integerhttps://leetcode.com/problems/roman-to-integer/description/나의 풀이풀이 접근 과정 우선 로마 숫자를 모두 배열에 넣고 치환하여 더하는 작업 진행 최종 풀이class Solution { fun romanToInt(s: String): Int { var input = s var answer = 0 val map: Array> = arrayOf( "CM" to 900, "CD" to 400, "XC" to 90, "XL" to 40, "IX" to 9, "..

Easy - 278. First Bad Version 문제 해석 총 물건의 개수 n을 입력받는다. 그 중 불량품의 첫 시작을 찾아내는 문제이다. 만약 1~7번까지의 상품이 있는데, 3번이 불량인 경우 3번부터는 모두 불량품이 된다. 문제에서는 input이 n과 bad 두가지 값이라고 나오지만 n만 입력받는다 생각하고 풀면 된다. 풀이 방법 풀이 접근 과정 그냥 이진탐색으로 풀면 된다고 생각했다. 아예 예시에서 이진탐색으로 풀도록 알려줘서 접근 자체는 쉬웠다. 최종 소스코드 /* The isBadVersion API is defined in the parent class VersionControl. fun isBadVersion(version: Int) : Boolean {} */ class Solutio..

Two Sum - LeetCode Can you solve this real interview question? Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not leetcode.com 문제 Given an array of integers nums and an integer target, return indices of the two numbers such that they add..

LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique. The athletes ar..