diff --git a/C++/linkedlist.cpp b/C++/linkedlist.cpp
new file mode 100644
index 0000000..2df91a2
--- /dev/null
+++ b/C++/linkedlist.cpp
@@ -0,0 +1,531 @@
+#include <iostream>
+using namespace std;
+class node
+{
+public:
+    int dat;
+    node *prev;
+    node *next;
+
+    node(int val)
+    {
+        dat = val;
+        next = NULL;
+        prev = NULL;
+    };
+    void insertAtHead(node *&head, int val)
+    {
+        node *n = new node(val);
+        n->next = head;
+        head = n;
+    }
+    void insertAtTail(node *&head, int val)
+    {
+        node *n = new node(val);
+        if (head == NULL)
+        {
+            head = n;
+            return;
+        }
+        node *temp = head;
+        while (temp->next != NULL)
+        {
+            temp = temp->next;
+        }
+        temp->next = n;
+    };
+    int search(node *head, int key)
+    {
+        node *temp = head;
+        while (temp != NULL)
+        {
+            if (temp->dat == key)
+            {
+                return key;
+            }
+            temp = temp->next;
+        }
+        return -1;
+    }
+    void display(node *head)
+    {
+        node *temp = head;
+        while (temp != NULL)
+        {
+            cout << temp->dat << " ";
+            temp = temp->next;
+        }
+        cout << "NULL" << endl;
+    }
+    void deletenode(node *&head, int val)
+    {
+
+        node *temp = head;
+        while (temp->next->dat != val)
+        {
+            temp = temp->next;
+        }
+        node *todelete = temp->next;
+        temp->next = temp->next->next;
+        delete todelete;
+    }
+    void deletefirstnode(node *&head)
+    {
+        node *todelete = head;
+        head = head->next;
+        delete todelete;
+    }
+    node *revitll(node *&head)
+    {
+        node *currptr = head;
+        node *prevptr = NULL;
+        node *nextptr;
+        while (currptr != NULL)
+        {
+            nextptr = currptr->next;
+            currptr->next = prevptr;
+
+            prevptr = currptr;
+            currptr = nextptr;
+        }
+        return prevptr;
+    }
+    node *revrecll(node *&head)
+    {
+        if (head == NULL || head->next == NULL)
+        {
+            return head;
+        }
+        node *newhead = revrecll(head->next);
+        head->next->next = head;
+        head->next = NULL;
+        return newhead;
+    }
+    node *revkll(node *&head, int k)
+    {
+        int cunt = 0;
+        node *prevptr = NULL;
+        node *nextptr = NULL;
+        node *currptr = head;
+        while (currptr != NULL && cunt < k)
+        {
+            nextptr = currptr->next;
+            currptr->next = prevptr;
+            prevptr = currptr;
+            currptr = nextptr;
+            cunt++;
+        }
+        if (nextptr != NULL)
+        {
+            head->next = revkll(nextptr, k);
+        }
+        return prevptr;
+    }
+    void makecycle(node *&head, int pos)
+    {
+        node *startnode;
+        node *temp = head;
+        int cont = 1;
+        while (temp->next != NULL)
+        {
+            if (cont == pos)
+            {
+                startnode = temp;
+            }
+            temp = temp->next;
+            cont++;
+        }
+        temp->next = startnode;
+    }
+    bool detectcycle(node *&head)
+    {
+        node *slow = head;
+        node *fast = head;
+        while (fast != NULL && fast->next != NULL)
+        {
+            slow = slow->next;
+            fast = fast->next->next;
+
+            if (fast == slow)
+            {
+                return true;
+            }
+        }
+        return false;
+    }
+    void deletecycle(node *&head)
+    {
+        node *slow = head;
+        node *fast = head;
+        do
+        {
+            slow = slow->next;
+            fast = fast->next->next;
+        } while (slow != fast);
+        fast = head;
+        while (slow->next != fast->next)
+        {
+            slow = slow->next;
+            fast = fast->next;
+        }
+        slow->next = NULL;
+    }
+    void insertDoublyAtHead(node *&head, int val)
+    {
+        node *n = new node(val);
+        n->next = head;
+        if (head != NULL)
+        {
+            head->prev = n;
+        }
+        head = n;
+    }
+    void insertDoublyAtTail(node *&head, int val)
+    {
+        node *n = new node(val);
+        node *temp = head;
+
+        if (head == NULL)
+        {
+            insertDoublyAtHead(head, val);
+            return;
+        }
+        while (temp->next != NULL)
+        {
+            temp = temp->next;
+        }
+        temp->next = n;
+        n->prev = temp;
+    }
+    void doublydeleteathead(node *&head)
+    {
+        node *todelete = head;
+        head = head->next;
+        head->prev = NULL;
+        delete todelete;
+    }
+    void doublyminedelete(node *&head, int val)
+    {
+        if (val == 1)
+        {
+            doublydeleteathead(head);
+            return;
+        }
+        node *temp = head;
+        while (temp->next != NULL && temp->next->dat != val)
+        {
+            temp = temp->next;
+        }
+        node *todelete = temp->next;
+        temp->next = temp->next->next;
+        if (temp->next->next != NULL)
+        {
+            temp->next->next->prev = temp;
+        }
+
+        delete todelete;
+    }
+    int length(node *head)
+    {
+        int l = 0;
+        node *temp = head;
+        while (temp != NULL)
+        {
+            temp = temp->next;
+            l++;
+        }
+        return l;
+    }
+    node *kappend(node *&head, int k)
+    {
+        node *newhead;
+        node *newtail;
+        node *tail = head;
+        int l = length(head);
+        int count = 1;
+        k = k % l;
+        while (tail->next != NULL)
+        {
+            if (count == l - k)
+            {
+                newtail = tail;
+            }
+            if (count == l - k + 1)
+            {
+                newhead = tail;
+            }
+            tail = tail->next;
+            count++;
+        }
+        newtail->next = NULL;
+        tail->next = head;
+        return newhead;
+    }
+    int checcintersection(node *&head1, node *&head2)
+    {
+        int l1 = length(head1);
+        int l2 = length(head2);
+        int d = 0;
+        node *ptr1;
+        node *ptr2;
+        if (l1 > l2)
+        {
+            d = l1 - l2;
+            ptr1 = head1;
+            ptr2 = head2;
+        }
+        else
+        {
+            d = l2 - l1;
+            ptr2 = head1;
+            ptr1 = head2;
+        }
+
+        while (d)
+        {
+            ptr1 = ptr1->next;
+            if (ptr1 == NULL)
+            {
+                return -1;
+            }
+            d--;
+        }
+        while (ptr1 != nullptr && ptr2 != nullptr)
+        {
+            if (ptr1 == ptr2)
+            {
+                return ptr1->dat;
+            }
+            ptr1 = ptr1->next;
+            ptr2 = ptr2->next;
+        }
+        return -1;
+    }
+    void mekintersect(node *&head1, node *&head2, int pos)
+    {
+        node *temp1 = head1;
+        while (--pos)
+        {
+            temp1 = temp1->next;
+        }
+        node *temp2 = head2;
+        while (temp2->next != NULL)
+        {
+            temp2 = temp2->next;
+        }
+        temp2->next = temp1;
+    }
+    node *mergell(node *&head1, node *head2)
+    {
+        node *p1 = head1;
+        node *p2 = head2;
+        node *bakanode = new node(-1);
+        node *p3 = bakanode;
+        while (p1 != NULL && p2 != NULL)
+        {
+            if (p1->dat < p2->dat)
+            {
+                p3->next = p1;
+                p1 = p1->next;
+            }
+            else
+            {
+                p3->next = p2;
+                p2 = p2->next;
+            }
+            p3 = p3->next;
+        }
+        while (p1 != NULL)
+        {
+            p3->next = p1;
+            p1 = p1->next;
+            p3 = p3->next;
+        }
+        while (p2 != NULL)
+        {
+            p3->next = p2;
+            p2 = p2->next;
+            p3 = p3->next;
+        }
+        return bakanode->next;
+    }
+    node *mergerecll(node *&head1, node *head2)
+    {
+        if (head1 == NULL)
+        {
+            return head2;
+        }
+        if (head2 == NULL)
+        {
+            return head1;
+        }
+        node *result;
+        if (head1->dat < head2->dat)
+        {
+            result = head1;
+            result->next = mergerecll(head1->next, head2);
+        }
+        else
+        {
+            result = head2;
+            result->next = mergerecll(head1, head2->next);
+        }
+        return result;
+    }
+    void insertcircularathead(node *&head, int val)
+    {
+        node *n = new node(val);
+        if (head == NULL)
+        {
+            n->next = n;
+            head = n;
+            return;
+        }
+        node *temp = head;
+        while (temp->next != head)
+        {
+            temp = temp->next;
+        }
+        temp->next = n;
+        n->next = head;
+        head = n;
+    }
+    void insertcircularattail(node *&head, int val)
+    {
+        if (val == 1)
+        {
+            insertcircularathead(head, val);
+            return;
+        }
+        node *n = new node(val);
+        node *temp = head;
+        while (temp->next != head)
+        {
+            temp = temp->next;
+        }
+        temp->next = n;
+        n->next = head;
+    }
+    void circulardisplay(node *head)
+    {
+        node *temp = head;
+        do
+        {
+            cout << temp->dat << "->";
+            temp = temp->next;
+        } while (temp != head);
+        cout << endl;
+    }
+    void ciculardeleteathead(node *&head)
+    {
+        node *temp = head;
+        while (temp->next != head)
+        {
+            temp = temp->next;
+        }
+        node *todelete = head;
+        temp->next = head->next;
+        head = head->next;
+        delete todelete;
+    }
+    void circulardeleteattail(node *&head, int pos)
+    {
+        if (pos == 1)
+        {
+            ciculardeleteathead(head);
+            return;
+        }
+        node *temp = head;
+        int cont = 1;
+        while (cont != pos - 1)
+        {
+            temp = temp->next;
+            cont++;
+        }
+        node *todelete = temp->next;
+        temp->next = temp->next->next;
+        delete todelete;
+    }
+    void evenafterodd(node *&head)
+    {
+        node *odd = head;
+        node *even = head->next;
+        node *evenstart = even;
+        while (odd->next != NULL && even->next != NULL)
+        {
+            odd->next = even->next;
+            odd = odd->next;
+            even->next = odd->next;
+            even = even->next;
+        }
+        odd->next = evenstart;
+        if (odd->next == NULL)
+        {
+            even->next = NULL;
+        }
+    }
+};
+int main()
+{
+    node a(7);
+    node *head = NULL;
+    // node *head2 = NULL;
+    int arr1[] = {1, 2, 3, 4, 5, 6, 7};
+    // int arr2[] = {2, 3, 6};
+    for (int i = 0; i < 7; i++)
+    {
+        a.insertAtTail(head, arr1[i]);
+    }
+    // for (int i = 0; i < 3; i++)
+    // {
+    //     a.insertAtTail(head2, arr2[i]);
+    // }
+    a.display(head);
+    a.evenafterodd(head);
+    a.display(head);
+    // a.display(head2);
+    // node *newhead = a.mergerecll(head1, head2);
+    // a.display(newhead);
+    // a.insertcircularattail(head, 1);
+    // a.insertcircularattail(head, 2);
+    // a.insertcircularattail(head, 3);
+    // a.insertcircularattail(head, 4);
+    // a.insertcircularattail(head, 5);
+    // a.insertcircularattail(head, 6);
+    // a.circulardisplay(head);
+    // a.insertcircularathead(head, 69);
+    // a.circulardisplay(head);
+    // a.circulardeleteattail(head, 1);
+    // a.circulardisplay(head);
+    // cout << a.detectcycle(head) << endl;
+    // a.insertDoublyAtTail(head2, 9);
+    // a.insertDoublyAtTail(head2, 10);
+    // a.mekintersect(head1, head2, 5);
+    // a.display(head1);
+    // a.display(head2);
+    // cout << a.checcintersection(head1, head2) << endl;
+    // node *newhead = a.kappend(head, 3);
+    // a.display(newhead);
+    // a.doublyminedelete(head, 6);
+    // a.display(head);
+    // a.makecycle(head, 4);
+    // cout << a.detectcycle(head) << endl;
+    // a.deletecycle(head);
+    // cout << a.detectcycle(head) << endl;
+    // a.display(head);
+    // int k = 2;
+    // node *newhead = a.revkll(head, k);
+    // a.display(newhead);
+    // node *newhead = a.revrecll(head);
+    // a.display(newhead);
+    // if (a.search(head, 2) != -1)
+    // {
+    //     cout << "element found at " << a.search(head, 2) << " ";
+    // }
+    // else
+    // {
+    //     cout << "not";
+    // }
+    // a.deletefirstnode(head);
+    // a.display(head);
+}
\ No newline at end of file
diff --git a/snek/bin/Debug/snek.exe b/snek/bin/Debug/snek.exe
new file mode 100644
index 0000000..980a407
Binary files /dev/null and b/snek/bin/Debug/snek.exe differ
diff --git a/snek/include/food.h b/snek/include/food.h
new file mode 100644
index 0000000..341845c
--- /dev/null
+++ b/snek/include/food.h
@@ -0,0 +1,18 @@
+#ifndef FOOD_H
+#define FOOD_H
+#include<windows.h>
+#include<time.h>
+#include<stdlib.h>
+const int height=30,width=60;
+class food
+{
+
+    private:
+        COORD pos;
+    public:
+        food();
+        void genfood();
+        COORD getpos();
+};
+
+#endif // FOOD_H
diff --git a/snek/include/snake.h b/snek/include/snake.h
new file mode 100644
index 0000000..7f8ba62
--- /dev/null
+++ b/snek/include/snake.h
@@ -0,0 +1,25 @@
+#ifndef SNAKE_H
+#define SNAKE_H
+#include<windows.h>
+
+class snake
+{
+    private:
+     COORD pos;
+     int len;
+     int vel;
+     int direction;
+
+    public:
+        snake(COORD pos,int vel);
+        void changedir(char dir);
+        void movesnek();
+        COORD getpos();
+
+        bool eaten(COORD foodpos);
+
+        void grow();
+        bool snakecollided();
+};
+
+#endif // SNAKE_H
diff --git a/snek/main.cpp b/snek/main.cpp
new file mode 100644
index 0000000..9715912
--- /dev/null
+++ b/snek/main.cpp
@@ -0,0 +1,78 @@
+#include <iostream>
+#include "snake.h"
+#include "food.h"
+#include<conio.h>
+using namespace std;
+snake snake({width/2,height/2},1);
+food food;
+int x=10,y=10;
+void board()
+{
+    COORD snakepos=snake.getpos();
+    COORD foodpos=food.getpos();
+    cout<<"\n\n\n\n\n\n";
+    for (int i=0;i<height;i++)
+    {
+        cout<<"\t\t\t#";
+        for(int j=0;j<width-1;j++)
+        {
+            if(i==0||i==height-1)
+            {
+                cout<<"#";
+            }
+            else if(i==snakepos.Y && j+1==snakepos.X)
+            {
+                cout<<"D";
+            }
+            else if(i==foodpos.Y && j+1==foodpos.X)
+            {
+                cout<<"*";
+            }
+            else
+            {
+                cout<<" ";
+            }
+        }
+        cout<<"#\n";
+    }
+};
+int main()
+{
+    bool gameover = false;
+
+    while(!gameover)
+   {
+       board();
+       if(GetAsyncKeyState('W'))
+       {
+            snake.changedir('w');
+        }
+      else  if(GetAsyncKeyState('A'))
+       {
+            snake.changedir('a');
+        }
+        else if(GetAsyncKeyState('S'))
+       {
+            snake.changedir('s');
+        }
+        else if(GetAsyncKeyState('D'))
+       {
+            snake.changedir('d');
+        }
+           snake.movesnek();
+
+         if(snake.eaten(food.getpos()))
+         {
+             food.genfood();
+             snake.grow();
+         }
+         if(snake.snakecollided())
+         {
+             cout<<"GAME OVER";
+             gameover = true;
+
+         }
+       SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE),{0,0});
+   }
+   return 0;
+}
diff --git a/snek/obj/Debug/main.o b/snek/obj/Debug/main.o
new file mode 100644
index 0000000..b593caf
Binary files /dev/null and b/snek/obj/Debug/main.o differ
diff --git a/snek/obj/Debug/src/food.o b/snek/obj/Debug/src/food.o
new file mode 100644
index 0000000..a7c3c3f
Binary files /dev/null and b/snek/obj/Debug/src/food.o differ
diff --git a/snek/obj/Debug/src/snake.o b/snek/obj/Debug/src/snake.o
new file mode 100644
index 0000000..89f1221
Binary files /dev/null and b/snek/obj/Debug/src/snake.o differ
diff --git a/snek/snek.cbp b/snek/snek.cbp
new file mode 100644
index 0000000..9221773
--- /dev/null
+++ b/snek/snek.cbp
@@ -0,0 +1,47 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_project_file>
+	<FileVersion major="1" minor="6" />
+	<Project>
+		<Option title="snek" />
+		<Option pch_mode="2" />
+		<Option compiler="gcc" />
+		<Build>
+			<Target title="Debug">
+				<Option output="bin/Debug/snek" prefix_auto="1" extension_auto="1" />
+				<Option object_output="obj/Debug/" />
+				<Option type="1" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-g" />
+					<Add directory="include" />
+				</Compiler>
+			</Target>
+			<Target title="Release">
+				<Option output="bin/Release/snek" prefix_auto="1" extension_auto="1" />
+				<Option object_output="obj/Release/" />
+				<Option type="1" />
+				<Option compiler="gcc" />
+				<Compiler>
+					<Add option="-O2" />
+					<Add directory="include" />
+				</Compiler>
+				<Linker>
+					<Add option="-s" />
+				</Linker>
+			</Target>
+		</Build>
+		<Compiler>
+			<Add option="-Wall" />
+			<Add option="-fexceptions" />
+		</Compiler>
+		<Unit filename="include/food.h" />
+		<Unit filename="include/snake.h" />
+		<Unit filename="main.cpp" />
+		<Unit filename="src/food.cpp" />
+		<Unit filename="src/snake.cpp" />
+		<Extensions>
+			<code_completion />
+			<debugger />
+		</Extensions>
+	</Project>
+</CodeBlocks_project_file>
diff --git a/snek/snek.depend b/snek/snek.depend
new file mode 100644
index 0000000..3393394
--- /dev/null
+++ b/snek/snek.depend
@@ -0,0 +1,22 @@
+# depslib dependency file v1.0
+1598523400 source:c:\users\bishal\documents\snek\main.cpp
+	<iostream>
+	"snake.h"
+	"food.h"
+	<conio.h>
+
+1598343294 c:\users\bishal\documents\snek\include\snake.h
+	<windows.h>
+
+1598523275 source:c:\users\bishal\documents\snek\src\snake.cpp
+	"snake.h"
+	"food.h"
+
+1598459995 source:c:\users\bishal\documents\snek\src\food.cpp
+	"food.h"
+
+1598342165 c:\users\bishal\documents\snek\include\food.h
+	<windows.h>
+	<time.h>
+	<stdlib.h>
+
diff --git a/snek/snek.layout b/snek/snek.layout
new file mode 100644
index 0000000..2262a66
--- /dev/null
+++ b/snek/snek.layout
@@ -0,0 +1,30 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
+<CodeBlocks_layout_file>
+	<FileVersion major="1" minor="0" />
+	<ActiveTarget name="Debug" />
+	<File name="include\food.h" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="-7" zoom_2="0">
+		<Cursor>
+			<Cursor1 position="42" topLine="0" />
+		</Cursor>
+	</File>
+	<File name="main.cpp" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="-6" zoom_2="0">
+		<Cursor>
+			<Cursor1 position="1667" topLine="38" />
+		</Cursor>
+	</File>
+	<File name="src\snake.cpp" open="1" top="1" tabpos="3" split="0" active="1" splitpos="0" zoom_1="-8" zoom_2="0">
+		<Cursor>
+			<Cursor1 position="819" topLine="35" />
+		</Cursor>
+	</File>
+	<File name="src\food.cpp" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="-6" zoom_2="0">
+		<Cursor>
+			<Cursor1 position="170" topLine="0" />
+		</Cursor>
+	</File>
+	<File name="include\snake.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="-8" zoom_2="0">
+		<Cursor>
+			<Cursor1 position="353" topLine="0" />
+		</Cursor>
+	</File>
+</CodeBlocks_layout_file>
diff --git a/snek/src/food.cpp b/snek/src/food.cpp
new file mode 100644
index 0000000..0eee98e
--- /dev/null
+++ b/snek/src/food.cpp
@@ -0,0 +1,16 @@
+#include "food.h"
+
+food::food()
+{
+    genfood();
+}
+void food::genfood()
+{
+    srand(time(0));
+    pos.X= (rand() % (width-2))+ 1;
+    pos.Y= (rand() %(height -2))+ 1;
+}
+COORD food::getpos()
+{
+    return pos;
+}
diff --git a/snek/src/snake.cpp b/snek/src/snake.cpp
new file mode 100644
index 0000000..cfee961
--- /dev/null
+++ b/snek/src/snake.cpp
@@ -0,0 +1,61 @@
+#include "snake.h"
+#include"food.h"
+snake::snake(COORD pos,int vel)
+{
+    this->pos=pos;
+    this->vel=vel;
+    len=1;
+    direction='n';
+}
+void snake::changedir(char dir)
+{
+    direction=dir;
+}
+void snake::movesnek()
+{
+    switch(direction)
+    {
+        case 'w': pos.Y -= vel;
+        break;
+        case 'a': pos.X -= vel;
+        break;
+        case 's': pos.Y += vel;
+        break;
+        case 'd': pos.X += vel;
+        break;
+    }
+}
+
+COORD snake :: getpos()
+{
+    return pos;
+}
+
+bool snake::eaten(COORD foodpos)
+{
+    if(foodpos.X==pos.X && foodpos.Y==pos.Y)
+    {
+        return true;
+    }
+    else
+    {
+        return false;
+    }
+}
+
+void snake::grow()
+{
+    len++;
+}
+
+bool snake::snakecollided()
+{
+    if(pos.X<1 || pos.X>=width-1|| pos.Y<1 || pos.Y>=height-1)
+    {
+        return true;
+    }
+    else
+    {
+        return false;
+    }
+}