From 7c102b80663aaab6c8294d5bacf7db48df2ed6c8 Mon Sep 17 00:00:00 2001 From: Ashish Bhanu Daulatabad Date: Mon, 8 Mar 2021 11:49:43 +0530 Subject: [PATCH] Re-documentation --- dynamic_programming/abbreviation.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/dynamic_programming/abbreviation.cpp b/dynamic_programming/abbreviation.cpp index 54d3fc27c..3e6ca3ba1 100644 --- a/dynamic_programming/abbreviation.cpp +++ b/dynamic_programming/abbreviation.cpp @@ -6,10 +6,10 @@ * @details * Given two strings, `a` and `b`, determine if it's possible to make `a` equal * to `b` You can perform the following operations on the string `a`: - * 1. Capitalize zero or more of a's lowercase letters. + * 1. Capitalize zero or more of `a`'s lowercase letters. * 2. Delete all of the remaining lowercase letters in `a`. * - * ##Algorithm + * ### Algorithm * The idea is in the problem statement itself: iterate through characters of * string `a` and `b` (for character indexes `i` and `j` respectively): * 1. If `a[i]` and `b[j]` are equal, then move to next position