Gulshan Kumarperfinsights.hashnode.dev·Feb 24, 2024SubsetsGiven 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. LeetCode Problem - 78 class Solution { public List<List<Integer>> s...DiscussJava Solutionarray
atchyut nagabhairavaatchyutn.hashnode.dev·Dec 19, 2023Understanding the Differences: Subsets, Subarrays, and Subsequences in Data StructuresIn the world of data structures and algorithms, understanding the nuances between similar-sounding terms is crucial. Today, we're diving into three such terms: subsets, subarrays, and subsequences. While they might seem interchangeable at first glanc...Discuss Problem Solving Techniques
Ashish Guleriaaashiishh.hashnode.dev·Nov 5, 2023Exploring Backtracking: Solving the Rat in a Maze ProblemIntroduction Backtracking is a powerful algorithmic technique used in solving a wide range of problems, especially those that involve making a series of choices or decisions to reach a solution. In this blog, we will delve into the concept of backtra...Discuss·15 likes·143 readsbacktracking
RaiTech Labsraitech.hashnode.dev·Sep 28, 2023Backtracking Leetcode questions and solutions in SwiftQuestion 1 - Subsets 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: nums = [1,2,3] Output: [...Discussbacktracking
Haocheng Linhaochengcodedev.hashnode.dev·Sep 19, 2023Visualizing the Eight Queens Problem with PygameIntroduction The Eight Queens puzzle is a classic combinatorial problem. The task is to arrange eight queens on an 8x8 chessboard without any two queens threatening each other. This means that no two queens can be in the same row, column, or diagonal...DiscussTutorial
Akash Devakashdevblog.hashnode.dev·Sep 19, 2023Backtracking 101Welcome, dear readers, to the final installment of our algorithm design series. I hope you've been enjoying this journey and gaining a solid grasp of the concepts presented in my blogs. In this article, we'll delve into the fascinating realm of backt...DiscussAlgorithms for Everyone: A Beginner’s Guide to Algorithm Design Techniquesbacktracking
Pragya Srivastavaitspragya028.hashnode.dev·Sep 16, 2023Backtracking for DSAIntroduction: Before delving into the concept of backtracking, let's tackle some problems to gain a practical understanding of why backtracking is a valuable approach. Prerequisites- Before we begin, it's essential to have a basic understanding of ...Discuss·10 likes·69 readsDSA
Roushan shahroushanshah.hashnode.dev·Sep 2, 2023BacktrackingIntro: Backtracking is an algorithm technique that considers searching in every possible combination for solving a computational problem. Computational Problems are those problems that can be solved step-by-step by computer. Backtracking is known for...Discussbacktracking
Balaji BatchuforDSA Blogbalaji-dsa.hashnode.dev·Jul 22, 2023BackTracking in Detail 🏆1. What is backtracking? Backtracking is an algorithmic technique used to systematically explore all possible solutions to a problem by incrementally building a solution and backtracking when a solution cannot be completed further. It is particularly...Discussdatastructure
Tanisha Manglatanishatechblog.hashnode.dev·Apr 9, 2023BacktrackingBacktracking is an algorithmic technique used to solve problems that involve finding all possible solutions to a problem by exploring all possible paths. In Java, backtracking is often implemented using recursion. The general idea of backtracking is ...Discuss·2 likes·57 readsbacktracking
