수니의 개발새발

💡 문제 (Easy) 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 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. 로마 숫자는 일곱 가지 다른 기호로 나타낼 수 있습니다: I, V, X, L, C, D 및 M. Symbol Value I 1 V 5 X 10 ..

💡 문제 (Easy) 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 Given an integer x, return true if x is a palindrome, and false otherwise. 정수 x가 주어졌을 때, x가 palindrome(앞에서 뒤로, 뒤에서 앞으로 읽었을 때 동일한 내용이 되는 것)인 경우 true를 반환하고 그렇지 않은 경우..

💡 문제 (Easy) 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..

💡 문제 (Easy) Middle of the Linked List - LeetCode Can you solve this real interview question? Middle of the Linked List - Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Example 1: [https://assets.leetcode. leetcode.com Given the head of a singly linked list, return the middle node of the linked list...

💡 문제 (Easy) Fizz Buzz - LeetCode Can you solve this real interview question? Fizz Buzz - Given an integer n, return a string array answer (1-indexed) where: * answer[i] == "FizzBuzz" if i is divisible by 3 and 5. * answer[i] == "Fizz" if i is divisible by 3. * answer[i] == "Buzz" if i is leetcode.com Given an integer n, return a string array answer (1-indexed) where: - answer[i] == "FizzBuzz" if..