## Given 2 numbers a and b find the smallest number greater than b by interchanging the digits of a and if not possible print -1

Problem I have made the solution for this question it is based on backtracking. Can anyone suggest me how to […]

## Partition array into 2 sets, such that different of sums in both subsets is minimal

Problem Given a set of n2 n2 sizes each such that the difference of the sum of two subsets is […]

## N Queens in Python

Problem I used Python very occasionally, today I solved n queens in Python just for fun. I am sure there […]

## Given 2 numbers a and b find the smallest number greater than b by interchanging the digits of a and if not possible print -1

Problem I have made the solution for this question it is based on backtracking. Can anyone suggest me how to […]

## Haskell Sudoku solver using bactracking

Problem This solves Sudoku by using backtracking. Accepts one grid where 0 represents a missing number. Here are some examples: […]

## Improved Backtracking with nqueen

Problem I am implementing conflict-based backjumping with nqueen. I want to optimize my code especially in recursive call. In short,backjumping […]

## Puzzle game solver via Backtracking

Problem I’m relatively new to Haskell and I’d like to get feedback on the style of my program. Specifically: Coding […]

## n-Queens backtracking code

Problem I was learning backtracking algorithms earlier today, and was excited and wrote this code for n-Queens problem. Being my […]

## Sudoku solutions finder using brute force and backtracking

Problem I’m calculating all possible solutions for a given Sudoku board with at least 17 values. My approach is a […]

## Solving a sudoku with backtracking

Problem I wrote this java Class to solve a standard 9×9 sudoku board. It uses backtracking to solve each field […]