부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/word-break/ Word Break - LeetCode Can you solve this real interview question? Word Break - Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary may leetcode.com 2. 문제 설명 문자열과 사전(단어들이 들어 있는 리스트)이 주어졌을 때, 사전의 단어들을 조합하여..

1. 문제 링크 https://leetcode.com/problems/count-complete-tree-nodes/ 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 2. 문제 설명 주어진 완전 이진 트리의 노드 개수를 반환하는 문제 완전 이진 트리란 마지막 레벨을 제외한 모든 레벨에서 노드가 왼쪽에서 오른쪽으로 채워진 이진 트리를 의미, 모든 레벨의 노드는 ..

1. 문제 링크 Word Search - LeetCode Word Search - LeetCode Can you solve this real interview question? Word Search - Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are h leetcode.com 2. 문제 설명 board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]] ..

1. 문제 링크 https://leetcode.com/problems/gray-code/description/ Gray Code - LeetCode Can you solve this real interview question? Gray Code - An n-bit gray code sequence is a sequence of 2n integers where: * Every integer is in the inclusive range [0, 2n - 1], * The first integer is 0, * An integer appears no more than once in the sequence, leetcode.com 2. 문제 설명 n-bit gray code sequence는 아래 조건을 만족하..

1. 문제 링크 Pow(x, n) - LeetCode - LeetCode Can you solve this real interview question? - Implement pow(x, n) [http://www.cplusplus.com/reference/valarray/pow/], which calculates x raised to the power n (i.e., xn). Example 1: Input: x = 2.00000, n = 10 Output: 1024.00000 Example 2: Input: x = 2.1 leetcode.com 2. 문제 설명 x와 n이 주어지면 x의 n제곱을 반환하기 3. 처음 풀이 그냥 x**n 하면 되는데 그게 출제 의도는 아닌 것 같다. x가 0이나 1이면 그대로..

1. 문제 링크 Permutations - LeetCode Permutations - LeetCode Can you solve this real interview question? Permutations - Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1], leetcode.com 2. 문제 설명 [1,2,3] 이 주어지면 이 수들로 가능한 모둔 순열(중복X, 순서 구분O)을 반환하는 문제 예시) [1,2,3]이..

1. 문제 링크 https://leetcode.com/problems/count-and-say Count and Say - LeetCode Can you solve this real interview question? Count and Say - The count-and-say sequence is a sequence of digit strings defined by the recursive formula: * countAndSay(1) = "1" * countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1 leetcode.com 2. 문제 설명 count-and-say sequence는 재귀적인 공식에 의해 정의된 숫..

1. 문제 링크 Convert Sorted Array to Binary Search Tree - LeetCode Convert Sorted Array to Binary Search Tree - LeetCode Can you solve this real interview question? Convert Sorted Array to Binary Search Tree - Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree. Example 1: [https://assets.leetcod leetcode.com 2. 문제 설명 오름차순으..