Git Product home page Git Product logo

data-structures's Introduction

Welcome to C0D1NG 💐

C0D1NG is an organization that helps everyone to contribute to open source.

List of Contributors 🚀

The GitHub Flow

githubflow

~ CREATE A BRANCH

Create a branch in your project where you can safely experiment and make changes.

  • Add commits in a new branch

~ OPEN A PULL REQUEST

Use a pull request to get feedback on your changes from people across the world.

  • Discuss and review a pull request

~ MERGE AND DEPLOY

Merge your changes into your master branch and deploy your code.

If you are a beginner and want to start your open source journey then

👉 1. Fork this repository

👉 2. Clone on your system

👉 3. Create a Branch

👉 4. Add your name in Contributors.md

👉 5. Add & Commit changes

👉 6. Push changes to GitHub

👉 7. Compare & Submit Pull request

Hurray! Now you are a part of the open source community 🚀🚀🚀

Join our Community 👉🏻 C0D1NG

data-structures's People

Contributors

abhishektandon-github avatar arynn-gupta avatar devmohit-live avatar dhanmoni avatar divya-kumari1 avatar g1joshi avatar geoffreyonyigwamatieso avatar hans-2002 avatar ishan-77 avatar jahnvisrivastava100 avatar kaal-bhairav201 avatar krishita30j avatar kumarnik avatar mergify[bot] avatar neilkerman avatar nishikantaray avatar parshwa52 avatar passionlord avatar pranav108 avatar prateek7071 avatar probot-auto-merge[bot] avatar raghavkaushal03 avatar rakshathavasudev avatar ricardoshillyshalli avatar rohan-2107 avatar sagar-monga avatar sukritishah15 avatar thecoderash avatar vallabhiaf avatar venturo-raj7 avatar

Stargazers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Watchers

avatar

Forkers

cbridges851 krishita30j mochfamir gr8geek dhanmoni hritwikesh aashish2023 sukritishah15 neilkerman givemo sgavil 1880akshay viggi-v sumanth2905 vartika2002 amaan-ahmad sourabhkumar45 anirudhpanda al-habibi-1107 akshadk7 basscoder2808 mk-singhal sunilpanda13 ayushmohanty24 aswanthpp bhakti0302 shloka-gupta rasacharjee devanshuruhela utkarshgoel22 m-e-r-l-i-n jahnvisrivastava100 parshwa52 raghavkaushal03 kritikashah20 rahljoshi sarthakbh321 paigeribera rashita123 sb2356-iiitr pulkitmahajan01 shubhamu78 kumarnik kavyasri-t manojchandrajoshi indu0210 ajay272191 smitarajput gourav5857 pranita736 ale958 anujjain5699 sushil24sk adiksha20 lollasravani black73 sachin4429 dhar15 vedant3620 apekshamarutip1 gauravpatil8778 dannyboii69 mohitbalwani26 shubhank2604 kshitijdarekar code414 sameeksha21 monil28 wjeevika sachinsom93 ashwinkul28 code-value martinezhenry ricardoshillyshalli him9666 swastik-mohapatra divya-kumari1 vinay0909 anujagrawal2000 baibhavvishalpani deepakuma suraj789098 nexweb sagar-monga nitya09m harshitha4444 aviparmar mashiyathussain2 venturo-raj7 aayushee25 devdattapandey2512 saa27 sarthak-27 singhabhishek10 palveet yashaswiadyalu rishika-singh49 nandini3698 fantasy-08 sindhu-321

data-structures's Issues

Palindrome String

Write a program to check if the given string is Palindrome or not

Maximum number of people can work on this issue there is no limits, make sure that the each filename should also contain your username to avoid merge conflicts and overriding.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Palindrome Linked List

Write a program to check whether linked list is palindrome or not.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Depth First Search (DFS)

Write a program to implement depth first search in trees.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Inorder Tree Traversal

Write a program to implement inorder tree traversal.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

AVL Tree Data Structure

I have worked on this program and successfully got output in insertion and deletion operations and added a PR #86

Insertion in Sorted Linked List

Write a program to insert an element in sorted linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Find the largest element in the Array submitted by Abhishek( github:- Abkt2001 )

#include <stdio.h>

int main()
{
int a;
printf("Enter the length of array ");
scanf("%d",&a);

int arr[a],i,j;

printf("Enter the array elements ");

for(i=0;i<a;i++)
    scanf("%d",&arr[i]);

for(i=0;i<a;i++)
    {
        if(arr[i]>arr[i+1])
            {
                j=arr[i];
                arr[i]=arr[i+1];
                arr[i+1]=j;
            }
    }

printf("Largest element in the array is ");
printf("%d",arr[a-1]);

}

kth Node from end of the Linked List

Write a program to find kth node from end of the linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Search Element in Linked List

Write a program to search an element in a linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Size of the Binary Tree

Write a program to find the size of the binary tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Postfix to Prefix Conversion

Write a program to convert postfix expression into prefix expression.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Find Largest Element in an Array

Write a program to find largest element in an array.

Maximum number of people can work on this issue there is no limits, make sure that the each filename should also contain your username to avoid merge conflicts and overriding.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Infix to Prefix Conversion

Write a program to convert infix expression into prefix expression.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Postorder Tree Traversal

Write a program to implement postorder tree traversal.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Reverse a Linked List

Write a program to reverse a linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Sum of Nodes in Binary Tree

Write a program to find the sum of nodes of the binary tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Maximum in Binary Tree

Write a program to find the maximum in binary tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Queue using Stack

Write a program to implement queue using stack.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Middle of the Linked List

Write a program to find the middle of the linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Height of the Binary Tree

Write a program to find the height of the binary tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Search in Binary Search Tree

Write a program to search an element in binary search tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Circular Queue using Linked Lists

Write a program to implement circular queue using linked list.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Lowest Common Ancestor

Write a program to find the lowest common ancestor in binary tree.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Breadth First Search (BFS)

Write a program to implement breadth first search in trees.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Reverse a Queue

Write a program to reverse a queue.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Identical Trees

Write a program to check whether two tree are identical or not.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Preorder Tree Traversal

Write a program to implement preorder tree traversal.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Split a Circular Linked List

Write a program to split a circular linked list in two halves

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Infix to Postfix Conversion

Write a program to convert infix expression into postfix expression.

This issue is open for all, so everyone can work on this issue and every valid pull request will be merged.
Maximum number of people can work on this issue, there is no limitations.

File format 👉🏻 username_filename.extention

👨🏻‍💻 Happy Coding 👩🏻‍💻

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.