* @author MadhavBahl * @date 03/01/2018 * Referance: https://en.wikipedia.org/wiki/Longest_common_substring_problem

* @author MadhavBahl * @date 31/12/2018

Using STL

string reverse : Part A

function to reverse the string.

* @author MadhavBahl * @date 18/01/2019 * Method - Bruteforce Search - Time complexity = O(m.n.p) // m, n, and p are the lengths of 3 input arrays

* @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count

* @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count (object)

* @author MadhavBahl * @date 18/01/2019 * Method - Brute force Search

* @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.indexOf() method

* @author MadhavBahl * @date 04/01/2018 * In this case, the worst case Time Complexity will be O(m.n), * m and n are the lengths of string and pat

* @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.search() method

* @author MadhavBahl * @date 08/01/2018

* METHOD -- Backtracking * Algorithm taken from GeeksForGeeks (https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-s

* @source Geeks4Geeks: https://www.geeksforgeeks.org/c-program-for-tower-of-hanoi/ * Implementaed in JavaScript by @MadhavBahl * @date 10/01/2019

KMP Algorithm

* @author MadhavBahl * @date 27/12/2018 * A simple method which first compares the lengths of strings and then iterates through the characters of an

* @author MadhavBahl * @date 27/12/2018 * METHOD -- Prepare 2 objects which stores frequency of every character in both strings, compare those 2 obj

* @author MadhavBahl * @date 27/12/2018 * METHOD -- Check the lengths of both strings, sort them and then check whether they are same

Iterative Approach

Recursive Approach

palindrome check : Part B

function that checks the string is palindrome or not.