https://www.dincerbakkal.com/tags/backtracking/ Recent content in Backtracking on Dinçer Bakkal Hugo -- gohugo.io en-US This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. Sat, 02 Apr 2022 19:12:05 +0300 https://www.dincerbakkal.com/posts/sorubacktracking/ Sat, 02 Apr 2022 19:12:05 +0300 https://www.dincerbakkal.com/posts/sorubacktracking/ Leetcode 079 Word Search Leetcode 784 Letter Case Permutation Leetcode 078 Subsets Leetcode 090 Subsets II Leetcode 046 Permutations Leetcode 047 Permutations II Leetcode 077 Combinations Leetcode 039 Combination Sum Leetcode 040 Combination Sum II Leetcode 216 Combination Sum III Leetcode 022 Generate Parentheses Leetcode 494 Target Sum Leetcode 131 Palindrome Partitioning Leetcode 017 Letter Combinations of a Phone Number Leetcode 320 Generalized Abbreviation https://www.dincerbakkal.com/posts/leetcode320/ Tue, 20 Apr 2021 20:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode320/ A word’s generalized abbreviation can be constructed by taking any number of non-overlapping substrings and replacing them with their respective lengths. For example, “abcde” can be abbreviated into “a3e” (“bcd” turned into “3”), “1bcd1” (“a” and “e” both turned into “1”), and “23” (“ab” turned into “2” and “cde” turned into “3”). Given a string word, return a list of all the possible generalized abbreviations of word. Return the answer in any order. https://www.dincerbakkal.com/posts/leetcode017/ Tue, 20 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode017/ Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. Input: digits = "23" Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"] Input: digits = "" Output: [] Input: digits = "2" Output: ["a","b","c"] Soruda bizden telefonlarda olan kodlama sistemine göre verilen rakamların kaç farklı harf kombinasyonu olduğunu bulmamızı istiyor. https://www.dincerbakkal.com/posts/leetcode131/ Mon, 19 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode131/ Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. A palindrome string is a string that reads the same backward as forward. Input: s = "aab" Output: [["a","a","b"],["aa","b"]] Input: s = "a" Output: [["a"]] Soruda bize bir string listesi veriliyor.Ve bu listeden oluşturulabilecek palindrome string parçalarını bulmamız isteniyor. Palindrome düz ve ters aynı şekilde okunabilen kelime demek. https://www.dincerbakkal.com/posts/leetcode494/ Sun, 18 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode494/ You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols ‘+’ and ‘-’ before each integer in nums and then concatenate all the integers. For example, if nums = [2, 1], you can add a ‘+’ before 2 and a ‘-’ before 1 and concatenate them to build the expression “+2-1”. Return the number of different expressions that you can build, which evaluates to target. https://www.dincerbakkal.com/posts/leetcode022/ Sat, 17 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode022/ Soru Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Örnek 1 Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"] Örnek 2 Input: n = 1 Output: ["()"] Çözüm n çift parantez kullanarak oluşturulabilecek tüm geçerli parantez kombinasyonlarını üretmenizi isteyen bir problem. Burada geçerli bir kombinasyon, her açılan parantezin bir kapanış parantezi ile eşleşmesi ve herhangi bir zamanda açık parantez sayısının kapanan parantez sayısını geçmemesi gerektiğini ifade eder. https://www.dincerbakkal.com/posts/leetcode216/ Fri, 16 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode216/ Find all valid combinations of k numbers that sum up to n such that the following conditions are true: Only numbers 1 through 9 are used. Each number is used at most once. Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order. Input: k = 3, n = 7 Output: [[1,2,4]] Explanation: 1 + 2 + 4 = 7 There are no other valid combinations. https://www.dincerbakkal.com/posts/leetcode040/ Thu, 15 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode040/ 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. Input: candidates = [10,1,2,7,6,1,5], target = 8 Output: [ [1,1,6], [1,2,5], [1,7], [2,6] ] Input: candidates = [2,5,2,1,2], target = 5 Output: [ [1,2,2], [5] ] Soruda bize candidates listesi içinde sayılar ve bir target sayı veriliyor. https://www.dincerbakkal.com/posts/leetcode039/ Wed, 14 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode039/ Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different. It is guaranteed that the number of unique combinations that sum up to target is less than 150 combinations for the given input. https://www.dincerbakkal.com/posts/leetcode077/ Tue, 13 Apr 2021 19:12:05 +0300 https://www.dincerbakkal.com/posts/leetcode077/ Given two integers n and k, return all possible combinations of k numbers out of the range [1, n]. You may return the answer in any order. Input: n = 4, k = 2 Output: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ] Input: n = 1, k = 1 Output: [[1]] Soruda bize n ve k değerleri veriliyor.Bizden istenen 1-n arasındaki sayıların k’li kombinasyonu. Bu soruda 90. sorudaki çözüm şeklini izleyebiliriz.