부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/permutations-ii Permutations II - LeetCode Can you solve this real interview question? Permutations II - Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]] leetcode.com 2. 문제 설명 이전 46. Permutations와 유사하게, nums라는 array가 ..

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/jump-game-ii/ Jump Game II - LeetCode Can you solve this real interview question? Jump Game II - You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other wo leetcode.com 2. 문제 설명 길이가 n인 정수로 구성된 array인 nums가 주어졌을 때, nums[i..

1. 문제 링크 https://leetcode.com/problems/multiply-strings/ Multiply Strings - LeetCode Can you solve this real interview question? Multiply Strings - Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string. Note: You must not use any built-in BigInteger library leetcode.com 2. 문제 설명 num1과 num2 가 str으로 주어졌을 때 이 두 수를 곱한 ..

1. 문제 링크 https://leetcode.com/problems/combination-sum-ii/ Combination Sum II - LeetCode Can you solve this real interview question? Combination Sum II - Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. Each number in candid leetcode.com 2. 문제 설명 기존 Combination Sum(Leetcode39)의..

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. 문제 링크 https://leetcode.com/problems/valid-sudoku/ Valid Sudoku - LeetCode Can you solve this real interview question? Valid Sudoku - Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: 1. Each row must contain the digits 1-9 without repetition. 2. Each c leetcode.com 2. 문제 설명 스도쿠 문제가 주어졌을 때 valid 한 지 따져서 True, False 반환 valid..

1. 문제 링크 https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/ Find First and Last Position of Element in Sorted Array - LeetCode Can you solve this real interview question? Find First and Last Position of Element in Sorted Array - Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target v..