Merge branch 'smv1999:master' into Raunak

Author: raunakpandey1

CONTRIBUTING.md

@@ -1,7 +1,9 @@
 ## Contributing Guidelines
 
-Developers are highly welcome to contribute to this project by modifying the existing solutions to more optimized solutions or add new programs that fit into the various categories
-mentioned in the repo or adding a new category if needed.
+Developers are highly welcome to contribute to this project by modifying the existing solutions to more optimized solutions or add new programs that fit into the various categories mentioned in the repo or adding a new category if needed.
+
+* Look at the issues created already and get yourself assigned for the issues by commenting there. Issues will be assigned on FCFS basis. 
+* Create a new issue whether you are adding a new program or optimizing the existing solution. After the issue is assigned to you, start working on it and make a pull request as mentioned in the steps below.
 
 1. Fork this repository
 1. Clone the repo ```git clone <YOUR_FORKED_REPO_URL>```

Data Structures/Linked Lists/Circular Doubly Linked Lists/recursive_reverse.cpp

@@ -0,0 +1,113 @@
+/*
+
+This is a Circular Doubly Linked List program which recursively reverses the Linked Lists.
+Since, it is a Ciruclar Doubly Linked List, both the forward and backward traversal is also possible.
+
+*/
+
+#include <iostream>
+
+using namespace std;
+
+/*
+
+Node definition:
+	1. Pointer to previous node.
+	2. Integer Data
+	3. Pointer to next node.
+
+*/
+
+class dcll_node {
+public:
+	dcll_node* prev;
+	int data;
+	dcll_node* next;
+};
+
+void createDCLL(dcll_node* &head) {
+
+	dcll_node* temp = head;
+
+	int choice;
+
+	do {
+
+		int data;
+
+		cout << "Enter Data : ";
+		cin >> data;
+
+		dcll_node* newNode = new dcll_node();
+		newNode->data = data;
+		newNode->prev = NULL;
+		newNode->next = NULL;
+
+		if(head == NULL) {
+			head = newNode;
+			temp = head;
+			head->next = head;
+			head->prev = head;
+		} else {
+			temp->next = newNode;
+			newNode->prev = temp;
+			temp = newNode;
+			newNode->next = head;
+			head->prev = newNode;
+		}
+
+		cout << "Do you want to continue? (1/0) : ";
+		cin >> choice;
+
+	} while(choice == 1);
+
+}
+
+dcll_node* recursive_reverse(dcll_node *head) {
+
+	if(head == NULL || head->next == head)
+		return head;
+
+	head->prev->next = head->next;
+	head->next->prev = head->prev;
+	dcll_node* tHead = recursive_reverse(head->next);
+	tHead->prev->next = head;
+	head->prev = tHead->prev;
+	head->next = tHead;
+	tHead->prev = head;
+	return tHead;
+}
+
+void display(dcll_node* head) {
+
+	if(head == NULL)
+		return;
+
+	cout << "The elements are : ";
+	dcll_node* temp = head;
+
+	do {
+
+		cout << temp->data << " ";
+		temp = temp->next;
+
+	} while(temp != head);
+	cout << endl;
+}
+
+int main() {
+
+	dcll_node* head = NULL;
+
+	createDCLL(head);
+
+	cout << "Before reversing : " << endl;
+	display(head);
+
+	head = recursive_reverse(head);
+
+	cout << "After reversing : " << endl;
+	display(head);
+
+	return 0;
+}

Data Structures/Linked Lists/Circular Doubly Linked Lists/reverse.cpp

@@ -1,6 +1,6 @@
 /*
 
-This is a Circular Doubly Linked List program which deletes a Node at the end of the Linked Lists.
+This is a Circular Doubly Linked List program which reverses the Linked Lists.
 Since, it is a Ciruclar Doubly Linked List, both the forward and backward traversal is also possible.
 
 */

README.md

@@ -1,5 +1,5 @@
 # 🎯💻Competitive Programming Question Bank🏆🏅
-This repository contains all the popular Competitive Programming questions and Interview questions. The Programming languages used for demonstration are the C Language, C++, Python, and Java. <br><br>
+This repository contains all the popular Competitive Programming questions and Interview questions. The Programming languages used for demonstration are the C Language, C++, Python, Java and JavaScript. <br><br>
  [![Followers](https://img.shields.io/github/followers/smv1999?style=for-the-badge)](https://github.com/smv1999?tab=followers)
  ![GitHub forks](https://img.shields.io/github/forks/smv1999/CompetitiveProgrammingQuestionBank?style=for-the-badge)
  ![GitHub Repo stars](https://img.shields.io/github/stars/smv1999/CompetitiveProgrammingQuestionBank?style=for-the-badge)
@@ -81,7 +81,7 @@ Thanks goes to these **Wonderful People** 👨🏻‍💻:
 ## Programs 
 <img src="https://raw.githubusercontent.com/smv1999/CompetitiveProgrammingQuestionBank/master/images/devincept.gif" alt="DevIncept" />
 
-<p>DevIncept is an 30 day open source program helping the student community learn and contribute in various open source project under the guidance of skilled mentors and project admins.</p>
+<p>DevIncept is a 30 day open source program helping the student community learn and contribute in various open source projects under the guidance of skilled mentors and project admins.</p>
 
 
 ## Stargazers Over Time