polishing v1

ProRasel · ProRasel · commit bf86b7c947ef · 2019-10-16T19:53:45.000+06:00
diff --git a/Harder/Generate-Sentences.md b/Harder/Generate-Sentences.md
@@ -26,3 +26,8 @@ It's simple...Just run three for loops for three lists you have, each one under
 Damn easy, isn't it?
 
 
+&nbsp;
+[![Next Page](assets/next-button.png)](..README.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Harder/Password-generator.md b/Harder/Password-generator.md
@@ -49,3 +49,10 @@ print('Your new password: ', new_password)
 The solution is rather simple. We imported the random module and the string module. Then we created a long string by joining all ascii_letters, digits and special characters.
 
 For that, we ran a for loop. In the loop, we select a random letter from the all_chars. To select a random character, we used random.choice. Then we add the random character to the password. 
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Password-with-requirements.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Harder/Password-with-requirements.md b/Harder/Password-with-requirements.md
@@ -53,3 +53,9 @@ Make sense?
 
 Keep going. Only a few more left. I am sure you can do it 
 
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Permutations.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Harder/Permutations.md b/Harder/Permutations.md
@@ -89,4 +89,11 @@ That’s why we put current in a list as well so that it becomes a list as well.
 
 This will create [3, 2, 1]. That’s why we did [current] + p  to make the final permutation. 
 
-This code is harder. It will take a few practices to become comfortable with it.
+This code is harder. It will take a few practices to become comfortable with it.
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Generate-Sentences.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Harder/Simple-Calculator.md b/Harder/Simple-Calculator.md
@@ -63,3 +63,8 @@ Then we have if-elif-else. And based on the operation, we call the right method
 That’s it. 
 
 
+&nbsp;
+[![Next Page](assets/next-button.png)](Password-generator.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Medium/Armstrong-number.md b/Medium/Armstrong-number.md
@@ -78,3 +78,10 @@ return result
 ```
 
 
+&nbsp;
+[![Next Page](../assets/next-button.png)](Greatest-common-divisor.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
+
diff --git a/Medium/Check-palindrome.md b/Medium/Check-palindrome.md
@@ -36,3 +36,10 @@ The problem might sound complicated at the beginning. However, if you know the t
 
 So, the more you explore, the more you try, the more shortcut trick you will master.
 
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](Dictionary-of-cubes.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Medium/Dictionary-of-cubes.md b/Medium/Dictionary-of-cubes.md
@@ -48,4 +48,10 @@ print('Your sum of cubes are: ', sum)
 ## Take Away
 Sum of a series might have an easier formula.
 
+&nbsp;
+[![Next Page](../assets/next-button.png)](Armstrong-number.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
 
diff --git a/Medium/Greatest-common-divisor.md b/Medium/Greatest-common-divisor.md
@@ -69,4 +69,14 @@ b = int(input("Enter second number:"))
 
 gcd = math.gcd(a,b)
 print(gcd)
-```
+```
+
+
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](Least-Common-Multiple.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
+
diff --git a/Medium/Least-Common-Multiple.md b/Medium/Least-Common-Multiple.md
@@ -44,3 +44,12 @@ In the while loop, if we can not divide the lcm by the first number or the secon
 That's it. 
 
 It's actually much easier than it seems. 
+
+
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](README.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Prime-number/Check-Prime.md b/Prime-number/Check-Prime.md
@@ -56,7 +56,7 @@ There are other solutions to this problem as well. We encourage you to google, 
 A prime number is only divisible by 1 and the number itself. 
 
 &nbsp;
-[![Next Page](../assets/next-button.png)](..README.md)
+[![Next Page](../assets/next-button.png)](Prime-Numbers.md)
 &nbsp;
 
 ###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Prime-number/Prime-Factors.md b/Prime-number/Prime-Factors.md
@@ -42,3 +42,8 @@ print(factors)
 ## take Away
 Prime factor is a prime number that divides the provided number. 
 
+&nbsp;
+[![Next Page](../assets/next-button.png)](Smallest-prime- factor.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Prime-number/Prime-Numbers.md b/Prime-number/Prime-Numbers.md
@@ -41,3 +41,9 @@ Inside the loop, call the is_prime function and check the return. If the return
 Then return the primes list. 
 
 That’s it.
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](Prime-Factors.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Prime-number/Smallest-prime- factor.md b/Prime-number/Smallest-prime- factor.md
@@ -25,3 +25,10 @@ print('The smallest prime factor is: ', smallest_factor)
 Since we need only one factor. We can do it more easily. 
 
 Just run a while loop. The condition of the loop is checking the remainder. If there is no remainder, the number got divided and you got the prime factor. If the remainder is not 0, then increase the factor by one.  
+
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](..READMD.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Reverse/Reverse-Number.md b/Reverse/Reverse-Number.md
@@ -53,3 +53,9 @@ Finally, set the new value of the num by dividing by 10.
 
 That’s it. 
 
+&nbsp;
+[![Next Page](../assets/next-button.png)](Reverse-word.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Reverse/Reverse-String-(recursive).md b/Reverse/Reverse-String-(recursive).md
@@ -93,3 +93,10 @@ How would you slide a string and get the first five characters?
 You can slice a string to get a part of the string. 
  
 
+ 
+&nbsp;
+[![Next Page](../assets/next-button.png)](Reverse-Number.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Reverse/Reverse-String-(stack).md b/Reverse/Reverse-String-(stack).md
@@ -0,0 +1,57 @@
+# 8.2 Reverse a string (stack)
+
+## The Problem 
+Reverse a string using a stack.
+
+## Hint
+This is a little fancier way to reverse the string. However, this will help you understand one concept called stack. 
+
+If you are not familiar with the stack. Don’t worry. We have it covered in the Data Structure galaxy. 
+
+For now, just remember, you have to use .pop() method to get the last element of the list. 
+
+## Solution
+```python
+def reverse_stack(str):
+  # Create an empty stack (list to use as stack)
+  stack = []
+   # Push all characters of string to stack
+  for char in str:
+      stack.append(char)
+  # Pop all characters of string
+  # and add it to the rev
+  rev = ''
+  while len(stack) > 0:
+       last = stack.pop()
+       rev = rev + last
+       # print(last, rev)
+       
+  return rev
+usr_str = input('What is your string:')
+reverse = reverse_stack(usr_str)
+print('Reversed is: ', reverse)
+```
+
+**[Try it on Programming Hero](https://play.google.com/store/apps/details?id=com.learnprogramming.codecamp)**
+
+## Explanation
+In the function, we declared a list named stack. And then we loop through the input string and put every character of the string inside the list. 
+
+Then we have an empty string. 
+
+Later we ran a while loop. Inside the while loop, we used the .pop() method to get the last element of the list. 
+
+Then we added the last element to the reverse string. 
+
+The overall idea is very simple, take the last element and add keep adding it. 
+
+Hence, the last element will come first and you will put it in the first position. And then, in the next iteration, the second to the last element will be coming and will get added. 
+
+If needed, add a print command to see how it works.
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](Reverse-String-(recursive).md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Reverse/Reverse-String.md b/Reverse/Reverse-String.md
@@ -116,3 +116,9 @@ Will you be able to append, remove or set a character to string by the index?
 ## take Away
 A string is an immutable ordered sequence. 
 
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](Reverse-String-(stack).md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Reverse/Reverse-word.md b/Reverse/Reverse-word.md
@@ -109,3 +109,11 @@ print(rev)
 ## take Away
 The split method breaks string into elements of a list.
 
+
+
+&nbsp;
+[![Next Page](../assets/next-button.png)](..README.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
+
diff --git a/Simple-Game/Cows-and-bulls(4digits).md b/Simple-Game/Cows-and-bulls(4digits).md
@@ -56,3 +56,8 @@ However, solving this one by using if-else that we did for 2 digit bulls and cow
 That's why we created the get_bulls_cows function. Inside that, we created a loop. For each digit, check the digit in the same place. 
 
 
+&nbsp;
+[![Next Page](assets/next-button.png)](Word-completion.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Simple-Game/Cows-and-bulls.md b/Simple-Game/Cows-and-bulls.md
@@ -90,3 +90,10 @@ In summary, bulls are guessed digit matches for the same position in the secret
 Then we display the bulls and cows. 
 
 Finally, if there is no remaining try (remaining try < 1), print that user lost.
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Cows-and-bulls(4digits).md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Simple-Game/Guess-game.md b/Simple-Game/Guess-game.md
@@ -65,3 +65,10 @@ After that, we use the int to convert the user input to an integer number. We di
 That’s why we put the int after the check for q. 
 
 The bottom part of the code should be easier for you.
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Rock-paper-scissor.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Simple-Game/Rock-paper-scissor.md b/Simple-Game/Rock-paper-scissor.md
@@ -52,3 +52,11 @@ We repeated this two more times. And checked whether the first player entered pa
 Now think for 5 minutes, is there any different way you could have written the if-else logic here. 
 
 If you find a way, add a question here so that everyone can see your code.
+
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Cows-and-bulls.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Simple-Game/Word-completion.md b/Simple-Game/Word-completion.md
@@ -101,3 +101,8 @@ The answer is: 3
 ```
 
 
+&nbsp;
+[![Next Page](assets/next-button.png)](Word-hangman.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Simple-Game/Word-hangman.md b/Simple-Game/Word-hangman.md
@@ -62,4 +62,10 @@ Reading other’s code and trying to understand will be a common activity for a
 
 So, practice it here. 
 
-If you don't understand any line, feel free to ask us a question. 
+If you don't understand any line, feel free to ask us a question. 
+
+&nbsp;
+[![Next Page](assets/next-button.png)](..README.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/Solution-Strategy.md b/Solution-Strategy.md
@@ -41,7 +41,7 @@ There is just one way to become good at problem-solving - Just solve more proble
 Keep solving more problems. 
 
 &nbsp;
-[![Next Page](assets/next-button.png)](README.md)
+[![Next Page](assets/next-button.png)](Prime-Numbers.md)
 &nbsp;
 
 ###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/User-Submitted/Birthday-remaining.md b/User-Submitted/Birthday-remaining.md
@@ -88,3 +88,10 @@ At last, we calculate the difference.
 That’s a pretty simple way to get the days remaining for your next birthday.
 
 Isn’t it cool? 
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](Calculate-age.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/User-Submitted/Calculate-age.md b/User-Submitted/Calculate-age.md
@@ -43,3 +43,11 @@ print("Your age: ", age)
 You used the datetime earlier. And then, calculated the days between the birth date and today’s date. 
 
 Then, divide the days by 365 to get the age!
+
+
+
+&nbsp;
+[![Next Page](assets/next-button.png)](README.md)
+&nbsp;
+
+###### tags: `programmig-hero` `python` `float` `int` `math`
diff --git a/User-Submitted/Simple-Clock.md b/User-Submitted/Simple-Clock.md
@@ -125,7 +125,8 @@ Similarly, if the minute becomes 60, we add 1 hour and set minutes to 0, because
 Finally, if the hour is 24, we reset the hour to 0. Because, in a digital clock, there are no 24 or 25 hours. After 23 hours, it becomes 0 hours again (the midnight!) 
 
 
+&nbsp;
+[![Next Page](assets/next-button.png)](Birthday-remaining.md)
+&nbsp;
 
- 
-
-
+###### tags: `programmig-hero` `python` `float` `int` `math`
