부부의 코딩 성장 일기

1. 문제 링크 Subsets II - LeetCode Subsets II - LeetCode Can you solve this real interview question? Subsets II - Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example leetcode.com 2. 문제 설명 중복된 숫자가 포함된 배열이 주어질 때, 해당 배열의 모든 부분집합을 나열하는 문제 예시) [1, 2, 2]이 주어지면 [[..

1. 문제 링크 https://leetcode.com/problems/partition-list/ Partition List - LeetCode Can you solve this real interview question? Partition List - Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the no leetcode.com 2. 문제 설명 연결 리스트 head = [1,4,3,2,5,2]와 기준 값 x = ..

1. 문제 링크 https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/ Partition List - LeetCode Can you solve this real interview question? Partition List - Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the no leetcode.com 2. 문제 설명 정렬된..

1. 문제 링크 https://leetcode.com/problems/search-in-rotated-sorted-array-ii/ Search in Rotated Sorted Array II - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array II - There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is rotated at an unknown pivot leetcode.com 2. 문제 설명 오..

1. 문제 링크 https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ Remove Duplicates from Sorted Array II - LeetCode Can you solve this real interview question? Remove Duplicates from Sorted Array II - Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place [https://en.wikipedia.org/wiki/In-place_algorithm] such that each unique elemen leetcode.com..

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/subsets/ Subsets - LeetCode Can you solve this real interview question? Subsets - Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example 1: Input: n leetcode.com 2. 문제 설명 unique elements로 구성된 array nums가 주어졌을 때, 모든 가능한 subsets..

1. 문제 링크 https://leetcode.com/problems/edit-distance/ 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. 문제 설명 두 개의 문자열(word1과 word2)이 주어졌을 때, 한 문자열을 다른 문자열로 변환하기 위해 필요한 최소 편집 연산의 수를 찾는 문제 가능한 연산은 세 가지로 삽입(Insert): 한 문자를 삽입..