목록leetcode (11)

Written

69. Sqrt(x) / 70. Climbing Stairs / 8. String to Integer (atoi) / 코딩테스트 스터디 문제풀이 모음 (Leetcode)

https://leetcode.com/problems/sqrtx/ Sqrt(x) - LeetCode Can you solve this real interview question? Sqrt(x) - Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or o leetcode.com Example 1: Input: x = 4 Output: 2 Explanation: The square root of 4 is 2..
알고리즘 문제풀이 2023. 2. 28. 17:58
leetcode / Unique Binary Search Tree II / JavaScript

https://leetcode.com/problems/binary-tree-inorder-traversal/submissions/905212431/ Given the root of a binary tree, return the inorder traversal of its nodes' values. => 이진트리의 루트노드가 주어졌을때 , 노드의 value값들을 중위순회하여 반환하는 문제입니다. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] 재귀함수의 동작 방식에 대해서 잘 이해하고 있다면, 복잡하지 않게 풀어낼 수 있는 문제입니다. 중위순회의 정의대로 왼쪽 자식노드 -> 부모노드 -> 오른쪽자식노드순으로 val값을 찍어낼 수 있게끔 재귀함수를 이용하여 코..
알고리즘 문제풀이 2023. 2. 26. 17:49
leetcode / 7. Reverse Integer / JavaScript

https://leetcode.com/problems/reverse-integer/ Reverse Integer - LeetCode Reverse Integer - Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0. Assume the environment does not allow you to store 64-bit in leetcode.com 입력으로 주어지는 32비트 정수 x가 있습니다. 그리고 x를 뒤집은 숫자를 리턴합니다. 만약 x를..
알고리즘 문제풀이 2023. 2. 21. 18:55
leetcode / 67. Add Binary / JavaScript

https://leetcode.com/problems/add-binary/ Add Binary - LeetCode Can you solve this real interview question? Add Binary - Given two binary strings a and b, return their sum as a binary string. Example 1: Input: a = "11", b = "1" Output: "100" Example 2: Input: a = "1010", b = "1011" Output: "10101" Constraints: * leetcode.com a와 b로 주어지는 두 이진수의 덧셈을 다시 이진수로 출력하는 문제입니다. Example 1: Input: a = "11", b..
알고리즘 문제풀이 2023. 2. 21. 18:37
leetcode / 66. Plus One / JavaScript

https://leetcode.com/problems/plus-one/ Plus One - LeetCode Can you solve this real interview question? Plus One - You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to- leetcode.com 입력으로 주어진 배열을 하나의 정수처럼 보고 거기에 +1을 더한 후 그렇게 구한 값을 배열에 옮겨서 출력하는 문제였습니다...
알고리즘 문제풀이 2023. 2. 21. 18:28
스터디 4주차 / leetcode / Longest Palindromic Substring / JavaScript

https://leetcode.com/problems/longest-palindromic-substring/ Longest Palindromic Substring - LeetCode Longest Palindromic Substring - Given a string s, return the longest palindromic substring in s. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Constraints: * 1
알고리즘 문제풀이 2023. 2. 1. 18:31
스터디 4주차 / leetcode / Remove Element / JavaScript

https://leetcode.com/problems/remove-element/ Remove Element - LeetCode Remove Element - Given an integer array nums and an integer val, remove all occurrences of val in nums in-place [https://en.wikipedia.org/wiki/In-place_algorithm]. The relative order of the elements may be changed. Since it is impossible to change the leng leetcode.com Given an integer array nums and an integer val, remove a..
알고리즘 문제풀이 2023. 2. 1. 16:53
스터디 4주차 / leetcode 26번 / Remove Duplicates from Sorted Array / JavaScript

https://leetcode.com/problems/remove-duplicates-from-sorted-array/ Remove Duplicates from Sorted Array - LeetCode Remove Duplicates from Sorted Array - Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place [https://en.wikipedia.org/wiki/In-place_algorithm] such that each unique element appears only once. The relative order of the e leetcode.com Given an integ..
알고리즘 문제풀이 2023. 2. 1. 16:37
이전 Prev 1 2 Next 다음