Add day 49

Author: MadhavBahl

README.md

@@ -76,6 +76,7 @@ Motivate yourself to code daily till 60 days, and see the magic! Coding will bec
 | [Day 46](./day46) | [Double Ended Queue](./day46) | [http://codetoexpress.tech/dc/day46/](http://codetoexpress.tech/dc/day46/) | **Advanced** |
 | [Day 47](./day47) | [Singly Linked List](./day47) | [http://codetoexpress.tech/dc/day47/](http://codetoexpress.tech/dc/day47/) | **Intermediate** |
 | [Day 48](./day48) | [Doubly Linked List](./day48) | [http://codetoexpress.tech/dc/day48/](http://codetoexpress.tech/dc/day48/) | **Intermediate** |
+| [Day 49](./day49) | [MiddleMost Node Search](./day49) | [http://codetoexpress.tech/dc/day49/](http://codetoexpress.tech/dc/day49/) | **Intermediate** |
 
 ## [More Problems](./BONUS/README.md)
 

day48/JavaScript/dll.js renamed to day48/JavaScript/middleNode.js

@@ -1,6 +1,6 @@
 ![cover](./cover.png)
 
-# Day 47 - Implement a doubly doubly linked list
+# Day 48 - Implement a doubly linked list
 
 Write a program to implement a doubly linked list
 

day48/README.md

@@ -0,0 +1 @@
+// To Be Added

day49/JavaScript/dll.js

@@ -0,0 +1,31 @@
+![cover](./cover.png)
+
+# Day 49 - MiddleMost Node Search
+
+Given a singly linked list, find it's middle-most element, *without* knowing the size of the linked list or using any counter variable.
+
+### Example
+
+```
+given linked list: 1 -> 2 -> 3
+output: 2
+
+given linked list: 1 -> 2 -> 3 -> 4
+output: 2
+```
+
+### HINT
+
+👉 Make 2 pointer variables which would iterate over the Linked List, such that in each iteration, first variable moves 1 step forward, and the second pointer variable moves 2 steps forward. 
+
+👉 When the second pointer reaches the end, first pointer would reach to the middlemost element
+
+## Solution
+
+## JavaScript Implementation
+
+### [Solution](./JavaScript/middleNode.js)
+
+```js
+// To Be Added
+```