DSKaKhel
Learning Data Structures is a like of Khel (Game), for getting good at this Khel, learn new data structures via contributing to this repository.
If you interested in something amazing or you like Money Heist then try AlgoHeist here.
Contributing Guidelines
For contributions checkout new updated guidelines
Hacktober Fest 22 Updates
PRs count if:
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 22.
Happy Hacking !
Code Of Conduct
We are following Contributor Covenant Code of Conduct.
ARRAYS
- 1D Arrays
- 2D Arrays
- 3D Arrays
- 4D Arrays
- INBUILT
- MISC
- JAGGED
- C
- Arrangement and Rearrangement
- Rearrange Positive and Negative
- Replace even in the stream
- 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
- Find Maximum odd count
- Find missing number with the given duplicate
- Find pairs with sum K
- Occurance of particular number
- Row and Column Sum
- Order Statistics
- Find smallest in 2d matrix
- Find largest element in array
- Find Mean and Median of the array
- Find the K largest Smallest Element
- Find the largest 3 elements
- Pattern Printing
- Spiral Order Matrix
STRINGS
LISTS
- SINGLE
- DOUBLE
- CIRCULAR
- INBUILT LISTS
- MISC
- Find the nth node from the end in Single Linked List
- JAVA
STACKS
- FIXED ARRAY STACK
- DYNAMIC ARRAY STACK
- LINKED STACK
- INBUILT
- MISC
QUEUES
NORMAL QUEUE
DOUBLE ENDED QUEUE
CIRCULAR QUEUE
TREES
BINARY TREES
- TRAVERSALS
- DEPTH FIRST SEARCH
- INORDER
- PREORDER
- POSTORDER
- BREADTH FIRST SEARCH
- LEVEL ORDER
- MISC
- Construct Tree using Inorder and Preorder
- C
- Construct Tree with Inorder and Postorder
- C++
- Find right nodes
- C++
- Print odd level nodes
- C++
- Print Top View of Binary Tree
- C++
- Print Cousins of a given node in Binary Tree
- C++
- Count leaf and non leaf nodes
- C++
- Find the height of the tree
- C++
- Construct Mirror Tree
- C++
HEAPS
GRAPHS
- Representation of Graph - Adjacency list
NOTE : Don't forget to pull before pushing your commits otherwise it will create merge conflicts
:copyright: TECHOUS 2019-22