Feb 24 · 2 min read · In this article we will solve the all string permutation problem with javascript by backtracking method. We will generate the solution tree and write the code accordingly, Solution Tree Code class
Join discussion
Jan 6 · 7 min read · DFS Traversal — 4 Easy Rules Rule 1 — Start Put the starting vertex into a stack Keep an empty visited set stack.push(start); Set<Integer> visited = new HashSet<>(); Rule 2 — Take from Stack While the stack is not empty: Pop the top vertex fro...
Join discussionOct 22, 2025 · 4 min read · Tags: leetcode, algorithms, backtracking, javaMeta description: Clean Java backtracking for LeetCode 39 (Combination Sum). Includes pruning, complexity notes, and a decision-tree diagram to visualize the DFS search. 🧠 Problem Given an array of dis...
Join discussionSep 10, 2025 · 7 min read · 📘 Lecture 3: Optimization Optimization is the process of choosing the best option from a set of possible alternatives.We already saw a similar problem in the minimax algorithm, and today we’ll learn broader optimization techniques. 📌 1. Local Sear...
Join discussion
Aug 22, 2025 · 2 min read · How to use Backtracking in simple problems When using backtracking we basically want to “take pictures” of a certain state of our list, object, etc. This “pictures” we save in another list and after we follow two paths. In the first one we increment ...
Join discussionAug 5, 2025 · 13 min read · 🚀 Welcome to another #TutorialTuesday with AlgoAvengers! At AlgoAvengers, our #TutorialTuesday series is all about breaking down tough concepts into easily digestible tutorials. This time, we're going all-in on Backtracking, one of the most versatil...
Join discussion
