리트코드 (55) 썸네일형 리스트형 [리트코드] 69. Sqrt(x) - js 1. 문제 https://leetcode.com/problems/sqrtx/ 2. 코드 /** * @param {number} x * @return {number} */ var mySqrt = function(x) { return Math.floor(Math.sqrt(x)); }; [리트코드] 17. Letter Combinations of a Phone Number - js (DFS) 1. 문제 https://leetcode.com/problems/letter-combinations-of-a-phone-number/ Letter Combinations of a Phone Number - LeetCode Can you solve this real interview question? Letter Combinations of a Phone Number - Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of d leetcode.com 2. 코.. [리트코드] 875. Koko Eating Bananas - js (이진탐색) 1. 문제 https://leetcode.com/problems/koko-eating-bananas/ Koko Eating Bananas - LeetCode Can you solve this real interview question? Koko Eating Bananas - Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating sp leetcode.com 2. 코드 이진 탐색으로 문제 풀 때는 꼭 반올림, 내림 신경써주기! /.. [리트코드] 509. Fibonacci Number - js 1. 문제 https://leetcode.com/problems/fibonacci-number/ Fibonacci Number - LeetCode Can you solve this real interview question? Fibonacci Number - The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, F(0) = 0 leetcode.com 2. 코드 /** * @param {number} n * @return {numbe.. [리트코드] 287. Find the Duplicate Number - js 1. 문제 https://leetcode.com/problems/find-the-duplicate-number/ Find the Duplicate Number - LeetCode Can you solve this real interview question? Find the Duplicate Number - Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number leetcode.com 2. 코드 /** * @param {number[]} n.. [리트코드] 1870. Minimum Speed to Arrive on Time - js (이진탐색) 1. 문제 https://leetcode.com/problems/minimum-speed-to-arrive-on-time/ Minimum Speed to Arrive on Time - LeetCode Can you solve this real interview question? Minimum Speed to Arrive on Time - You are given a floating-point number hour, representing the amount of time you have to reach the office. To commute to the office, you must take n trains in sequential order. Yo leetcode.com 2. 코드 /** * @par.. [리트코드] 13. Roman to Integer - js 1. 문제 https://leetcode.com/problems/roman-to-integer/ Roman to Integer - LeetCode Can you solve this real interview question? 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 tw leetcode.com 2. 코드 /** * @param {string} s * @return {number} .. [리트코드] 42. Trapping Rain Water - js 1. 문제 https://leetcode.com/problems/trapping-rain-water/ Trapping Rain Water - LeetCode Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: [https://assets.leetcode.com/upl leetcode.com 2. 코드 풀이 과정을 생각하기 정말 어려운 문제인 것 같다. 그래서 Hard.. 이전 1 2 3 4 5 6 7 다음