stacks and deques

Author: Mohit Jain

Diff for: LinkedList.cpp

@@ -128,6 +128,8 @@ node* take_input_2(){
    }
    return head;
 }
+
+
 ostream& operator<<(ostream &os,node*head){
 	print(head);
     return os;
@@ -170,9 +172,6 @@ node* recReverse(node*head){
    temp->next = head;
 
    return shead;
-
-
-
 }
    node* midpoint(node*head){
    	if(head==NULL or head->next == NULL){
@@ -205,6 +204,7 @@ node* recReverse(node*head){
     return slow;
 
    }
+
 node* merge(node*a,node*b){
 
    	if(a==NULL) return b;
@@ -239,22 +239,51 @@ node* mergeSort(node *head) {
     return c;
 
 }
-// Cycle detection and removal (Floyd's cycle)
-bool detectCycle(node* head) {
+// Cycle detection and removal (Floyd's cycle) It should complete 
+bool detectCycle(node* &head) {
 	node*slow = head;
 	node*fast = head;
 
 	while(fast!=NULL && fast->next!=NULL){
 		fast = fast->next->next;
 		slow = slow->next;
-		if(fast==slow) return true;
+		if(fast==slow) { 
+        
+         removeCycle(slow,head);
+      
+			return true; }
 
 	}
 
 	return false;
 
 }
 
+void removeCycle(node* slow,node* &head ) {
+   
+   node* ptr1 = slow;
+
+   node* ptr2 = head;
+
+   node* prev = ptr1;
+
+   while(ptr2!= ptr1){
+      
+      prev = ptr1;
+      ptr1 = ptr1->next;
+      ptr2 = ptr2->next;    
+     
+      
+
+
+      
+   }
+
+    prev->next = NULL;
+
+
+}
+
 
 int main() {
 
@@ -265,13 +294,15 @@ int main() {
     freopen("output.txt", "w", stdout);
     #endif
 
-	node*head = take_input_2();
-    node*head2 = take_input_2();
-    node *head,*head2;
-    cin>>head>>head2;
-	cout<<head;
-	cout<<head2;
-	cout<<head<<head2;
+    node *head = take_input_2();
+
+	// node*head = take_input_2();
+ //    node*head2 = take_input_2();
+ //    node *head,*head2;
+ //    cin>>head>>head2;
+	// cout<<head;
+	// cout<<head2;
+	// cout<<head<<head2;
     // insertAtHead(head,3);
     // insertAtHead(head,2);
     // insertAtHead(head,1);

Diff for: LinkedListProblems.pdf

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+
+
+int main() {
+   
+   #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+    list<int> l1{1,2,3,4,5,7,10};
+
+    list<string> l2{"mohit","kanika","jeevan"};
+
+    l2.push_back("pineapple");
+
+    l2.sort();
+    l2.reverse(); 
+     l2.push_back("dipit");
+     l2.push_back("apple");
+     
+
+     for(string s:l2){
+    	cout<<s<<"-->";
+    }
+    // remove all the occurrences
+    l2.remove("apple"); 
+    auto it = l2.begin();
+    it++;
+    it++;
+    l2.erase(it);
+    l2.insert(it,"dfgd");
+  return 0;
+
+}

Diff for: List-Stl

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+bool isValidExp(char *s){
+
+	stack <char> s;
+	for(int i=0;s[i]!='\0';i++){
+
+		char ch = s[i];
+
+		if(ch == '('){
+			s.push(ch);
+		}
+		else if(ch == ')'){
+			if(s.empty() or s.top()!='('){
+				return false;
+			}
+			s.pop();
+		}
+	}
+
+	return s.empty();
+}
+
+int main() {
+
+
+     #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+    #endif
+
+   
+
+
+
+	return 0;
+}

Diff for: List-Stl.cpp

@@ -11,7 +11,7 @@ class node{
 		data = d;
 		next = NULL;
 	}
-};
+};	
 
 void insert(node*&head,int data){
 
@@ -37,7 +37,7 @@ void insert(node*&head,int data){
 
 }
 void print(node*head){
-	node*teamp = head;
+	node*temp = head;
 	while(temp->next!= head){
 		cout<<temp->data<<" ";
 		temp = temp->next;
@@ -46,7 +46,54 @@ void print(node*head){
 	return;
 }
 // deletion in circular Linked list 
+node *getnode(node *head,int data) {
+	node*temp = head;
+	while(temp->next!= head) {
+		if(temp->data == data) return temp;
+
+		temp = temp->next;
+	}
+
+	if(temp->data == data) return temp;
+
+	return NULL;
+}
+void deleteNode(node*&head, int data){
+	node *del = getnode(head,data);
+	if(del == NULL) return;
+     
+     if(head == del) head =  head->next;
+     node *temp = head;
+	while(temp->next!= del){
+		temp = temp->next;
+	}
+	temp->next = del->next;
+	delete del;
+}
 int main() {
+    
+
+    
+       #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+    #endif
+    
+
+	node * head = NULL;
+
+	insert(head,10);
+	insert(head,20);
+
+	insert(head,30);
+	insert(head,40);
+    print(head);
+
+	deleteNode(head,30);
+    
+    print(head);
 
 
 

Diff for: balancedParanthesis.cpp

@@ -1,4 +0,0 @@
-3
-1 1 1 1
-8 8 7 6
-8 8 8 6

Diff for: circularLinkedList

@@ -1 +1 @@
-1
+1 2 3 4 5 

Diff for: circularLinkedList.cpp

@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+void transfer(stack<int> &s1,stack<int>&s2,int n){
+	for(int i=0; i<n;i++){
+		s2.push(s1.top());
+		s1.pop();
+	}
+}
+void reverseStack(stack<int> &s1){
+   
+   stack<int> s2;
+
+   int n = s1.size();
+
+   for(int i=0; i<n;i++){
+
+   	int x = s1.top();
+
+   	s1.pop();
+
+   	transfer(s1,s2,n-i-1);
+   	s1.push(x);
+
+   	transfer(s2,s1,n-i-1);
+
+   }
+
+
+void insertAtBottom(stack<int> &s,int x){
+
+	if(s.empty()){
+		s.push(x);
+		return;
+	}
+
+	int data = s.top();
+	s.pop();
+	insertAtBottom(s,x);
+	s.push(data);
+}
+void recursiveReverseStack(){
+    
+    if(s.empty()) return;
+
+    int x = s.top();
+    s.pop();
+    reverseStack(s);
+    insertAtBottom(s,x);
+}
+
+
+int main() {
+
+
+     #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+    #endif
+
+  stack<int> s;
+
+  s.push(1);
+  s.push(2);
+  s.push(3);
+  s.push(4);
+  s.push(5);
+   
+   reverseStack(s);
+    while(!s.empty()){
+    	cout<<s.top()<<" ";
+    	s.pop();
+    }
+	return 0;
+}