* @author MadhavBahl * @date 28/12/2018 * METHOD - Consider the 3 cases separately, * 1) If difference in lengths is more than 1 then print no a

* @author MadhavBahl * @date 08/01/2018 * METHOD - We keep thte second argument (num2) positive and add the first arguement num2(second arg) times

* @author MadhavBahl * @date 01/01/2019 * METHOD (Using Array) * - Initalize an empty array `strArr` that will store all the substrings that contai

* Spiral Matrix Generation * @author MadhavBahl * @date 24/01/2019

* @author MadhavBahl * @date 15/01/2018 * Method: Use nested loop to generate the 2D matrix

* @author MadhavBahl * @date 22/01/2019 * Method - Circular Search -- Time = O(n)

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

* @author MadhavBahl * @date 16/01/2019 * Method -- Multiple Pointers, solution in O(n)

* @author MadhavBahl * @date 17/01/2019 * Method used -- bruteforce search (Iteration using nested loops)

@desc: splits the array into two sections at each step, then checks the element in the desired one. * @param: array , key (to be found), size of the

* @author MadhavBahl * @date 14/01/2019 * Using frequency counter

* @author MadhavBahl * @date 14/01/2019 * Using Brute Force Search

* @author MadhavBahl * @date 14/01/2019 * Count uniques using multiple pointers (since the input array is sorted)

* @author MadhavBahl * @date 14/01/2019 * Count Uniques using frequency object

* @author MadhavBahl * @date 14/01/2019 * Count Uniques using brute force search

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

@desc: compares the key with each array elements. * @param: array , key (to be found), size of the array. * @return: index of key if present , -1