Merge pull request #176 from satyam-chaudhari/master

Added solutions to different patterns and Hacker Rank Problem Solution

Author: larissalages

Hackerrank/c++/Day_15_Linked_List.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <cstddef>
+using namespace std;	
+class Node
+{
+    public:
+        int data;
+        Node *next;
+        Node(int d){
+            data=d;
+            next=NULL;
+        }
+};
+class Solution{
+    public:
+
+      Node* insert(Node *head,int data)
+      {
+          //Complete this method
+          Node* newNode = new Node(data);
+          Node* tail = head;
+
+          if(head == NULL)
+          {
+              return newNode;
+          }
+          else
+          {
+              for (;tail->next ; tail = tail->next);
+              tail->next = newNode;
+              return head;              
+          }     
+      }
+
+      void display(Node *head)
+      {
+          Node *start=head;
+          while(start)
+          {
+              cout<<start->data<<" ";
+              start=start->next;
+          }
+      }
+};
+int main()
+{
+    #ifndef ONLINE_JUDGE
+        freopen("input.txt","r",stdin);
+        freopen("output.txt","w",stdout);
+    #endif
+
+	Node* head=NULL;
+  	Solution mylist;
+    int T,data;
+    cin>>T;
+    while(T-->0){
+        cin>>data;
+        head=mylist.insert(head,data);
+    }	
+	mylist.display(head);
+		
+}

Patterns/Num & Star Patterns/pattern1.cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k=1;
+    cin>>n;
+
+    for (i=1 ; i<=n ; i++)
+    {
+        for(j=1 ; j<=i ;j++)
+        {
+            cout<<k<<" ";
+            k++;
+        }
+        cout<<endl;
+    }
+   
+    return 0;
+}

Patterns/Num & Star Patterns/pattern2.cpp

@@ -0,0 +1,29 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k=1;
+    cin>>n;
+
+    for (i=1 ; i<=n ; i++)
+    {
+        for(j=1 ; j<=i ; j++)
+        {
+            cout<<"*"<<" ";
+        }
+        cout<<endl;        
+    }
+    i=0;j=0;
+    for(i=n-1 ; i>=1 ; i--)
+    {
+        for(j=1 ; j<=i ; j++)
+        {
+            cout<<"*"<<" ";
+        }
+        cout<<endl;
+    }
+    
+   
+    return 0;
+}

Patterns/Num & Star Patterns/pattern3.cpp

@@ -0,0 +1,37 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k=1;
+    cin>>n;
+
+    for(i=1, k=0 ; i<=n ; i++, k=0)
+    {
+        for(j=1 ; j<=(n-i) ; j++)
+        {
+            cout<<" ";
+        }
+        while(k != (2*i)-1 )
+        {
+            cout<<"*";
+            k++;
+        }
+        cout<<endl;
+    }
+    for(i=n-1 , k=0 ; i>=1 ; i--, k=0)
+    {
+        for(j=1 ; j<=(n-i) ; j++)
+        {
+            cout<<" ";
+        }
+        while(k != (2*i)-1 )
+        {
+            cout<<"*";
+            k++;
+        }
+        cout<<endl;
+    }    
+   
+    return 0;
+}

Patterns/Num & Star Patterns/pattern4.cpp

@@ -0,0 +1,40 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k;
+    cin>>n;
+
+    for(i=1 ; i<=n ; i++)
+    {
+        for(j=1 ; j<=n ; j++)
+        {
+            if((i==1) || (i==n) || (j==1) || (j==n))
+                cout<<"* ";
+            else
+                cout<<"  ";           
+        }
+        cout<<endl;
+    }
+
+    // for(i=1 ; i<=n ; i++)
+    // {
+    //     if(i==1 || i==n)
+    //     {
+    //         for(j=1 ; j<=n ; j++)
+    //         {
+    //             cout<<"*";
+    //         }
+    //         cout<<endl;
+    //     }
+    //     else 
+    //     {
+    //         cout<<"*";
+    //         for(k=1 ; k<=n-2 ; k++)
+    //             cout<<" ";
+    //         cout<<"*"<<endl;
+    //     }
+    // }  
+    return 0;
+}

Patterns/Num & Star Patterns/pattern5.cpp

@@ -0,0 +1,25 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k;
+    cin>>n;
+
+    for(i=0 ; i<n ; i++)
+    {
+        k=i;
+        while (k) 
+        {
+            cout<<"  ";
+            k--;
+        }
+        for(j=0 ; j<n-i ; j++)
+        {
+            cout<<"* ";                        
+        }
+        cout<<endl;
+    }
+    
+    return 0;
+}

Patterns/Num & Star Patterns/pattern6.cpp

@@ -0,0 +1,40 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k;
+    cin>>n;
+
+    for(i=1 ; i<=n ; i++)
+    {
+        // k=n-i;
+        // while (k) 
+        // {
+        //     cout<<"  ";
+        //     k--;
+        // }
+        // for(j=1 ; j<=i ; j++)
+        // {
+        //     cout<<"*   ";                        
+        // }
+        // cout<<endl;
+        k=0;
+        while (k != (n-i))
+        {
+            cout<<" ";
+            k++;
+        }
+        for ( j = 1; j <= (2*i)-1 ; j++)
+        {
+            if((j%2)==0)
+                cout<<" ";
+            else
+                cout<<"*";
+        }
+        cout<<endl;
+        
+    }
+    
+    return 0;
+}

Patterns/Num & Star Patterns/pattern7.cpp

@@ -0,0 +1,40 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n,i,j,k;
+    cin>>n;
+
+    for(i=1 ; i<=n ; i++)
+    {
+        k=n-i;
+        while (k) 
+        {
+            cout<<"  ";
+            k--;
+        }
+        for(j=1 ; j<=i ; j++)
+        {
+            cout<<"* ";                        
+        }
+        cout<<endl;
+    }
+
+    for(i=1 ; i<=n-1 ; i++)
+    {
+        k=i;
+        while (k) 
+        {
+            cout<<"  ";
+            k--;
+        }
+        for(j=1 ; j<=n-i ; j++)
+        {
+            cout<<"* ";                        
+        }
+        cout<<endl;
+    }
+    
+    return 0;
+}

Patterns/Num & Star Patterns/pattern8.cpp

@@ -0,0 +1,35 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int i,j,k,n;
+    cin>>n;
+   
+    for (i = 0; i <= n/2 ; i++)
+    {
+        for(j=0 ; j<n ; j++)
+        {
+            if((j >= (n/2)-i) && (j <= (n/2)+i))
+                cout<<"  ";
+            else
+                cout<<"* ";
+        }
+        cout<<endl;
+    }
+
+    for (i = 0; i < n/2 ; i++)
+    {
+        for(j=0 ; j<n ; j++)
+        {
+            if((j <= i) || (j >= (n-i-1)))
+                cout<<"* ";
+            else
+                cout<<"  ";
+        }
+        cout<<endl;
+    }
+    
+
+    return 0;
+}