darpanjbora · Mattrcarey · Oct 18, 2019 · Oct 18, 2019
diff --git a/Backtracking/AllPermutationsOfAString.java b/Backtracking/AllPermutationsOfAString.java
@@ -1,3 +1,4 @@
+package Backtracking;
 /**
  * A string of length n has n! permutation.
  */

diff --git a/Backtracking/FlightItinerary.java b/Backtracking/FlightItinerary.java
@@ -1,4 +1,4 @@
-package backtracking;
+package Backtracking;
 
 import java.util.HashSet;
 import java.util.Stack;

diff --git a/Backtracking/GraphColoring.java b/Backtracking/GraphColoring.java
@@ -1,3 +1,5 @@
+package Backtracking;
+
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Scanner;

diff --git a/Backtracking/HamiltonianPath.java b/Backtracking/HamiltonianPath.java
@@ -1,3 +1,5 @@
+package Backtracking;
+
 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.InputStreamReader;

diff --git a/Backtracking/MatPathDFS.java b/Backtracking/MatPathDFS.java
@@ -1,3 +1,5 @@
+package Backtracking;
+
 /**
         Given a MxN matrix where each element can either be 0 or 1.
         We need to find the shortest path between a given source cell to a destination cell.

diff --git a/Backtracking/NQueen.java b/Backtracking/NQueen.java
@@ -1,3 +1,5 @@
+package Backtracking;
+
 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.InputStreamReader;