일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
31 |
- ChatGPT
- 코린이
- 프로그래머스
- Ai
- 알고리즘기초주차
- typeScript
- 웹개발종합반
- 달리기반
- 스파르타코딩클럽
- ReactNative
- 프론트엔드
- 챗GPT
- REACT
- 항해99
- 7기
- TDD
- NotionAI
- rn
- 맥린이
- TS
- 사전준비
- 필수강의
- Programmers
- 멍친구
- 실전프로젝트
- Expo
- 리액트
- 알pdf #파일탐색기미리보기안될때
- 팀워크최고
- D반8조
- Today
- Total
목록JavaScript/Algorithm (27)
FrontEnd :-)

🙋 문제: Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II. Roman numerals are usually written largest to smallest from..

🙋 문제: Palindrome Number (대칭수) Given an integer x, return true if x is a palindrome*, and false otherwise. *palindrome: An integer is a palindrome when it reads the same forward and backward. For example, 121 is a palindrome while 123 is not. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Example 2: Input: x = -121 Output: false Exp..

🙋 문제: Two Sum / Easy 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 use the same element twice. You can return the answer in any order. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9,..