add

Author: maityamit

005 - Linked List/Practice 01/Prac Rec - 01.cpp

@@ -527,6 +527,45 @@ Node* kReverse(Node* head,int k){
 return vishal;
 }
 
+//Next Number
+Node* nextNumber(Node* head){
+if(head==NULL){
+ return NULL;
+ }
+ Node *temp = head;
+ int count = 1;
+ while(temp->next!=NULL){
+ temp = temp->next;
+ count++;
+ }
+ if(temp->data != 9){
+ temp->data = (temp->data)+1;
+ return head;
+ }
+ Node *amit = head;
+ int sum = 0;
+ for(int i=count-1;i>=0;i--){
+ sum = sum*10 + (amit->data);
+ amit = amit->next;
+ }
+ sum = sum+1;
+ Node *yash_head = NULL;
+ Node *yash_tail = NULL;
+ while(sum>0){
+ Node *vishal = new Node(sum%10);
+ if(yash_head==NULL){
+ yash_head = vishal;
+ yash_tail = vishal;
+ }else{
+ yash_tail->next = vishal;
+ yash_tail = yash_tail->next;
+ }
+ sum/=10;
+ }
+ return yash_head;
+}
+
+
 
 int main(){
 //10 20 30 40 50 60 70 80 90 100
@@ -554,5 +593,8 @@ int main(){
 // printLinkedList(skipMdeleteN(head,2,2));
 // printLinkedList(swapTwoNodes(head,2,4));
 // printLinkedList(kReverse(head,3));
+
+ 
+ printLinkedList(deleteAlternative(head));
 return 0;
 }

006 - Stack/Minimum Brackets Redundance.cpp

@@ -0,0 +1,31 @@
+#include<stack>
+int countBracketReversals(string s) {
+// Write your code here
+ if(s.length()%2!=0){
+return -1;
+}
+stack<char> st;
+for(int i=0;i<s.length();i++){
+if(s[i]=='}'&&st.size()!=0&&st.top()=='{'){
+st.pop();
+}else{
+st.push(s[i]);
+}
+
+}
+char c1,c2;
+int count=0;
+while(st.size()!=0){
+c1=st.top();
+ st.pop();
+c2=st.top();
+st.pop();
+if(c1==c2){
+count++;
+}else if(c1=='{'){
+count+=2;
+}
+}
+return count;
+ 
+}

006 - Stack/Practice 01/practice 01.cpp

@@ -63,6 +63,58 @@ bool redundantBracket(string s){
 return false;
 }
 
+//Stock Span Function
+int* stockSpan(int* price,int size){
+int* data=new int[size];
+stack<int> st;
+st.push(0);
+data[0]=1;
+for(int i=1;i<size;i++){
+while(st.size()!=0 && price[i]>price[st.top()]){
+st.pop();
+}
+if(st.size()==0){
+data[i]=i+1;
+}else{
+data[i]=i-st.top();
+}
+st.push(i);
+}
+return data;
+}
+
+//Minimum Brackets Reversal
+int minBracketRev(string s){
+if(s.length()%2!=0){
+return -1;
+}
+stack<char> st;
+for(int i=0;i<s.length();i++){
+if(s[i]=='}'&&st.size()!=0&&st.top()=='{'){
+st.pop();
+}else{
+st.push(s[i]);
+}
+
+}
+char c1,c2;
+int count=0;
+while(st.size()!=0){
+c1=st.top();
+st.pop();
+c2=st.top();
+st.pop();
+if(c1==c2){
+count++;
+}else{
+if(c1=='}'){
+count+=2;
+}
+}
+}
+return count;
+}
+
 int main(){
 
 
@@ -132,5 +184,6 @@ int main(){
 
 // cout<<redundantBracket("(a+b)")<<endl;
 
+cout<<minBracketRev("{{{{}{")<<endl;
 
 }

006 - Stack/Stock Span.cpp

@@ -0,0 +1,20 @@
+#include<stack>
+int* stockSpan(int *price, int size) {
+// Write your code here
+ stack<int> st;
+ int *ans = new int[size];
+ ans[0]=1;
+ st.push(0);
+ for(int i=1;i<size;i++){ 
+ while(st.size()!=0 && price[i]>price[st.top()]){
+ st.pop();
+ }
+ if(st.size()==0){
+ ans[i]=i+1;
+ }else{
+ ans[i]=i-st.top();
+ }
+ st.push(i);
+ }
+ return ans;
+}