Fix

README.md

@@ -2647,13 +2647,15 @@ Hi!
 
 # Problems
 
-## 1. Arrays and Strings
+## Cracking the Coding Interview: 189 Programming Questions and Solutions 6th Edition
 
-### 1.1 Is Unique: Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
+### 1. Arrays and Strings
+
+#### 1.1 Is Unique: Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
 
 <details>
 
-#### TypeScript
+##### TypeScript
 
 ```typescript
 // Is Unique: Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?
@@ -2680,11 +2682,11 @@ console.log(checkForIfStringHasUniqChars("abcdeffg")); // false
 
 </details>
 
-### 1.2 Check Permutation: Given two strings, write a method to decide if one is a permutation of the other.
+#### 1.2 Check Permutation: Given two strings, write a method to decide if one is a permutation of the other.
 
 <details>
 
-#### TypeScript
+##### TypeScript
 
 ```typescript
 // 1.2 Check Permutation: Given two strings, write a method to decide if one is a permutation of the other.
@@ -2735,11 +2737,11 @@ console.log(isAPermutations2("def", "abcdefgh")); // false
 
 </details>
 
-### 1.3 URLify: Write a method to replace all spaces in a string with '%2e: You may assume that the string has sufficient space at the end to hold the additional characters, and that you are given the "true" length of the string. (Note: if implementing in Java, please use a character array so that you can perform this operation in place.
+#### 1.3 URLify: Write a method to replace all spaces in a string with '%2e: You may assume that the string has sufficient space at the end to hold the additional characters, and that you are given the "true" length of the string. (Note: if implementing in Java, please use a character array so that you can perform this operation in place.
 
 <details>
 
-#### TypeScript
+##### TypeScript
 
 ```typescript
 // 1.3 URLify: Write a method to replace all spaces in a string with '%2e: You may assume that the string has sufficient space at the end to hold the additional characters, and that you are given the "true" length of the string. (Note: if implementing in Java, please use a character array so that you can perform this operation in place.
@@ -2762,7 +2764,7 @@ console.log(urlify(" Mr.Smith"));
 
 <details>
 
-#### TypeScript
+##### TypeScript
 
 ```typescript
 // 1.4 Palindrome Permutation: Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.
@@ -2800,7 +2802,9 @@ console.log(isPermutationOfPolindrom1("abca")); // false
 
 </details>
 
-## Fibonacci
+## Other
+
+### Fibonacci
 
 Print n-th Fibonacci Number.