diff --git a/dynamic_programming/partition_problem.cpp b/dynamic_programming/partition_problem.cpp
index 4991af092..f32d90ab7 100644
--- a/dynamic_programming/partition_problem.cpp
+++ b/dynamic_programming/partition_problem.cpp
@@ -4,12 +4,12 @@
  *Problem](https://en.wikipedia.org/wiki/Partition_problem )
  * @details
  * The partition problem, or number partitioning, is the task of deciding
- *whether a given multiset S of positive integers can be partitioned into two
- *subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the
- *numbers in S2. Although the partition problem is NP-complete, there is a
- *pseudo-polynomial time dynamic programming solution, and there are heuristics
- *that solve the problem in many instances, either optimally or approximately.
- *For this reason, it has been called "the easiest hard problem".
+ * whether a given multiset S of positive integers can be partitioned into two
+ * subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of the
+ * numbers in S2. Although the partition problem is NP-complete, there is a
+ * pseudo-polynomial time dynamic programming solution, and there are heuristics
+ * that solve the problem in many instances, either optimally or approximately.
+ * For this reason, it has been called "the easiest hard problem".
  *
  * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using
  * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.