add day50

Author: MadhavBahl

day46/README.md

@@ -26,6 +26,8 @@ In addition to above operations, following operations are also supported
 
 [Read More (Geeks4Geeks)](https://www.geeksforgeeks.org/deque-set-1-introduction-applications/)
 
+[ques](./ques.png)
+
 ## Solution
 
 ## JavaScript Implementation

day46/carbon.png renamed to day46/ques.png

@@ -24,6 +24,8 @@ A linked list is a linear data structure, in which the elements are not stored a
 
 Try to implement a singly linked list.
 
+[ques](./ques.png)
+
 ## Solution
 
 ## JavaScript Implementation

day47/README.md

@@ -29,6 +29,8 @@ In singly linked list, to delete a node, pointer to the previous node is needed.
 
 Try to implement a doubly linked list.
 
+[ques](./ques.png)
+
 ## Solution
 
 ## JavaScript Implementation

day47/carbon.png renamed to day47/ques.png

@@ -2,7 +2,7 @@
 
 # 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.
+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
 
@@ -20,6 +20,8 @@ output: 2
 
 👉 When the second pointer reaches the end, first pointer would reach to the middlemost element
 
+[ques](./ques.png)
+
 ## Solution
 
 ## JavaScript Implementation

day48/README.md

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

day48/ques.png

@@ -0,0 +1,29 @@
+![cover](./cover.png)
+
+# Day 50 - Nth From End
+
+Given a singly linked list, and a number "n", find the nth element **from end** in the Linked List
+
+Note that this is a sinigly linked list and you cannot traverse in the backward direction.
+
+### Example
+
+```
+given linked list: 1 -> 2 -> 3 -> 4  |  nthFromEnd (2)
+output: 3
+
+given linked list: 1 -> 2 -> 3 -> 4  |  nthFromEnf (5)
+output: undefined
+```
+
+[ques](./ques.png)
+
+## Solution
+
+## JavaScript Implementation
+
+### [Solution](./JavaScript/nthFromEnd.js)
+
+```js
+// To Be Added
+```