add linked list problem set

Author: msdeep14

Diff for: a.out

@@ -0,0 +1,113 @@
+#include<iostream>
+using namespace std;
+
+/*
+Structure of the linked list node is as*/
+struct node
+{
+    int data;
+    struct node *next;
+};
+
+
+// function inserts the data in front of the list
+void insertAtBegining(struct node** headRef, int newData)
+{
+    // Code here
+    if(*headRef == NULL){
+        (*headRef)->data = newData;
+        (*headRef)->next = NULL;
+    }else{
+        node *newnode = new node();
+        newnode->data = newData;
+        newnode->next = (*headRef);
+        (*headRef) = newnode;
+    }
+}
+
+// function appends the data at the end of the list
+void insertAtEnd(struct node** headRef, int newData)
+{
+    // Code here
+    node *newnode = new node();
+    newnode->data = newData;
+    newnode->next = NULL;
+    if(*headRef ==NULL){
+        *headRef = newnode;
+        return;
+    }
+
+    node* curr = *headRef;
+    while(curr->next!=NULL){
+        curr = curr->next;
+    }
+    curr->next = newnode;
+    return;
+}
+
+node* deleteNode(node *head,int x)
+{
+    //Your code here
+    if(head!=NULL){
+        if(x==0){
+            node *temp = head;
+            head = head->next;
+            delete temp;
+            return head;
+        }else{
+            node *temp = head;
+            for(int i=0;i<x-1;i++){
+                head = head->next;
+            }
+            node *todelete = head->next;
+            head->next = todelete->next;
+            delete todelete;
+            return temp;
+        }
+    }
+}
+
+bool search(node *head,int x){
+    if(head==NULL) return false;
+    if(head->data == x) return true;
+    search(head->next,x);
+}
+
+int main(){
+    int t,n,k,num;
+    cin>>t;
+    while(t--){
+        cin>>n;
+        node *head = NULL;
+        for(int i=0;i<n;i++){
+            // cin>>num>>k;
+            // if(k==0) insertAtBegining(&head,num);
+            // else insertAtEnd(&head,num);
+            cin>>num;
+            insertAtEnd(&head,num);
+        }
+        //delete node
+        /*
+        cout<<"enter pos to delete:: \n";
+        int pos;
+        cin>>pos;
+        deleteNode(head,pos);
+        */
+
+        //search for nodevalue
+        int val;
+        cout<<"enter value to be searched:: \n";
+        cin>>val;
+        bool res = search(head,val);
+        if(res == true)cout<<"value found\n";
+        else cout<<"value not found\n";
+
+        while(head!=NULL){
+            cout<<head->data<<" ";
+            head = head->next;
+        }
+        cout<<endl;
+        delete head;
+    }
+    return 0;
+}

Diff for: linked-list-insert.cpp

@@ -0,0 +1,24 @@
+//http://practice.geeksforgeeks.org/problems/number-starting-with-1-in-b-base/0
+//number-starting-with-1-in-b-base
+#include<iostream>
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t,b;
+    cin>>t;
+    while(t--){
+        int n;
+        cin>>n>>b;
+        int m = log2(n);
+        int flag=0;
+        for(int i=1;i<=m;i++){
+            if(n>=pow(b,i) && n<=2*pow(b,i)-1){
+                cout<<"Yes\n";
+                flag=1;
+                break;
+            }
+        }
+        if(flag==0)cout<<"No\n";
+    }
+    return 0;
+}