diff --git a/.all-contributorsrc b/.all-contributorsrc index 4342ac5d..2e115f67 100644 --- a/.all-contributorsrc +++ b/.all-contributorsrc @@ -10,7 +10,7 @@ "commit": true, "contributors": [ { - "login": "MadhavBahlMD", + "login": "MadhavBahl", "name": "MADHAV BAHL", "avatar_url": "https://avatars2.githubusercontent.com/u/26179770?v=4", "profile": "http://madhavbahl.tech/", @@ -328,6 +328,15 @@ "doc", "code" ] + }, + { + "login": "mihirg008", + "name": "Mihir Gupta", + "avatar_url": "https://avatars3.githubusercontent.com/u/32246337?s=460&u=26abf142607d487660a12fcc8b508407b0896c8c&v=4", + "profile": "https://github.com/mihirg008", + "contributions": [ + "doc" + ] } ], "commitConvention": "none" diff --git a/BONUS/Arrays/CheckIdentity/CheckIdentity.java b/BONUS/Arrays/CheckIdentity/CheckIdentity.java index 77fa1c51..bb3e0794 100644 --- a/BONUS/Arrays/CheckIdentity/CheckIdentity.java +++ b/BONUS/Arrays/CheckIdentity/CheckIdentity.java @@ -1,6 +1,6 @@ /** * Check Identity Matrix - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Arrays/CheckIdentity/README.md b/BONUS/Arrays/CheckIdentity/README.md index 658844f5..15a460f9 100644 --- a/BONUS/Arrays/CheckIdentity/README.md +++ b/BONUS/Arrays/CheckIdentity/README.md @@ -9,7 +9,7 @@ WAP to find whether the given NxN matix is an identity matrix ```java /** * Check Identity Matrix - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Arrays/Reverse/README.md b/BONUS/Arrays/Reverse/README.md index 939db11a..10cabd59 100644 --- a/BONUS/Arrays/Reverse/README.md +++ b/BONUS/Arrays/Reverse/README.md @@ -9,7 +9,7 @@ WAP to reverse the given array ```java /** * Array Reversal - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Arrays/Reverse/Reverse.java b/BONUS/Arrays/Reverse/Reverse.java index a11d3025..bb3b1030 100644 --- a/BONUS/Arrays/Reverse/Reverse.java +++ b/BONUS/Arrays/Reverse/Reverse.java @@ -1,6 +1,6 @@ /** * Array Reversal - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/CircleArea/CircleArea.java b/BONUS/Misc/CircleArea/CircleArea.java index 08a6285c..71c7b91a 100644 --- a/BONUS/Misc/CircleArea/CircleArea.java +++ b/BONUS/Misc/CircleArea/CircleArea.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 25/01/2019 */ diff --git a/BONUS/Misc/CircleArea/README.md b/BONUS/Misc/CircleArea/README.md index e6830a95..f7348618 100644 --- a/BONUS/Misc/CircleArea/README.md +++ b/BONUS/Misc/CircleArea/README.md @@ -8,7 +8,7 @@ WAP to read the radius and print the area of a circle ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 25/01/2019 */ diff --git a/BONUS/Misc/LeapYear/LeapYear.java b/BONUS/Misc/LeapYear/LeapYear.java index 97f489e4..64d2309e 100644 --- a/BONUS/Misc/LeapYear/LeapYear.java +++ b/BONUS/Misc/LeapYear/LeapYear.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/LeapYear/README.md b/BONUS/Misc/LeapYear/README.md index 45df2f89..9d5e1eab 100644 --- a/BONUS/Misc/LeapYear/README.md +++ b/BONUS/Misc/LeapYear/README.md @@ -8,7 +8,7 @@ WAP to check whether the given year is a leap year or not ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/NaturalSum/NaturalSum.java b/BONUS/Misc/NaturalSum/NaturalSum.java index 92aebf27..434d6e6b 100644 --- a/BONUS/Misc/NaturalSum/NaturalSum.java +++ b/BONUS/Misc/NaturalSum/NaturalSum.java @@ -1,6 +1,6 @@ /** * Natural Sum using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/NaturalSum/README.md b/BONUS/Misc/NaturalSum/README.md index 16301b56..6ab6a733 100644 --- a/BONUS/Misc/NaturalSum/README.md +++ b/BONUS/Misc/NaturalSum/README.md @@ -9,7 +9,7 @@ WAP to sum first `n` natural numbers ```java /** * Natural Sum using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/OddEve/OddEven.java b/BONUS/Misc/OddEve/OddEven.java index 6d071b65..bf15e940 100644 --- a/BONUS/Misc/OddEve/OddEven.java +++ b/BONUS/Misc/OddEve/OddEven.java @@ -1,7 +1,7 @@ import java.util.Scanner; /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 25/01/2019 */ diff --git a/BONUS/Misc/OddEve/README.md b/BONUS/Misc/OddEve/README.md index 53f26c7b..9b6cfb4a 100644 --- a/BONUS/Misc/OddEve/README.md +++ b/BONUS/Misc/OddEve/README.md @@ -10,7 +10,7 @@ Give a number, write a program to check whether it is odd or even import java.util.Scanner; /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 25/01/2019 */ diff --git a/BONUS/Misc/Reverse/Reverse.java b/BONUS/Misc/Reverse/Reverse.java index 026dd93a..2417e6c7 100644 --- a/BONUS/Misc/Reverse/Reverse.java +++ b/BONUS/Misc/Reverse/Reverse.java @@ -1,6 +1,6 @@ /** * Reverse Array - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Misc/SumSquares/SumSquares.java b/BONUS/Misc/SumSquares/SumSquares.java index 28f94e3a..33ef7fde 100644 --- a/BONUS/Misc/SumSquares/SumSquares.java +++ b/BONUS/Misc/SumSquares/SumSquares.java @@ -1,6 +1,6 @@ /** * Sum of squares - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/README.md b/BONUS/README.md index bc389884..3906c195 100644 --- a/BONUS/README.md +++ b/BONUS/README.md @@ -1,6 +1,6 @@ # Bonus Problems -A real coder should not be satisfied by doing only one problem daily, rather he/she should keep coding as much as possible. So, here I ([@MadhavBahlMD](https://github.com/MadhavBahlMD)) am adding some more problems that you can practise 😃 +A real coder should not be satisfied by doing only one problem daily, rather he/she should keep coding as much as possible. So, here I ([@MadhavBahl](https://github.com/MadhavBahl)) am adding some more problems that you can practise 😃 Also, these problems have been taking form various sources, so ig you think you own any of the given problems, just send me an email at theleanprogrammer@gmail.com and I will be more than happy to give proper credits 😊 diff --git a/BONUS/Recursion/ArrayProduct/ArrayProd.java b/BONUS/Recursion/ArrayProduct/ArrayProd.java index b1036006..0191adc3 100644 --- a/BONUS/Recursion/ArrayProduct/ArrayProd.java +++ b/BONUS/Recursion/ArrayProduct/ArrayProd.java @@ -1,6 +1,6 @@ /** * Product of array elements using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ArrayProduct/README.md b/BONUS/Recursion/ArrayProduct/README.md index e449eb23..c1b046b2 100644 --- a/BONUS/Recursion/ArrayProduct/README.md +++ b/BONUS/Recursion/ArrayProduct/README.md @@ -16,7 +16,7 @@ output: 120 ```js /** * Find Product of array elements - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ @@ -34,7 +34,7 @@ console.log ('Product of elements of [2, 3, 4, 5] is: ', findProduct (arr, arr.l ```java /** * Product of array elements using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ArrayProduct/arrayProd.js b/BONUS/Recursion/ArrayProduct/arrayProd.js index 8d26c37a..dd3a0bf5 100644 --- a/BONUS/Recursion/ArrayProduct/arrayProd.js +++ b/BONUS/Recursion/ArrayProduct/arrayProd.js @@ -1,6 +1,6 @@ /** * Find Product of array elements - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ArraySum/ArraySum.java b/BONUS/Recursion/ArraySum/ArraySum.java index 58b3fdbd..bcddb073 100644 --- a/BONUS/Recursion/ArraySum/ArraySum.java +++ b/BONUS/Recursion/ArraySum/ArraySum.java @@ -2,7 +2,7 @@ /** * Recursive Array Sum - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ArraySum/README.md b/BONUS/Recursion/ArraySum/README.md index b03581a5..1c15d0a5 100644 --- a/BONUS/Recursion/ArraySum/README.md +++ b/BONUS/Recursion/ArraySum/README.md @@ -15,7 +15,7 @@ output: 15 ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Array Elements Sum using Recursion */ @@ -36,7 +36,7 @@ import java.util.Scanner; /** * Recursive Array Sum - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ArraySum/arraySum.js b/BONUS/Recursion/ArraySum/arraySum.js index 03a89a7e..ba3ffaa2 100644 --- a/BONUS/Recursion/ArraySum/arraySum.js +++ b/BONUS/Recursion/ArraySum/arraySum.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Array Elements Sum using Recursion */ diff --git a/BONUS/Recursion/Fibonacci/Fibonacci.java b/BONUS/Recursion/Fibonacci/Fibonacci.java index 01b4847a..a3cfc771 100644 --- a/BONUS/Recursion/Fibonacci/Fibonacci.java +++ b/BONUS/Recursion/Fibonacci/Fibonacci.java @@ -2,7 +2,7 @@ /** * Nth element of fibonacci series using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Fibonacci/README.md b/BONUS/Recursion/Fibonacci/README.md index d136a66d..37cf7dd1 100644 --- a/BONUS/Recursion/Fibonacci/README.md +++ b/BONUS/Recursion/Fibonacci/README.md @@ -19,7 +19,7 @@ output: 13 ```js /** * Fibonacci Series Using Recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ @@ -38,7 +38,7 @@ import java.util.Scanner; /** * Nth element of fibonacci series using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Fibonacci/fibonacci.js b/BONUS/Recursion/Fibonacci/fibonacci.js index a59d1721..56d45053 100644 --- a/BONUS/Recursion/Fibonacci/fibonacci.js +++ b/BONUS/Recursion/Fibonacci/fibonacci.js @@ -1,6 +1,6 @@ /** * Fibonacci Series Using Recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/NaturalSum/NaturalSum.java b/BONUS/Recursion/NaturalSum/NaturalSum.java index 92aebf27..434d6e6b 100644 --- a/BONUS/Recursion/NaturalSum/NaturalSum.java +++ b/BONUS/Recursion/NaturalSum/NaturalSum.java @@ -1,6 +1,6 @@ /** * Natural Sum using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Recursion/NaturalSum/README.md b/BONUS/Recursion/NaturalSum/README.md index 16301b56..6ab6a733 100644 --- a/BONUS/Recursion/NaturalSum/README.md +++ b/BONUS/Recursion/NaturalSum/README.md @@ -9,7 +9,7 @@ WAP to sum first `n` natural numbers ```java /** * Natural Sum using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Recursion/Power/Power.java b/BONUS/Recursion/Power/Power.java index e72698cc..aa3a2cb3 100644 --- a/BONUS/Recursion/Power/Power.java +++ b/BONUS/Recursion/Power/Power.java @@ -1,5 +1,5 @@ /** - * @author @MadhavBahlMD + * @author @MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Power/README.md b/BONUS/Recursion/Power/README.md index d94b9ff6..cc527a3c 100644 --- a/BONUS/Recursion/Power/README.md +++ b/BONUS/Recursion/Power/README.md @@ -15,7 +15,7 @@ output: 100 ```java /** - * @author @MadhavBahlMD + * @author @MadhavBahl * @date 18/01/2019 */ @@ -50,7 +50,7 @@ public class Power { ```js /** * Finding `a` raised to the power `n` rercursively - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Power/power.js b/BONUS/Recursion/Power/power.js index f94f40f8..13efd916 100644 --- a/BONUS/Recursion/Power/power.js +++ b/BONUS/Recursion/Power/power.js @@ -1,6 +1,6 @@ /** * Finding `a` raised to the power `n` rercursively - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Recursion/Factorial.java b/BONUS/Recursion/Recursion/Factorial.java index 17049496..dacffdaa 100644 --- a/BONUS/Recursion/Recursion/Factorial.java +++ b/BONUS/Recursion/Recursion/Factorial.java @@ -1,6 +1,6 @@ /** * Factorial using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Recursion/README.md b/BONUS/Recursion/Recursion/README.md index 5b90c194..bbdd9173 100644 --- a/BONUS/Recursion/Recursion/README.md +++ b/BONUS/Recursion/Recursion/README.md @@ -19,7 +19,7 @@ output: 120 ```java /** * Factorial using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ @@ -50,7 +50,7 @@ public class Factorial { ```js /** * Factorial usinig recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/Recursion/factorial.js b/BONUS/Recursion/Recursion/factorial.js index 273d6b9a..77d1249f 100644 --- a/BONUS/Recursion/Recursion/factorial.js +++ b/BONUS/Recursion/Recursion/factorial.js @@ -1,6 +1,6 @@ /** * Factorial usinig recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseArray/README.md b/BONUS/Recursion/ReverseArray/README.md index e147456d..ef41d48f 100644 --- a/BONUS/Recursion/ReverseArray/README.md +++ b/BONUS/Recursion/ReverseArray/README.md @@ -17,7 +17,7 @@ output: [4, 3, 2, 1] /** * Reverse an array using recursion * Method 1 - * Implemented by MadhavBahlMD + * Implemented by MadhavBahl * @date 18/01/2019 */ @@ -35,7 +35,7 @@ console.log (reverseArray([1, 2, 3, 4])); /** * Reverse an array using recursion * Method 1 - * Implemented by MadhavBahlMD + * Implemented by MadhavBahl * @date 18/01/2019 */ @@ -62,7 +62,7 @@ import java.util.Scanner; /** * Reverse an array using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseArray/ReverseArray.java b/BONUS/Recursion/ReverseArray/ReverseArray.java index 2fd4020b..166d811d 100644 --- a/BONUS/Recursion/ReverseArray/ReverseArray.java +++ b/BONUS/Recursion/ReverseArray/ReverseArray.java @@ -2,7 +2,7 @@ /** * Reverse an array using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseArray/reverseArray.js b/BONUS/Recursion/ReverseArray/reverseArray.js index e42a2105..e87239f4 100644 --- a/BONUS/Recursion/ReverseArray/reverseArray.js +++ b/BONUS/Recursion/ReverseArray/reverseArray.js @@ -1,7 +1,7 @@ /** * Reverse an array using recursion * Method 1 - * Implemented by MadhavBahlMD + * Implemented by MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseArray/reverseArray2.js b/BONUS/Recursion/ReverseArray/reverseArray2.js index 83017f5b..7329430a 100644 --- a/BONUS/Recursion/ReverseArray/reverseArray2.js +++ b/BONUS/Recursion/ReverseArray/reverseArray2.js @@ -1,7 +1,7 @@ /** * Reverse an array using recursion * Method 1 - * Implemented by MadhavBahlMD + * Implemented by MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseString/README.md b/BONUS/Recursion/ReverseString/README.md index 83104bbf..10aca71a 100644 --- a/BONUS/Recursion/ReverseString/README.md +++ b/BONUS/Recursion/ReverseString/README.md @@ -16,7 +16,7 @@ output: dcba ```js /** * Reverse a string using recursion - * Implemented by - MadhavBahlMD + * Implemented by - MadhavBahl * @date 18/01/2019 */ @@ -33,7 +33,7 @@ console.log (reverseString ('abcd')); ```java /** * String Reversal using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseString/ReverseString.java b/BONUS/Recursion/ReverseString/ReverseString.java index 665a9189..36a8575e 100644 --- a/BONUS/Recursion/ReverseString/ReverseString.java +++ b/BONUS/Recursion/ReverseString/ReverseString.java @@ -1,6 +1,6 @@ /** * String Reversal using recursion - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/ReverseString/reverseString.js b/BONUS/Recursion/ReverseString/reverseString.js index 59049cab..53656448 100644 --- a/BONUS/Recursion/ReverseString/reverseString.js +++ b/BONUS/Recursion/ReverseString/reverseString.js @@ -1,6 +1,6 @@ /** * Reverse a string using recursion - * Implemented by - MadhavBahlMD + * Implemented by - MadhavBahl * @date 18/01/2019 */ diff --git a/BONUS/Recursion/SumSquares/SumSquares.java b/BONUS/Recursion/SumSquares/SumSquares.java index 28f94e3a..33ef7fde 100644 --- a/BONUS/Recursion/SumSquares/SumSquares.java +++ b/BONUS/Recursion/SumSquares/SumSquares.java @@ -1,6 +1,6 @@ /** * Sum of squares - * @author MadhavBahlMD + * @author MadhavBahl * @date 26/01/2019 */ diff --git a/BONUS/Strings/CountWordFrequency/CountWordFrequency.java b/BONUS/Strings/CountWordFrequency/CountWordFrequency.java index ec1902bf..1f287b02 100644 --- a/BONUS/Strings/CountWordFrequency/CountWordFrequency.java +++ b/BONUS/Strings/CountWordFrequency/CountWordFrequency.java @@ -1,6 +1,6 @@ /** * count frequency of a given word in the array - * @author MadhavbahlMD + * @author MadhavBahl * @dadte 26/01/2019 */ diff --git a/BONUS/Strings/CountWordFrequency/README.md b/BONUS/Strings/CountWordFrequency/README.md index cb59e7ec..f2f879ec 100644 --- a/BONUS/Strings/CountWordFrequency/README.md +++ b/BONUS/Strings/CountWordFrequency/README.md @@ -9,7 +9,7 @@ WAP to find the number of times a given word occurs in the sentence ```java /** * count frequency of a given word in the array - * @author MadhavbahlMD + * @author MadhavBahl * @dadte 26/01/2019 */ diff --git a/CONTRIBUTORS.md b/CONTRIBUTORS.md index 39699d08..6a068ee1 100644 --- a/CONTRIBUTORS.md +++ b/CONTRIBUTORS.md @@ -1,4 +1,4 @@ -[![All Contributors](https://img.shields.io/badge/all_contributors-31-orange.svg?style=flat-square)](#contributors) +[![All Contributors](https://img.shields.io/badge/all_contributors-32-orange.svg?style=flat-square)](#contributors) ## Contributors @@ -9,7 +9,7 @@ Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds - + @@ -49,6 +49,7 @@ Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds +

MADHAV BAHL
💻 📝 📖 🎨 ✅
MADHAV BAHL
💻 📝 📖 🎨 ✅
Rajdeep Roy Chowdhury
💻 📖 ✅
Hrishi
📖 💻
Bhanu Ailani
📖 💻
GAURAV KUMAR
📖 💻
wboccard
📖 💻
d-l-mcbride
📖 💻
mihirg008
📖
diff --git a/Day1/Java/Fizzbuzz.java b/Day1/Java/Fizzbuzz.java index fa57903e..d96a5f1f 100644 --- a/Day1/Java/Fizzbuzz.java +++ b/Day1/Java/Fizzbuzz.java @@ -1,5 +1,5 @@ /** - * @author: MadhavBahlMD + * @author: MadhavBahl * @date: 20/12/2018 */ diff --git a/Day1/JavaScript/sol1.js b/Day1/JavaScript/sol1.js index 38b92e06..caf2ad58 100644 --- a/Day1/JavaScript/sol1.js +++ b/Day1/JavaScript/sol1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 20/12/2018 */ diff --git a/Day1/JavaScript/sol2.js b/Day1/JavaScript/sol2.js index b4729df5..3ba50fbd 100644 --- a/Day1/JavaScript/sol2.js +++ b/Day1/JavaScript/sol2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 20/12/2018 */ diff --git a/Day1/MediumBlog.md b/Day1/MediumBlog.md index a950be19..4b6d1d21 100644 --- a/Day1/MediumBlog.md +++ b/Day1/MediumBlog.md @@ -135,7 +135,7 @@ I would be more than happy if you send your feedback or suggestions, or if you a > You can contact me in case if you need any assistance: > Email: theleanprogrammer@gmail.com > Web: [http://madhavbahl.tech/](http://madhavbahl.ml/) -> GitHub: [https://github.com/MadhavBahlMD](https://github.com/MadhavBahlMD) +> GitHub: [https://github.com/MadhavBahl](https://github.com/MadhavBahl) > LinkedIn: [https://www.linkedin.com/in/madhavba_hl/_](https://www.linkedin.com/in/madhavbahl/) * * * diff --git a/Day1/README.md b/Day1/README.md index 7ddf0e28..962c08e2 100644 --- a/Day1/README.md +++ b/Day1/README.md @@ -17,7 +17,7 @@ ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 20/12/2018 */ @@ -48,7 +48,7 @@ fizzbuzz (17); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 20/12/2018 */ @@ -81,7 +81,7 @@ fizzbuzz (17); ```java /** - * @author: MadhavBahlMD + * @author: MadhavBahl * @date: 20/12/2018 */ diff --git a/Day2/Java/Palindrome.java b/Day2/Java/Palindrome.java index af170b73..9dae8803 100644 --- a/Day2/Java/Palindrome.java +++ b/Day2/Java/Palindrome.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/Java/Palindrome2.java b/Day2/Java/Palindrome2.java index 5f638610..fb700f5b 100644 --- a/Day2/Java/Palindrome2.java +++ b/Day2/Java/Palindrome2.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/Java/Reverse.java b/Day2/Java/Reverse.java index 234293be..186560af 100644 --- a/Day2/Java/Reverse.java +++ b/Day2/Java/Reverse.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/palindrome1.js b/Day2/JavaScript/palindrome1.js index 4931db98..cd5f99a3 100644 --- a/Day2/JavaScript/palindrome1.js +++ b/Day2/JavaScript/palindrome1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/palindrome2.js b/Day2/JavaScript/palindrome2.js index 245d0d90..7f23fa61 100644 --- a/Day2/JavaScript/palindrome2.js +++ b/Day2/JavaScript/palindrome2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/palindrome3.js b/Day2/JavaScript/palindrome3.js index a977fe8e..33cb397d 100644 --- a/Day2/JavaScript/palindrome3.js +++ b/Day2/JavaScript/palindrome3.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol1.js b/Day2/JavaScript/sol1.js index 5e69dca0..d88bf3c7 100644 --- a/Day2/JavaScript/sol1.js +++ b/Day2/JavaScript/sol1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol2.1.js b/Day2/JavaScript/sol2.1.js index ae8255b4..29c6b7ad 100644 --- a/Day2/JavaScript/sol2.1.js +++ b/Day2/JavaScript/sol2.1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol2.js b/Day2/JavaScript/sol2.js index 5c8c32e2..6366de31 100644 --- a/Day2/JavaScript/sol2.js +++ b/Day2/JavaScript/sol2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol3.js b/Day2/JavaScript/sol3.js index 7a8829bc..335663f9 100644 --- a/Day2/JavaScript/sol3.js +++ b/Day2/JavaScript/sol3.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol4.js b/Day2/JavaScript/sol4.js index 2d408462..e623c197 100644 --- a/Day2/JavaScript/sol4.js +++ b/Day2/JavaScript/sol4.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/JavaScript/sol5.js b/Day2/JavaScript/sol5.js index 41df4552..b3c49468 100644 --- a/Day2/JavaScript/sol5.js +++ b/Day2/JavaScript/sol5.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/Day2/README.md b/Day2/README.md index c0743faf..bf92b3a9 100644 --- a/Day2/README.md +++ b/Day2/README.md @@ -14,7 +14,7 @@ ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -49,7 +49,7 @@ console.log(strRev('Hello!')); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -89,7 +89,7 @@ console.log(strRev('Hello!')); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -117,7 +117,7 @@ console.log(strRev('Hello!')); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -146,7 +146,7 @@ console.log(strRev('Hello!')); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -174,7 +174,7 @@ console.log(strRev('Hello!')); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -199,7 +199,7 @@ console.log(strRev('Hello!')); ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -567,7 +567,7 @@ end ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -605,7 +605,7 @@ isPalindrome("level"); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -629,7 +629,7 @@ isPalindrome('level'); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -648,7 +648,7 @@ isPalindrome('level'); ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ @@ -687,7 +687,7 @@ public class Palindrome { ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 21/12/2018 */ diff --git a/README.md b/README.md index a8bc80b9..24637754 100644 --- a/README.md +++ b/README.md @@ -89,7 +89,7 @@ Motivate yourself to code daily till 60 days, and see the magic! Coding will bec ## [More Problems](./BONUS/README.md) -A real coder should not be satisfied by doing only one problem daily, rather he/she should keep coding as much as possible. So, here I ([@MadhavBahlMD](https://github.com/MadhavBahlMD)) am adding some more problems that you can practise 😃 +A real coder should not be satisfied by doing only one problem daily, rather he/she should keep coding as much as possible. So, here I ([@MadhavBahl](https://github.com/MadhavBahl)) am adding some more problems that you can practise 😃 Also, these problems have been taking form various sources, so ig you think you own any of the given problems, just send me an email at theleanprogrammer@gmail.com and I will be more than happy to give proper credits 😊 diff --git a/day10/JavaScript/stringPermute2.js b/day10/JavaScript/stringPermute2.js index bb7a9a12..3b55c688 100644 --- a/day10/JavaScript/stringPermute2.js +++ b/day10/JavaScript/stringPermute2.js @@ -1,7 +1,7 @@ /** * METHOD -- Backtracking * Algorithm taken from GeeksForGeeks (https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/) - * Implemented in JS by @MadhavBahlMD + * Implemented in JS by @MadhavBahl * @date 02/01/2019 */ diff --git a/day10/README.md b/day10/README.md index ed2a25c3..09959b09 100644 --- a/day10/README.md +++ b/day10/README.md @@ -55,7 +55,7 @@ console.log (stringPermutations('123')); /** * METHOD -- Backtracking * Algorithm taken from GeeksForGeeks (https://www.geeksforgeeks.org/write-a-c-program-to-print-all-permutations-of-a-given-string/) - * Implemented in JS by @MadhavBahlMD + * Implemented in JS by @MadhavBahl * @date 02/01/2019 */ diff --git a/day11/JavaScript/longest_substring_dynamic.js b/day11/JavaScript/longest_substring_dynamic.js index e177aae7..8d8fa2b7 100644 --- a/day11/JavaScript/longest_substring_dynamic.js +++ b/day11/JavaScript/longest_substring_dynamic.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 03/01/2018 * Referance: https://en.wikipedia.org/wiki/Longest_common_substring_problem */ diff --git a/day11/README.md b/day11/README.md index 2a20ceff..c5708c3c 100644 --- a/day11/README.md +++ b/day11/README.md @@ -36,7 +36,7 @@ The longest common substring of the strings "ABABC", "BABCA" and "ABCBA" is stri ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 03/01/2018 * Referance: https://en.wikipedia.org/wiki/Longest_common_substring_problem */ diff --git a/day12/Java/Bruteforce.java b/day12/Java/Bruteforce.java index 76fd072e..c3ae18b6 100644 --- a/day12/Java/Bruteforce.java +++ b/day12/Java/Bruteforce.java @@ -2,7 +2,7 @@ /** * Daily Codes Day 12 -- Substring Search (Brute Force Search) - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 */ diff --git a/day12/JavaScript/sol.js b/day12/JavaScript/sol.js index 2e20ae4c..55f6ce3d 100644 --- a/day12/JavaScript/sol.js +++ b/day12/JavaScript/sol.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @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 pattern respectively. diff --git a/day12/JavaScript/using_indexof.js b/day12/JavaScript/using_indexof.js index 109914e1..6fc9eec2 100644 --- a/day12/JavaScript/using_indexof.js +++ b/day12/JavaScript/using_indexof.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.indexOf() method */ diff --git a/day12/JavaScript/using_search.js b/day12/JavaScript/using_search.js index 04584dd1..f0d62f7b 100644 --- a/day12/JavaScript/using_search.js +++ b/day12/JavaScript/using_search.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.search() method */ diff --git a/day12/README.md b/day12/README.md index 24483a07..d89c9721 100644 --- a/day12/README.md +++ b/day12/README.md @@ -40,7 +40,7 @@ In this case, the worst case Time Complexity will be O(m.n), m and n are the len ```js /** - * @author MadhavBahlMD + * @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 pattern respectively. @@ -81,7 +81,7 @@ substringSearch ("abcrxyzgf", "xyz"); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.indexOf() method */ @@ -98,7 +98,7 @@ console.log (substringSearch ("abcrxyzgf", "xyz")); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 * METHOD - Using String.search() method */ @@ -180,7 +180,7 @@ import java.util.Scanner; /** * Daily Codes Day 12 -- Substring Search (Brute Force Search) - * @author MadhavBahlMD + * @author MadhavBahl * @date 05/01/2018 */ diff --git a/day13/JavaScript/fact_madhav.js b/day13/JavaScript/fact_madhav.js index 1c02ee09..000b9e34 100644 --- a/day13/JavaScript/fact_madhav.js +++ b/day13/JavaScript/fact_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 07/01/2018 */ diff --git a/day13/JavaScript/fibo_madhav.js b/day13/JavaScript/fibo_madhav.js index 6902a00b..d9512c9e 100644 --- a/day13/JavaScript/fibo_madhav.js +++ b/day13/JavaScript/fibo_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 07/01/2018 */ diff --git a/day13/README.md b/day13/README.md index ab4f0b87..d0f9a87c 100644 --- a/day13/README.md +++ b/day13/README.md @@ -37,11 +37,11 @@ The sequence is: 1, 1, 2, 3, 5, 8, 13 ### JavaScript Implementation -#### [Solution by @MadhavBahlMD](./JavaScript/fact_madhav.js) +#### [Solution by @MadhavBahl](./JavaScript/fact_madhav.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 07/01/2018 */ @@ -381,11 +381,11 @@ main ### JavaScript Implementation -#### [Solution by @MadhavBahlMD](./JavaScript/fibo_madhav.js) +#### [Solution by @MadhavBahl](./JavaScript/fibo_madhav.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 07/01/2018 */ diff --git a/day14/Java/SumDigits.java b/day14/Java/SumDigits.java index c0e60d2c..1e3d7710 100644 --- a/day14/Java/SumDigits.java +++ b/day14/Java/SumDigits.java @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01//2018 */ diff --git a/day14/JavaScript/prod_madhav.js b/day14/JavaScript/prod_madhav.js index e93a2411..bed5994a 100644 --- a/day14/JavaScript/prod_madhav.js +++ b/day14/JavaScript/prod_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01/2018 * METHOD - We keep thte second argument (num2) positive and add the first arguement num2(second arg) times */ diff --git a/day14/JavaScript/sum_madhav.js b/day14/JavaScript/sum_madhav.js index 5aaeb01f..a199e33b 100644 --- a/day14/JavaScript/sum_madhav.js +++ b/day14/JavaScript/sum_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01/2018 */ diff --git a/day14/README.md b/day14/README.md index af3bc76d..9ae407d6 100644 --- a/day14/README.md +++ b/day14/README.md @@ -44,7 +44,7 @@ output: -32 ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01/2018 */ @@ -66,7 +66,7 @@ console.log(`Sum of digits of ${num2} is ${sumDigits(num2)}`); ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01//2018 */ @@ -255,7 +255,7 @@ void main(){ ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01/2018 * METHOD - We keep thte second argument (num2) positive and add the first arguement num2(second arg) times */ @@ -294,7 +294,7 @@ console.log (`${n7} x ${n8} = ${recursiveProd(n7, n8)}`); ```java /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 08/01//2018 */ diff --git a/day15/JavaScript/pascal_MadhavBahlMD.js b/day15/JavaScript/pascal_MadhavBahlMD.js index 0dcd4426..df8ae083 100644 --- a/day15/JavaScript/pascal_MadhavBahlMD.js +++ b/day15/JavaScript/pascal_MadhavBahlMD.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 09/01/2018 */ diff --git a/day15/README.md b/day15/README.md index de4cad56..c216fa31 100644 --- a/day15/README.md +++ b/day15/README.md @@ -22,11 +22,11 @@ output: ## JavaScript Implementation -### [Solution](./JavaScript/pascal_MadhavBahlMD) +### [Solution](./JavaScript/pascal_MadhavBahl) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 09/01/2018 */ diff --git a/day16/JavaScript/hanoi_MadhavBahlMD.js b/day16/JavaScript/hanoi_MadhavBahlMD.js index 5fcd98db..574d51ea 100644 --- a/day16/JavaScript/hanoi_MadhavBahlMD.js +++ b/day16/JavaScript/hanoi_MadhavBahlMD.js @@ -1,6 +1,6 @@ /** * @source Geeks4Geeks: https://www.geeksforgeeks.org/c-program-for-tower-of-hanoi/ - * Implementaed in JavaScript by @MadhavBahlMD + * Implementaed in JavaScript by @MadhavBahl * @date 10/01/2019 */ diff --git a/day16/README.md b/day16/README.md index efa04c41..c7ba6ca3 100644 --- a/day16/README.md +++ b/day16/README.md @@ -20,12 +20,12 @@ The Tower of Hanoi puzzle was invented by the French mathematician Edouard Lucas ## JavaScript Implementation -### [Solution](./JavaScript/hanoi_MadhavBahlMD.js) +### [Solution](./JavaScript/hanoi_MadhavBahl.js) ```js /** * @source Geeks4Geeks: https://www.geeksforgeeks.org/c-program-for-tower-of-hanoi/ - * Implementaed in JavaScript by @MadhavBahlMD + * Implementaed in JavaScript by @MadhavBahl * @date 10/01/2019 */ diff --git a/day17/JavaScript/nqueens.js b/day17/JavaScript/nqueens.js index 0dca9aea..d1cbe467 100644 --- a/day17/JavaScript/nqueens.js +++ b/day17/JavaScript/nqueens.js @@ -1,7 +1,7 @@ /** * @date 11/01/2018 * Method (Backtracking) taken from -- https://www.youtube.com/watch?v=0DeznFqrgAI - * Implemented in JavaScript by @MadhavBahlMD + * Implemented in JavaScript by @MadhavBahl */ function nqueens (num) { diff --git a/day17/README.md b/day17/README.md index b5043b46..6b28e756 100644 --- a/day17/README.md +++ b/day17/README.md @@ -59,7 +59,7 @@ Method /** * @date 11/01/2018 * Method (Backtracking) taken from -- https://www.youtube.com/watch?v=0DeznFqrgAI - * Implemented in JavaScript by @MadhavBahlMD + * Implemented in JavaScript by @MadhavBahl */ function nqueens (num) { diff --git a/day18/JavaScript/checkPowerN_madhav.js b/day18/JavaScript/checkPowerN_madhav.js index 8011ab7f..737b3c67 100644 --- a/day18/JavaScript/checkPowerN_madhav.js +++ b/day18/JavaScript/checkPowerN_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Using frequency counter */ diff --git a/day18/JavaScript/checkPowerN_madhav2.js b/day18/JavaScript/checkPowerN_madhav2.js index 86b27bd5..845d7790 100644 --- a/day18/JavaScript/checkPowerN_madhav2.js +++ b/day18/JavaScript/checkPowerN_madhav2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Using Brute Force Search */ diff --git a/day18/JavaScript/countUniques1.js b/day18/JavaScript/countUniques1.js index 60f92bb4..5812edfc 100644 --- a/day18/JavaScript/countUniques1.js +++ b/day18/JavaScript/countUniques1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count uniques using multiple pointers (since the input array is sorted) */ diff --git a/day18/JavaScript/countUniques2.js b/day18/JavaScript/countUniques2.js index 5c1a09f3..0da20962 100644 --- a/day18/JavaScript/countUniques2.js +++ b/day18/JavaScript/countUniques2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count Uniques using frequency object */ diff --git a/day18/JavaScript/countUniques3.js b/day18/JavaScript/countUniques3.js index aeb098e3..ce6cafe7 100644 --- a/day18/JavaScript/countUniques3.js +++ b/day18/JavaScript/countUniques3.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count Uniques using brute force search */ diff --git a/day18/JavaScript/freqCounter_madhav.js b/day18/JavaScript/freqCounter_madhav.js index 2ea46bd1..47b6c055 100644 --- a/day18/JavaScript/freqCounter_madhav.js +++ b/day18/JavaScript/freqCounter_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 01/14/2018 * Frequency Ccounter using object */ diff --git a/day18/README.md b/day18/README.md index 6542dbfa..8dc63253 100644 --- a/day18/README.md +++ b/day18/README.md @@ -52,11 +52,11 @@ output: false ### JavaScript Implementation -#### [Solution by @MadhavBahlMD](./JavaScript/freqCounter_madhav.js) +#### [Solution by @MadhavBahl](./JavaScript/freqCounter_madhav.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 01/14/2018 * Frequency Ccounter using object */ @@ -264,7 +264,7 @@ Using Multiple Pointer ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count uniques using multiple pointers (since the input array is sorted) */ @@ -294,7 +294,7 @@ Using Frequency Object ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count Uniques using frequency object */ @@ -323,7 +323,7 @@ Using Brute Force Search ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Count Uniques using brute force search */ @@ -502,7 +502,7 @@ Using Frequency Count ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Using frequency counter */ @@ -544,7 +544,7 @@ Using Brute Force search ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 14/01/2019 * Using Brute Force Search */ diff --git a/day19/JavaScript/cartesian_madhav.js b/day19/JavaScript/cartesian_madhav.js index e8d48207..f77e551e 100644 --- a/day19/JavaScript/cartesian_madhav.js +++ b/day19/JavaScript/cartesian_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 15/01/2018 * Method: Use nested loop to generate the 2D matrix */ diff --git a/day19/JavaScript/fisherYates.js b/day19/JavaScript/fisherYates.js index 9a282815..352a21e8 100644 --- a/day19/JavaScript/fisherYates.js +++ b/day19/JavaScript/fisherYates.js @@ -1,6 +1,6 @@ /** * Fisher Yates Shuffle Algorithm - * Implemented in JavaScript by @MadhavBahlMD + * Implemented in JavaScript by @MadhavBahl * Algorithm * Step 1: Write down the numbers from 1 through N. * Step 2: Pick a random number k between one and the number of unstruck numbers remaining (inclusive). diff --git a/day19/README.md b/day19/README.md index d723f342..f137a97b 100644 --- a/day19/README.md +++ b/day19/README.md @@ -66,11 +66,11 @@ source: [wikipedia (https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)] ### JavaScript Implementation -#### [Solution by @MadhavBahlMD](./JavaScript/cartesian_madhav.js) +#### [Solution by @MadhavBahl](./JavaScript/cartesian_madhav.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 15/01/2018 * Method: Use nested loop to generate the 2D matrix */ @@ -319,7 +319,7 @@ for i in cartesian: ```js /** * Fisher Yates Shuffle Algorithm - * Implemented in JavaScript by @MadhavBahlMD + * Implemented in JavaScript by @MadhavBahl * Algorithm * Step 1: Write down the numbers from 1 through N. * Step 2: Pick a random number k between one and the number of unstruck numbers remaining (inclusive). diff --git a/day20/JavaScript/sol1.js b/day20/JavaScript/sol1.js index 05276848..66b3f774 100644 --- a/day20/JavaScript/sol1.js +++ b/day20/JavaScript/sol1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 16/01/2019 */ diff --git a/day20/JavaScript/sol2.js b/day20/JavaScript/sol2.js index b539e162..2fb3dfc8 100644 --- a/day20/JavaScript/sol2.js +++ b/day20/JavaScript/sol2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 16/01/2019 */ diff --git a/day20/JavaScript/sol3.js b/day20/JavaScript/sol3.js index 8a3d3092..abe46e73 100644 --- a/day20/JavaScript/sol3.js +++ b/day20/JavaScript/sol3.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 16/01/2019 */ diff --git a/day21/JavaScript/maxSubarray_madhav.js b/day21/JavaScript/maxSubarray_madhav.js index d19c3e84..c367a595 100644 --- a/day21/JavaScript/maxSubarray_madhav.js +++ b/day21/JavaScript/maxSubarray_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method - Bruteforce Search -- Worst Case Complexity = O(m.n) */ diff --git a/day21/JavaScript/maxSubarray_madhav2.js b/day21/JavaScript/maxSubarray_madhav2.js index 2fe1d886..d1971611 100644 --- a/day21/JavaScript/maxSubarray_madhav2.js +++ b/day21/JavaScript/maxSubarray_madhav2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method - Sliding Wndow -- Solvable in O(m) time, m = array length */ diff --git a/day21/JavaScript/pairSumN1.js b/day21/JavaScript/pairSumN1.js index 9e4559f1..e26dbfca 100644 --- a/day21/JavaScript/pairSumN1.js +++ b/day21/JavaScript/pairSumN1.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method used -- bruteforce search (Iteration using nested loops) */ diff --git a/day21/JavaScript/pairSumN2.js b/day21/JavaScript/pairSumN2.js index 6ffec3f6..98f76481 100644 --- a/day21/JavaScript/pairSumN2.js +++ b/day21/JavaScript/pairSumN2.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 16/01/2019 * Method -- Multiple Pointers, solution in O(n) */ diff --git a/day21/README.md b/day21/README.md index 95cdbcc9..41651c3a 100644 --- a/day21/README.md +++ b/day21/README.md @@ -36,11 +36,11 @@ output: 16 (7 + 5 + 4) ## JavaScript Implementation -### [Solution 1 by @MadhavBahlMD](./JavaScript/pairSumN1.js) +### [Solution 1 by @MadhavBahl](./JavaScript/pairSumN1.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method used -- bruteforce search (Iteration using nested loops) */ @@ -64,11 +64,11 @@ console.log (pairSumN ([-1, 4, 5, 5, 6, 7, 8], 10)); console.log (pairSumN ([1, 2, 3, 4, 5, 6], 20)); ``` -### [Solution 2 by @MadhavBahlMD](./JavaScript/pairSum2.js) +### [Solution 2 by @MadhavBahl](./JavaScript/pairSum2.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 16/01/2019 * Method -- Multiple Pointers, solution in O(n) */ @@ -139,13 +139,13 @@ end ## JavaScript Implementation -### [Solution 1 by @MadhavBahlMD](./JavaScript/maxSubarray_madhav.js) +### [Solution 1 by @MadhavBahl](./JavaScript/maxSubarray_madhav.js) Method - Bruteforce Search -- Worst Case Complexity = O(m.n), where m = array length and n is input number ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method - Bruteforce Search */ @@ -169,13 +169,13 @@ function maxSubarraySum (arr, n) { console.log (maxSubarraySum ([1, 3, 2, 4, 7, 5, 4], 3)); // 16 ``` -### [Solution 2 by @MadhavBahlMD](./JavaScript/maxSubarray_madhav2.js) +### [Solution 2 by @MadhavBahl](./JavaScript/maxSubarray_madhav2.js) Method - Sliding Wndow -- Solvable in O(m) time, m = array length ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method - Sliding Wndow -- Solvable in O(m) time, m = array length */ @@ -204,11 +204,11 @@ console.log (maxSubarraySum ([1, 3, 2, 4, 7, 5, 4], 3)); // 16 ## JavaScript Implementation -### [Solution 1 by @MadhavBahlMD](./JavaScript/pairSumN1.js) +### [Solution 1 by @MadhavBahl](./JavaScript/pairSumN1.js) ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 17/01/2019 * Method used -- bruteforce search (Iteration using nested loops) */ diff --git a/day22/JavaScript/sol1a_bruteforce.js b/day22/JavaScript/sol1a_bruteforce.js index 969d5b77..4f731ce1 100644 --- a/day22/JavaScript/sol1a_bruteforce.js +++ b/day22/JavaScript/sol1a_bruteforce.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Brute force Search */ diff --git a/day22/JavaScript/sol1b_indexOf.js b/day22/JavaScript/sol1b_indexOf.js index dc600d4a..0a0f7e7e 100644 --- a/day22/JavaScript/sol1b_indexOf.js +++ b/day22/JavaScript/sol1b_indexOf.js @@ -1,5 +1,5 @@ -/** - * @author MadhavBahlMD +s/** + * @author MadhavBahl * @dete 18/01/2019 * Method - Using JavaScript's `indexOf()` method */ diff --git a/day22/JavaScript/sol1c_multiplepointers.js b/day22/JavaScript/sol1c_multiplepointers.js index 4b84bb3a..8e793b31 100644 --- a/day22/JavaScript/sol1c_multiplepointers.js +++ b/day22/JavaScript/sol1c_multiplepointers.js @@ -1,5 +1,5 @@ /** FOR SORTED ARRAY - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Multiple Pointers * NOTE - For this method, We are assuming that the arrays are sorted. diff --git a/day22/JavaScript/sol1d_frequencycount.js b/day22/JavaScript/sol1d_frequencycount.js index 53bae874..2c143f37 100644 --- a/day22/JavaScript/sol1d_frequencycount.js +++ b/day22/JavaScript/sol1d_frequencycount.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count */ diff --git a/day22/JavaScript/sol2a_bruteforce.js b/day22/JavaScript/sol2a_bruteforce.js index 76991947..a0159501 100644 --- a/day22/JavaScript/sol2a_bruteforce.js +++ b/day22/JavaScript/sol2a_bruteforce.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @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 */ diff --git a/day22/JavaScript/sol2b_frequencycount.js b/day22/JavaScript/sol2b_frequencycount.js index 1d1f2f28..788297d4 100644 --- a/day22/JavaScript/sol2b_frequencycount.js +++ b/day22/JavaScript/sol2b_frequencycount.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count (object) */ diff --git a/day22/JavaScript/sol2c_multiplepointers.js b/day22/JavaScript/sol2c_multiplepointers.js index 5028c83d..d77c7bbb 100644 --- a/day22/JavaScript/sol2c_multiplepointers.js +++ b/day22/JavaScript/sol2c_multiplepointers.js @@ -1,5 +1,5 @@ /** FOR SORTED ARRAYS - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Multiple Pointers * NOTE - For this method, We are assuming that the arrays are sorted. diff --git a/day22/README.md b/day22/README.md index 85154d2c..6c834cb9 100644 --- a/day22/README.md +++ b/day22/README.md @@ -46,7 +46,7 @@ Method Used -- Bruteforce Search ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Brute force Search */ @@ -71,7 +71,7 @@ console.log (searchCommonElements ([0, 12, 41, 20], [9, 3, 1, 5])); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @dete 18/01/2019 * Method - Using JavaScript's `indexOf()` method */ @@ -94,7 +94,7 @@ console.log (searchCommonElements ([0, 12, 41, 20], [9, 3, 1, 5])); ```js /** FOR SORTED ARRAY - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Multiple Pointers * NOTE - For this method, We are assuming that the arrays are sorted. @@ -127,7 +127,7 @@ console.log (searchCommonElements ([1, 2, 3, 5, 7, 9, 12], [3, 4, 5, 6, 7])); ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count */ @@ -256,7 +256,7 @@ public class Common2 { ```js /** - * @author MadhavBahlMD + * @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 */ @@ -280,7 +280,7 @@ console.log (searchCommonElements ([1, 2, 4, 6, 7, 9, 11, 14, 15], [2, 3, 4, 5, ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Frequency Count (object) */ @@ -317,7 +317,7 @@ console.log (searchCommonElements ([1, 2, 4, 6, 7, 9, 11, 14, 15], [2, 3, 4, 5, ```js /** FOR SORTED ARRAYS - * @author MadhavBahlMD + * @author MadhavBahl * @date 18/01/2019 * Method - Multiple Pointers * NOTE - For this method, We are assuming that the arrays are sorted. diff --git a/day24/JavaScript/isRotation_madhav.js b/day24/JavaScript/isRotation_madhav.js index 013a4927..035bd70c 100644 --- a/day24/JavaScript/isRotation_madhav.js +++ b/day24/JavaScript/isRotation_madhav.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 22/01/2019 * Method - Circular Search -- Time = O(n) */ diff --git a/day24/README.md b/day24/README.md index 62772e5e..9ddddeb3 100644 --- a/day24/README.md +++ b/day24/README.md @@ -25,7 +25,7 @@ output: false ```js /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 22/01/2019 * Method - Circular Search -- Time = O(n) */ diff --git a/day25/JavaScript/rotateTile.js b/day25/JavaScript/rotateTile.js index 3841e838..f3a85d6a 100644 --- a/day25/JavaScript/rotateTile.js +++ b/day25/JavaScript/rotateTile.js @@ -1,5 +1,5 @@ /** - * @author MadhavBahlMD + * @author MadhavBahl * @date 23/01/2019 * Method -- Creating a new matrix to represent the rotated tile */ diff --git a/day25/JavaScript/rotateTile2.js b/day25/JavaScript/rotateTile2.js index b4b00c3f..9eb5ab69 100644 --- a/day25/JavaScript/rotateTile2.js +++ b/day25/JavaScript/rotateTile2.js @@ -1,5 +1,5 @@ // /** -// * @author MadhavBahlMD +// * @author MadhavBahl // * @date 23/01/2019 // * Method -- Changing the existing tile // */ diff --git a/day25/README.md b/day25/README.md index b12b97cb..8c008674 100644 --- a/day25/README.md +++ b/day25/README.md @@ -43,7 +43,7 @@ for (let i=0; i