A repository of Data Structures and all the programs in different languages.
For your contribution follow our guidelines
- 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
- 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
ALL RIGHTS RESERVED:
TradeMark : TechOus
Admins: 1. Nidhi Mittal
2. Aniket Batabyal