Update README.md

Author: 17tanya

README.md

@@ -12,13 +12,16 @@ This repository contains solutions to coding problems based on Data Structures a
   - [Length of Longest Increasing Subsequence](DynamicProgramming/LongestIncreasingSubsequence/Length_Of_Longest_Increasing_Subsequence.java)
   - [Print Longest Increasing Subsequence](DynamicProgramming/LongestIncreasingSubsequence/Find_Longest_Increasing_Subsequence.java)
   - [Length Of Longest Palindromic Subsequence](DynamicProgramming/LongestPalindromicSubsequence/LengthOfLongestPalindromicSubseq.java)
+  - [Length of Longest Bitonic Subsequence](DynamicProgramming/LongestBitonicSubsequence/LengthOfLongestBitonicSubsequence.java)
+  - [Print Longest Bitonic Subsequence](DynamicProgramming/LongestBitonicSubsequence/PrintLongestBitonicSubsequence.java)
   - [Longest Path in a Matrix With Given Constraints](DynamicProgramming/LongestPathInMatrixconstraints/LongestPathInMatrixWithConstraints.java)
   - [Matrix Chain Multiplication](DynamicProgramming/MatrixChainMultiplication/MatrixChainMultiplication.java)
   - [Minimum Sum Partition](DynamicProgramming/MinimumSumPartition/MinimumSumPartition.java)
   - [Optimal Stratergy For a Game](DynamicProgramming/OptimalStratergyForGame/Optimal_Stratergy_For_Game.java)
   - [Partition Problem](DynamicProgramming/PartitionProblem/PartitionProblem[ReturnBoolean].java)
   - [Length of Shortest Common Supersequence](DynamicProgramming/ShortestCommonSupersequence/LengthOfShortestCommonSupersequence.java)
   - [Print Shortest Common Supersequence](DynamicProgramming/ShortestCommonSupersequence/PrintShortestCommonSupersequence.java)
+  - [Longest Repeated Subsequence](DynamicProgramming/LongestRepeatedSubsequenceProblem.java)
   - [Subset Sum Problem](DynamicProgramming/SubsetSumProblem/SubsetSumProblem.java)
   - [Word Break Problem - Return Boolean](DynamicProgramming/WordBreakProblem/WordBreakBoolean.java)
   - [Word Break Problem - Print all Possible Word Breaks - Recursion](DynamicProgramming/WordBreakProblem/WordBreakPrintWords.java)
@@ -39,6 +42,15 @@ This repository contains solutions to coding problems based on Data Structures a
   - [Minimum Cost to Reach Last Cell from the First Cell of a Matrix](DynamicProgramming/MinCostToReachLastCellFromFirstCellMatrix.java)
   - [Rod Cutting Problem](DynamicProgramming/RodCuttingProblem.java)
   - [String Interleaving](DynamicProgramming/StringInterleaving.java)
+  - [Maximum Sum Increasing Subsequence - Return Max Sum](DynamicProgramming/MaximumSumIncreasingSubsequence/MaxSumIncreasingSubseq.java)
+  - [Print Maximum Sum Increasing Subsequence](DynamicProgramming/MaximumSumIncreasingSubsequence/PrintMaxSumIncreasingSubseq.java)
+  - [Sum of all Elements in a Sub-Matrix - Constant Time](DynamicProgramming/SumOfElementsInASubMatrixConstantTime/SumOfAllElementsInASubMatrixInConstantTime.java)
+  - [Maximum Sum Subsequence Non Adjacent](DynamicProgramming/MaximumSumOfSubseqNonAdjacent.java)
+  - [Maximum Sum Rectangular Sub Matrix](DynamicProgramming/MaximumSumRectangularSubMatrix.java)
+  - [Maximum Sum Submatrix In a Given Matrix](DynamicProgramming/MaximumSumSubMatrixInAGivenMatrix.java)
+  - [Minimum Cuts For Palindromic Partition](DynamicProgramming/MinimumCutsForPalindromicPartition.java)
+  - [Wild Card Matching](DynamicProgramming/WildCardMatching.java)
+  
 ## :pushpin: Graphs, DFS & BFS
   - [Leetcode 547. Friend Circles](GraphsDFS&BFS/Friend_Circles.java)
   - [Leetcode 200. Number of Islands](GraphsDFS&BFS/Number_of_Islands.java)