Added readme for dp problems and updated main readme

Author: jeevanshu

DP/Egg Dropping Puzzle/README.md

@@ -0,0 +1,7 @@
+Suppose there is a building with n floors, if we have m eggs, then how can we find the minimum number of drops needed to find a floor from which it is safe to drop an egg without breaking it.
+
+There some important points to remember:
+
+    When an egg does not break from a given floor, then it will not break for any 		lower floor also.
+    If an egg breaks from a given floor, then it will break for all upper floors.
+    When an egg breaks, it must be discarded, otherwise, we can use it again.

DP/Tiling Problem/README.md

@@ -0,0 +1,38 @@
+Problem:
+You are given a grid of size n×2 and n tiles of size 2×1. In how many different ways can you tile the grid such that the entire grid is covered and no tiles overlap. (The tiles look identical to each other. Two ways of tiling are different based on whether the tiles are placed horizontally or vertically). 
+
+Example: There are 3 possible ways of tiling a 3×2 grid.
+
+Tiling 1: 
+
+Three vertical tiles
+
+ __ __ __
+
+|  |  |  |
+
+|__|__|__|
+
+ 
+
+Tiling 2: 
+
+1 vertical tile, followed by 2 horizontal tiles
+
+ __ _____ 
+
+|  |_____|
+
+|__|_____|
+
+ 
+
+Tiling 3: 
+
+2 horizontal tiles, followed by 1 vertical tile
+
+ _____ __
+
+|_____|  |
+
+|_____|__|

README.md

@@ -60,6 +60,7 @@ ACM-ICPC Algorithms is a collection of important algorithms and data structures
    * [Coin Change](/DP/Coin%20Change%20Problem)
    * [Collect Maximum Points](/DP/Collect_Max_Points)
    * [Edit Distance](/DP/EditDistance)
+   * [Egg Droping Puzzle](/DP/Egg%20Droping%20Puzzle)
    * [Fibonacci Series](/DP/Fibonacci)
    * [Floyd Warshall Algorithm](/DP/Floyd%20Warshall%20Algorithm)
    * [Game Of Sum](/DP/game_of_sum)
@@ -78,6 +79,7 @@ ACM-ICPC Algorithms is a collection of important algorithms and data structures
    * [Shortest Uncommon Subsequence](/DP/ShortestUncommonSubsequence)
    * [Subset Sum](/DP/subset%20sum%20problem)
    * [Longest Bitonic SubSequence](/DP/LongestBitonicSubseq)
+   * [Tiling Problem](/DP/Tiling%20Problem)
 * [Graph Algorithms](/Graph)
    * [Articulation Points](/Graph/Articulation_points)
    * [Bellman Ford SSSP](/Graph/BellmanFordSSSP)
@@ -165,6 +167,7 @@ ACM-ICPC Algorithms is a collection of important algorithms and data structures
    * [Linear Search](/Search/LinearSearch)
    * [Ternary Search](/Search/TernarySearch)
    * [Interpolation Search](/Search/InterpolationSearch)
+   * [Exponential Search](/DP/ExponentialSearch)
 * [Sorting Algorithms](/Sorting)
    * [BogoSort](/Sorting/BogoSort)
    * [Bubble Sort](/Sorting/Bubble%20Sort)