A repository of implementations for Data Structures in different languages. Here we focus on implementation of Data Structures. If you want to contribute via Algorithms then please check out this Algorithms repo.
For your contribution follow our new guidelines
PRs count if:
-
Submitted during the month of October AND
-
Submitted in a public repo AND (
- The PR is labelled as
hacktoberfest-acceptedby a maintainer OR - Submitted in a repo with the
hacktoberfesttopic AND (- The PR is merged OR
- The PR has been approved
)
- The PR is labelled as
)
-
As a part of this update your PRs will be marked as hacktoberfest-accepted label before merging and don't get shocked PRs opened in this repository we will be counted in the Hacktober Fest 20.
Also we will soon be launching the application to check your PRs for the Hacktober Fest20
Happy Hacking !
We are following Contributor Covenant Code of Conduct.
- 1D Arrays
- 2D Arrays
- 3D Arrays
- 4D Arrays
- INBUILT
- MISC
- JAGGED
- Arrangement and Rearrangement
- ARRAY ROTATION
- Rotate array in O(n)
- Rotate array to right
- Rotate array cyclically
- Rotate array by K
- Rotate matrix by 90
- Find the min count to get original array from rotated array
- Find Maximum Hamming Distance
- Find Maximum value with only rotations allowed
- Find Minimum Element in Rotated Sorted Array
- Find pair with given Sum in Rotated Sorted Array
- Occurances
- Order Statistics
- Pattern Printing
- SINGLE
- DOUBLE
- CIRCULAR
- INBUILT LISTS
- MISC
- Find the nth node from the end in Single Linked List
- JAVA
- APPROACH 1: Compute the size while adding
- APPROACH 2: Using two current pointers
- APPROACH 3: Using hashtable
- APPROACH 4: Using Hashtable while adding
- APPROACH 5: Finding node in one scan
- APPROACH 6: Using recursion
- JAVA
- Find the nth node from the end in Single Linked List
- FIXED ARRAY STACK
- DYNAMIC ARRAY STACK
- LINKED STACK
- INBUILT
- MISC
- C
- C++
- Python
- TRAVERSALS
- MISC
- Construct Tree using Inorder and Preorder
- Construct Tree with Inorder and Postorder
- Find right nodes
- Print odd level nodes
- Print Top View of Binary Tree
- Print Cousins of a given node in Binary Tree
- Count leaf and non leaf nodes
- Find the height of the tree
- Construct Mirror Tree
- Representation of Graph - Adjacency list
©️ TECHOUS 2020