FrontEnd :-)

(Udemy) The Web Developer 부트캠프 2023 :: 섹션 33: Express로 서버 제작하기 (Express 공식 문서) https://expressjs.com/ko [334. 우리의 첫 번째 Express 앱] 폴더 생성, express 설치, index.js 생성 mkdir FirstApp cd FristApp npm init -y npm i express touch index.js //index.js const express = require("express"); const app = express(); // console.dir(app) app.listen(8080, () => { console.log("Listening on port 8080!") }) 작성 후, 터미널에서 ..

🙋 문제: Merge Two Sorted Lists You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list. Example 1: Input: list1 = [1,2,4], list2 = [1,3,4] Output: [1,1,2,3,4,4] Example 2: Input: list1 = [], list2 = [] Output: [] Example 3: I..

🙋 문제: Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Every close bracket has a corresponding open bracket of the same type. Example 1: Input: s = "()" Output: true Exa..

🙋 문제: Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: 1 strs 배열의 첫 번째 문자를 기준으로..

🙋 문제: 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,..