넘치게 채우기

https://leetcode.com/problems/maximum-score-words-formed-by-letters/description/leetcode - Maximum Score Words Formed by Letters문제 유형 : 재귀, 백트래킹, dfs, 문자열 처리문제 난이도 : Hard 문제Given a list of words, list of  single letters (might be repeating) and score of every character.Return the maximum score of any valid set of words formed by using the given letters (words[i] cannot be used two or more times)..

https://leetcode.com/problems/the-number-of-beautiful-subsets/description/leetcode - The Number of Beautiful Subsets문제 유형 : 백트래킹, dfs, 재귀문제 난이도 : Medium 문제You are given an array nums of positive integers and a positive integer k.A subset of nums is beautiful if it does not contain two integers with an absolute difference equal to k.Return the number of non-empty beautiful subsets of the array nu..

https://leetcode.com/problems/palindrome-partitioning/description/leetcode - Palindrome Partitioning문제 유형 : 문자열 처리, 재귀, dfs, 백트래킹문제 난이도 : Medium 문제Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. 문자열 s가 주어진다.모든 (s를 쪼갠 조각들이 팰린드롬 문자열)인 집합들을 반환하시오. ex-> "aab"는 ["a", "a", "b"]로 나누면 모두 팰린드롬인 문자열들로 나눈 것입니다. 풀이재귀..

https://leetcode.com/problems/subsets/description/leetcode - Subsets문제 유형 : dfs, 백트래킹, 재귀, 비트마스킹문제 난이도 : Medium 문제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. 중복이 없는 요소들의 정수 배열 nums가 주어진다. 모든 부분집합을 만드시오.중복된 부분집합을 허용하지 않습니다.순서는 상관 없습니다. 풀이백트래킹 풀이 - 빈 배열부터 시작해서 이번 인..

https://leetcode.com/problems/path-with-maximum-gold/description/leetcode - Path with Maximum Gold문제 유형 : dfs, 백트래킹, 행렬, 재귀문제 난이도 : Medium 문제In a gold mine grid of size m x n, each cell in this mine has an integer representing the amount of gold in that cell, 0 if it is empty.Return the maximum amount of gold you can collect under the conditions:Every time you are located in a cell you will coll..

https://leetcode.com/problems/word-search/description/ Leetcode - Word Search 문제 유형 : 문자열 처리, dfs, 백트래킹 문제 난이도 : Medium 문제 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 m..

https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/description/?envType=daily-question&envId=2024-01-24 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 LeetCode - Pseudo-Palindromic Paths in a Binary Tr..

https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/description/?envType=daily-question&envId=2024-01-23 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 LeetCode - Maximum Length of ..

백트래킹 기법은 해를 찾는 도중, 해가 될 가능성이 없으면 이전으로 되돌아가면서 시간을 아끼는 방법이다. 보통 구현 방식은 DFS의 중간에 조건식을 넣어서, 더 깊게 들어가봤자 의미가 없다는 것을 판단시킨 후, 이전으로 돌아가게 하는 식으로 한다. 이 과정을 가지치기라고 하고, 이 가지치기의 조건을 얼마나 잘 설정하느냐가 관건이 된다.