Adding time and space complexities

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_01.java

@@ -31,8 +31,8 @@ public class Problem_01 {
 	 * if it doesn't appear then set the flag to true. 
 	 * If it appears, return false.
 	 * 
-	 * Time Complexity : O(n) - Because if there are n characters, we will loop n times 
-	 * Space Complexity : O(n) 
+	 * Time Complexity : O(n) 
+	 * Space Complexity : O(1) 
 	 * 
 	 * @param iWord
 	 * @return {@link boolean}

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_02.java

@@ -24,6 +24,9 @@ public class Problem_02 {
 	 * Method to check if two given strings are valid 
 	 * case sensitive permutations
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(1)
+	 * 
 	 * @param string1
 	 * @param string2
 	 * @return {@link boolean}
@@ -56,6 +59,9 @@ public static boolean isValidPermutation_CaseSensitive(String string1, String st
 	 * Method to check if two given strings are valid 
 	 * case insensitive permutations
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param string1
 	 * @param string2
 	 * @return {@link boolean}

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_03.java

@@ -25,6 +25,9 @@ public class Problem_03 {
 	 * Method to replace spaces in a string with special character's (Already given)
 	 * True length is also passed in the method
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param input
 	 * @param trueLength
 	 * @return {@link String}

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_04.java

@@ -31,6 +31,9 @@ public class Problem_04 {
 	 * - A string will be considered as a palindrome permutation, 
 	 * if it does not have more then one odd character count
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param input
 	 * @return {@link boolean}
 	 */

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_05.java

@@ -26,6 +26,9 @@ public class Problem_05 {
 	/**
 	 * Method to check if two strings are one edit away
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(1)
+	 * 
 	 * @param input1
 	 * @param input2
 	 * @return {@link boolean}

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_06.java

@@ -23,6 +23,9 @@ public class Problem_06 {
 	/**
 	 * Method to compress a string 
 	 * 
+	 * Time Complexity : O(n)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param input
 	 * @return {@link String}
 	 */

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_07.java

@@ -20,6 +20,9 @@ public class Problem_07 {
 	/**
 	 * Method to rotate a matrix by 90 degrees
 	 * 
+	 * Time Complexity : O(n^2)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param matrix
 	 * @return {@link int[][]}
 	 */
@@ -47,6 +50,9 @@ public static int[][] rotateMatrix(int[][] matrix) {
 	/**
 	 * Method to rotate a matrix in place
 	 * 
+	 * Time Complexity : O(n^2)
+	 * Space Complexity : O(1)
+	 * 
 	 * @param matrix
 	 * @return {@link int[][]}
 	 */

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_08.java

@@ -21,6 +21,9 @@ public class Problem_08 {
 	/**
 	 * Method to set zeros in rows and columns if one entry is zero
 	 * 
+	 * Time Complexity : O(n^2)
+	 * Space Complexity : O(n)
+	 * 
 	 * @param matrix
 	 * @return {@link int[][]}
 	 */

src/com/deepak/ctci/Ch01_Arrays_And_Strings/Problem_09.java

@@ -23,6 +23,9 @@ public class Problem_09 {
 	/**
 	 * Method to check if one string is a rotation of another
 	 * 
+	 * Time Complexity : O(1)
+	 * Space Complexity : O(1)
+	 * 
 	 * @param str1
 	 * @param str2
 	 * @return {@link boolean}
@@ -51,7 +54,8 @@ public static boolean isRotation(String str1, String str2) {
 	 * @return {@link boolean}
 	 */
 	private static boolean isSubString(String big, String small) {
-		if (big.toLowerCase().indexOf(small.toLowerCase()) >= 0) { /* We can use big.contains(small) as well here */
+		if (big.toLowerCase().indexOf(small.toLowerCase()) >= 0) { 
+			/* We can use big.contains(small) as well here */
 			return true;
 		}
 		return false;

src/com/deepak/ctci/Ch08_Recursion_And_Dynamic_Programming/Problem_01.java

@@ -24,6 +24,8 @@ public class Problem_01 {
 	 * Method to count number of ways to climb stairs
 	 * Note : This is a brute force method
 	 * 
+	 * Time Complexity = O(3^n) since each call results in 3 more calls
+	 * 
 	 * @param n
 	 * @return {@link int}
 	 */