Skip to content

krishna14kant/Data-Structures-

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

837 Commits
Bellman Ford Algorithm in Java
Bellman Ford Algorithm in Java
 
 
Binary-Search-Tree
Binary-Search-Tree
 
 
C++
C++
 
 
Codechef
Codechef
 
 
Codeforces
Codeforces
 
 
Covid-19 Notification
Covid-19 Notification
 
 
Create QR Code
Create QR Code
 
 
Desktop Notifier
Desktop Notifier
 
 
Dynamic Programming
Dynamic Programming
 
 
Golang
Golang
 
 
Graph
Graph
 
 
Greedy
Greedy
 
 
IARCS OPC Judge Problems/C++
IARCS OPC Judge Problems/C++
 
 
Java
Java
 
 
Leetcode
Leetcode
 
 
Python Automation Scripts
Python Automation Scripts
 
 
Stack implementation
Stack implementation
 
 
file-parser
file-parser
 
 
01knapsack.cpp
01knapsack.cpp
 
 
1057A.cpp
1057A.cpp
 
 
1089L.cpp
1089L.cpp
 
 
118A.cpp
118A.cpp
 
 
122A.cpp
122A.cpp
 
 
1288B.cpp
1288B.cpp
 
 
1335B.cpp
1335B.cpp
 
 
1337A.cpp
1337A.cpp
 
 
1337B.cpp
1337B.cpp
 
 
1360A.cpp
1360A.cpp
 
 
1360B.cpp
1360B.cpp
 
 
1371A.cpp
1371A.cpp
 
 
1373B.cpp
1373B.cpp
 
 
1397A.cpp
1397A.cpp
 
 
1401A.cpp
1401A.cpp
 
 
1451A.cpp
1451A.cpp
 
 
1451B.cpp
1451B.cpp
 
 
1454A.cpp
1454A.cpp
 
 
1462C.cpp
1462C.cpp
 
 
1475B.cpp
1475B.cpp
 
 
1476A.cpp
1476A.cpp
 
 
149A.cpp
149A.cpp
 
 
151A.cpp
151A.cpp
 
 
1521A.cpp
1521A.cpp
 
 
1535B.cpp
1535B.cpp
 
 
1542A.cpp
1542A.cpp
 
 
1549B.cpp
1549B.cpp
 
 
1551A.cpp
1551A.cpp
 
 
1551B1.cpp
1551B1.cpp
 
 
1559A.cpp
1559A.cpp
 
 
1559B.cpp
1559B.cpp
 
 
1560D.cpp
1560D.cpp
 
 
1579D_CF.cpp
1579D_CF.cpp
 
 
1579E1_CF.cpp
1579E1_CF.cpp
 
 
1579E2_CF.cpp
1579E2_CF.cpp
 
 
1583A.cpp
1583A.cpp
 
 
1593A.cpp
1593A.cpp
 
 
1593B.cpp
1593B.cpp
 
 
1593D1.cpp
1593D1.cpp
 
 
1598A.cpp
1598A.cpp
 
 
1A.cpp
1A.cpp
 
 
266B.cpp
266B.cpp
 
 
267A.cpp
267A.cpp
 
 
268B.cpp
268B.cpp
 
 
270A.cpp
270A.cpp
 
 
299B.cpp
299B.cpp
 
 
34B.cpp
34B.cpp
 
 
37A.cpp
37A.cpp
 
 
41A.cpp
41A.cpp
 
 
45A.cpp
45A.cpp
 
 
474A.cpp
474A.cpp
 
 
52A.cpp
52A.cpp
 
 
556A.cpp
556A.cpp
 
 
579A.cpp
579A.cpp
 
 
58A.cpp
58A.cpp
 
 
63A.cpp
63A.cpp
 
 
69A.cpp
69A.cpp
 
 
729A.cpp
729A.cpp
 
 
959A.cpp
959A.cpp
 
 
977B.cpp
977B.cpp
 
 
AVL.c
AVL.c
 
 
Algorithm.pdf
Algorithm.pdf
 
 
AllFactors.cpp
AllFactors.cpp
 
 
BinaryTree_ReverseLevelOrder.cpp
BinaryTree_ReverseLevelOrder.cpp
 
 
BucketSort.cpp
BucketSort.cpp
 
 
Build_and_Traverse_BST.cpp
Build_and_Traverse_BST.cpp
 
 
Calculator with C++
Calculator with C++
 
 
Ceasar.py
Ceasar.py
 
 
Checking if a linked list is Palindrome.txt
Checking if a linked list is Palindrome.txt
 
 
Codeforces_1598C.cpp
Codeforces_1598C.cpp
 
 
CppLCS.cpp
CppLCS.cpp
 
 
Dijkstras_Algorithm.cpp
Dijkstras_Algorithm.cpp
 
 
Dutch_national_flag_problem.cpp
Dutch_national_flag_problem.cpp
 
 
Floyd_Warshall_Algorithm.py
Floyd_Warshall_Algorithm.py
 
 
Gregor and the Pawn Game.cpp
Gregor and the Pawn Game.cpp
 
 
Hasher.py
Hasher.py
 
 
Heap-Sort.cpp
Heap-Sort.cpp
 
 
HeapSort.java
HeapSort.java
 
 
Intro.html
Intro.html
 
 
Iterative_tree_traversals.cpp
Iterative_tree_traversals.cpp
 
 
KMP_algo.py
KMP_algo.py
 
 
KadaneAlgo.cpp
KadaneAlgo.cpp
 
 

Repository files navigation

Data-Structures-

  • what is meant by data structures?
  1. data structure is a data organization, management, and storage format that enables efficient access and modification.
  2. precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

Use of data-structures?

  1. Data structures serve as the basis for abstract data types.
  2. Data structures provide a means to manage large amount of data efficiently for uses such as large databases and internet indexing services.
  3. Data structures can be used to organize the storage and retrieval of information stored in both main memory and secondary memory.

Types in data structure?

  1. data structure is divided into primitive andnon-primitive.
  2. non primitive is further divided into linear and non linear.
  3. non linear divided into trees and graphs.
  4. linear is divided into static and dynamic.
  5. dynamic is divided into linked list ,stack and queue.

Steps to Contribute 📑

  1. You have to Fork the Repository to your profile.
  2. Create an issue mentioning what kind of changes you want to make for betterment of this repo.
  3. Once the maintainer assigns you to the issue you can commit the changes.
  4. Send the pull request mentioning all the changes you've made in detail.

All are welcomed to make changes :)

hacktoberfest, hacktoberfest2021, hacktoberfest-accepted

About

hacktoberfest hacktoberfest2020 hacktoberfest-accepted

Topics

hacktoberfest hacktoberfest2020 hacktoberfest-accepted

Resources

Readme
Activity

Stars

45 stars

Watchers

1 watching

Forks

468 forks
Report repository

Packages

No packages published

Contributors 271

+ 257 contributors

Languages