{"id":19933431,"url":"https://github.com/kinshuk-code-1729/data-structures-and-algorithms","last_synced_at":"2025-05-03T11:33:35.307Z","repository":{"id":50275168,"uuid":"432480380","full_name":"kinshuk-code-1729/Data-Structures-and-Algorithms","owner":"kinshuk-code-1729","description":"This repository contains certain programs of DSA.","archived":false,"fork":false,"pushed_at":"2024-04-13T18:26:14.000Z","size":223,"stargazers_count":4,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-14T08:52:17.224Z","etag":null,"topics":["arrays","data-structures-and-algorithms","data-structures-c","graphs","linked-lists","queues","searching-sorting","stacks","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc0-1.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kinshuk-code-1729.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2021-11-27T14:18:36.000Z","updated_at":"2024-04-15T19:42:37.915Z","dependencies_parsed_at":"2024-04-13T19:52:32.960Z","dependency_job_id":null,"html_url":"https://github.com/kinshuk-code-1729/Data-Structures-and-Algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kinshuk-code-1729%2FData-Structures-and-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kinshuk-code-1729%2FData-Structures-and-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kinshuk-code-1729%2FData-Structures-and-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kinshuk-code-1729%2FData-Structures-and-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kinshuk-code-1729","download_url":"https://codeload.github.com/kinshuk-code-1729/Data-Structures-and-Algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224360119,"owners_count":17298319,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["arrays","data-structures-and-algorithms","data-structures-c","graphs","linked-lists","queues","searching-sorting","stacks","tree-structure"],"created_at":"2024-11-12T23:13:41.582Z","updated_at":"2024-11-12T23:13:41.656Z","avatar_url":"https://github.com/kinshuk-code-1729.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 👀 This repository contains various codes of _Data Structures and Algorithms_ from _[GFG](https://www.geeksforgeeks.org/), [Leetcode](https://leetcode.com/) and [Hackerrank](https://www.hackerrank.com/)_.\n\n![DSA Image](https://www.thinknexttraining.com/images/data-structues-and-algorithms-mob.jpg)\n\n## 🎆 What is a data structure ?\n- A data structure is a special way of organizing and storing data in a computer so that it can be used efficiently.\n- **Array, LinkedList, Stack, Queue, Tree, Graph** etc are all basic data structures that store the data in a special way so that we can access and use the data stored in them efficiently.\n\n## 🎇 Why do we need data structures ?\n- Data structures are used in almost every program or software system.\n- Specific data structures are essential ingredients of many efficient algorithms, and make possible the management of huge amounts of data, such as large integrated collection of databases.\n- In software design, Data structures are known to be major factors for collection, storing and organizing of data rather than algorithms in some programming languages.\n- Often Data structures are used in the combination of algorithms.\n\n## ✨ How are data structures used in programming language ?\n- The data structure is not any programming language like _C, C++, Java,_ etc.\n- It is a set of algorithms that we can use in any programming language to structure the data in the memory.\n- To structure the data in memory, **_'n'_** number of algorithms were proposed, and all these algorithms are known as Abstract data types.\n\n## ⭐ Classification of Data Structure : \n![classification of DS](https://media.geeksforgeeks.org/wp-content/uploads/20220520182504/ClassificationofDataStructure-660x347.jpg)\n\n- \u003cins\u003e **_Linear_ data structure\u003c/ins\u003e :** Data structure in which data elements are arranged sequentially or linearly, where each element is attached to its previous and next adjacent elements, is called a linear data structure.\u003cbr\u003e **_Examples of linear data structures are [array](https://www.geeksforgeeks.org/array/), [stack](https://www.geeksforgeeks.org/stack/), [queue](https://www.geeksforgeeks.org/queue/), [linked list](https://www.geeksforgeeks.org/data-structures/linked-list/), etc._** \u003cbr\u003e\n\n  - \u003cins\u003e **_Static_ data structure\u003c/ins\u003e :** Static data structure has a fixed memory size. It is easier to access the elements in a static data structure.\u003cbr\u003e **_An example of this data structure is an [array](https://www.geeksforgeeks.org/array/)._**\n  - \u003cins\u003e **_Dynamic_ data structure\u003c/ins\u003e :** In dynamic data structure, the size is not fixed. It can be randomly updated during the runtime which may be considered efficient concerning the memory (space) complexity of the code.\u003cbr\u003e **_Examples of this data structure are [queue](https://www.geeksforgeeks.org/queue/), [stack](https://www.geeksforgeeks.org/stack/), etc._**\n\n- \u003cins\u003e **_Non-linear_ data structure\u003c/ins\u003e :** Data structures where data elements are not placed sequentially or linearly are called non-linear data structures. In a non-linear data structure, we can’t traverse all the elements in a single run only.\u003cbr\u003e **_Examples of non-linear data structures are [trees](https://www.geeksforgeeks.org/tree-data-structure/) and [graphs](https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/)._**\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkinshuk-code-1729%2Fdata-structures-and-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkinshuk-code-1729%2Fdata-structures-and-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkinshuk-code-1729%2Fdata-structures-and-algorithms/lists"}