dfs18 [Leetcode 51] - N-Queens w/ Python The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order. Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively. n x n크기.. 2024. 4. 16. [Leetcode 131] - Palindrome Partitioning w/ Python Given a string s, partition s such that every substring of the partition is a palindrome . Return all possible palindrome partitioning of s. s라는 string이 주어졌을때 글자를 분할해서 회문이 되는 모든 경우를 찾는 문제 https://leetcode.com/problems/palindrome-partitioning/description/ Example 1: Input: s = "aab" Output: [["a","a","b"],["aa","b"]] Example 2: Input: s = "a" Output: [["a"]] 백트래킹으로 해결 가능한 문제 모든 글자에서 시작해 각각 다음에 오는.. 2024. 4. 13. [Leetcode 79] - 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 horizontally or vertically neighboring. The same letter cell may not be used more than once. m x n의 배열이 주어지고 단어가 string으로 주어진다면 그 단어가 보드 배열에 있는지 확인하는 문제 상하좌우로 움직일 수 있고 이미 방문한 칸은 재방문이 불가능하다 https://leet.. 2024. 4. 13. [Leetcode 40] - Combination Sum II w/ Python 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 candidates may only be used once in the combination. Note: The solution set must not contain duplicate combinations. 숫자들로 이루어진 배열과 목표 (타겟) 숫자가 주어진다 배열들에 있는 숫자 합으로 목표에 도달할 수 있는 조합을 찾는 문제 배열에 있는 숫자는 한번씩 사용 가능하고 같은 조합.. 2024. 4. 13. [Leetcode 78] - Subsets w/ Python 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. 숫자 배열이 주어졌을때 가능한 모든 하위 집합을 리턴 중복된 집합을 배제해야된다 https://leetcode.com/problems/subsets/description/ Example 1: Input: nums = [1,2,3] Output: [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]] Example 2: Input: nums = [0] Output: [.. 2024. 4. 12. [Leetcode 212] - Word Search II w/ Python Given an m x n board of characters and a list of strings words, return all words on the board. Each word must be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once in a word. 각 칸마다 글자가 들어있는 m x n 크기의 보드가 주어진다. 단어가 들어있는 words 배열 또한 주어진다 보드에 단어가 들어있으면 배열에 단어를 포함 시켜 리턴하는 문제 보드에.. 2024. 4. 11. [Leetcode 297] - Serialize and Deserialize Binary Tree w/ Python Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment. Design an algorithm to serialize and deserialize a binary tree. There is no restriction on how your serialization/deserialization al.. 2024. 4. 11. [Leetcode 124] - Binary Tree Maximum Path Sum w/ Python A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path. 이진 트리가 주.. 2024. 4. 11. [Leetcode 105] - Construct Binary Tree from Preorder and Inorder Traversal w/ Python Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree. 전위 순회와 중위 순회가 주어진다면, 이를 통해 이진 트리를 만드는 문제 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ Example 1: Input: preorder = [3,9,20,15,7], inorder = [9,3,.. 2024. 4. 11. 이전 1 2 다음 반응형
