Updated solution link

kanahaiya · kanahaiya · commit 5e8d7c55b3c4 · 2018-04-23T20:57:24.000+05:30
diff --git a/README.md b/README.md
@@ -17,9 +17,9 @@ Coding environment used- Windows 8.1, Eclipse Oxygen, JAVA 8
 |    #    |   		Tags  		|                                                                        Title                                                                          									|                                                                                                           Solution                                                                                                                                                        |  Difficulty    |
 |:-------:|:-------------------:|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------:|:--------------:|
 |   747   |  	  Array  		| [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/description)                          									| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/LargestNumberAtLeastTwiceofOthers.java)                                           	                  	    |   Easy		 |
-|   746   |  	  Array  		| [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)                          																	| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/MinCostClimbingStairs.java)                                                       					      	|   Easy		 |
-|   121   |  	  Array  		| [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)             				            									| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/BestTimeToBuyAndSellStock.java)                                                   					        |   Easy		 |
-|    53   |  	  Array  		| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/)                          																					| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/MaximumSubarray.java)                                                             						    |   Easy		 |
+|   746   |  	  Array  		| [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)                          																	| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MinCostClimbingStairs.java)                                                       					      		|   Easy		 |
+|   121   |  	  Array  		| [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)             				            									| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/BestTimeToBuyAndSellStock.java)                                                   					       		|   Easy		 |
+|    53   |  	  Array  		| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/description/)                          																					| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/dp/MaximumSubarray.java)                                                             						   		|   Easy		 |
 |   561   |  	  Array  		| [Array Partition I](https://leetcode.com/problems/array-partition-i/description/)                          																				| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/ArrayPartitionI.java)                                                             						    |   Easy		 |
 |    55   |  	  Array  		| [Jump Game](https://leetcode.com/problems/jump-game/description/)                           																								| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/MediumLevelSolutions/src/main/java/com/javaaid/solutions/medium/arrays/JumpGame.java)                                                                  						|	Medium		 |
 |    45   |  	  Array  		| [Jump Game II](https://leetcode.com/problems/jump-game-ii/description/)                          																							| [Solution.java](https://github.com/Java-aid/LeetCodeSolutions/blob/master/LeetCodeSolutions/HardLevelSolutions/src/main/java/com/javaaid/solutions/hard/arrays/JumpGameII.java)                                                                  					  		|   Hard		 |
