×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

backtracking

A collection of 18 posts

Algorithms

Maximum Profit by Buying and Selling a Share at Most k Times

In this article at OpenGenus, we will solve the problem of getting maximum profit by buying and selling a share at most k times.

Manraj Singh Manraj Singh
backtracking

Shortest path in a Maze using Backtracking

In this article, we have covered the topic on finding the Shortest path in a Maze using Backtracking. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
Algorithms

Generating IP Addresses [Backtracking String problem]

In this article, we will explore a common problem of restoring IP addresses from a given string of digits. For example, given the string "25525511135", the valid IP addresses that can be generated are "255.255.11.135" and "255.255.111.35".

S Sudharshan
backtracking

Parallel Backtracking

In this article, we have covered the Parallel Backtracking algorithm. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Disadvantages of Backtracking

In this article, we have covered the Disadvantages of Backtracking algorithm.

CHEW Chee Keng
backtracking

Backtracking vs Branch and Bound

In this article, we have compared Backtracking vs Branch and Bound algorithms.

CHEW Chee Keng
backtracking

Kirkman Schoolgirls Problem

In this article, we have covered the Backtracking Algorithm for Kirkman Schoolgirls Problem and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Iterative Backtracking

In this article, we will be exploring the idea of backtracking with the help of iteration (Iterative Backtracking) along with example as well. The Time and Space Complexity will be discussed at the end of the article.

CHEW Chee Keng
game theory

Game Tree

In this article, we have covered the concept of how Backtracking help us to solve Game Tree. We will solve the Game Tree Problem by making use of the Minimax Algorithm. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Backjumping

In this article, we have covered the concept of Backjumping which is an improvement to the Backtracking Algorithm. We will solve the N Queens Problem by making use of the Backjumping Algorithm. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Solve Crossword using Backtracking

In this article, we have covered the Backtracking Algorithm for Crossword and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.

CHEW Chee Keng
backtracking

Backtracking Algorithm for Sudoku

In this article, we have covered the Backtracking Algorithm for Sudoku and compared with the Brute Force approach. We have presented the Time and Space Complexity for various cases.

Kartheesh Reddy Koripelli
Algorithms

Recursive Backtracking

Backtracking is one of the many algorithmic techniques that can be used to solve various problems. In this article, we will exploring the idea of backtracking with the help of recursion (Recursive Backtracking) along with examples as well.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Knight’s Tour Problem

The Knight's Tour Problem is one of the famous problem in which we have the knight on a chessboard. The knight is supposed to visit every square exactly once. We have explored Backtracking and Warnsdorff's algorithm.

Srishti Guleria Srishti Guleria
Algorithms

8 Queens Problem using Backtracking

In this article, we will solve the 8 queens problem using backtracking which will take O(N!) time complexity. We demonstrate it with code.

Mansi Kathuria
Algorithms

Subset Sum Problem solved using Backtracking approach 【O(2^N) time complexity】

In this article, we will solve Subset Sum problem using a backtracking approach which will take O(2^N) time complexity

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

All Valid Word Breaks of a Sentence 【O(2^N) time complexity】

We are given with a valid sentence without any spaces and we are given with a dictionary of words. We need to print all the possible ways to break the sentence so that all the breaked words belongs to the dictionary.

Sadanand Vishwas Sadanand Vishwas
Algorithms

Using Bron Kerbosch algorithm to find maximal cliques in O(3^(N/3))

Bron–Kerbosch algorithm is an enumeration algorithm for finding maximal cliques in an undirected graph. Any n-vertex graph has at most 3^n⁄3 maximal cliques, and the worst-case running time of the Bron–Kerbosch algorithm (with a pivot strategy) is O(3^n⁄3).

Sadanand Vishwas Sadanand Vishwas
OpenGenus IQ © 2025 All rights reserved ™
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship