⬅️ JAVA
- one dimensional array
- two dimensional array
- three dimensional array
- four dimensional array
- INBUILT
- MISC
- JAGGED ARRAY
- SPIRAL ORDER MATRIX
- SINGLE
- DOUBLE
- CIRCULAR
- MEMORY EFFICIENT DOUBLE LINKED LIST
- UNROLLED LINKED LIST
- SKIP LIST
- INBUILT LISTS
- MISC
- Find the nth node from end in single linked list
- 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
- Find the nth node from end in single linked list
- FIXED ARRAY STACK
- DYNAMIC ARRAY STACK
- LINKED STACK
- INBUILT STACKS
- MISC STACKS
- SIMPLE QUEUE
- FIXED ARRAY SIMPLE QUEUE
- DYNAMIC ARRAY SIMPLE QUEUE
- LINKED SIMPLE QUEUE
- CIRCULAR QUEUE
- FIXED ARRAY CIRCULAR QUEUE
- LINKED CIRCULAR QUEUE
- PRIORITY QUEUE
- FIXED ARRAY PRIORITY QUEUE
- LINKED PRIORITY QUEUE
- HEAPED PRIORITY QUEUE
- MISC QUEUE
- Binary Tree Node Example
- Traversals
- MISC
- Bottom View of a Tree
-
BUBBLE SORT
-
SELECTION SORT
-
INSERTION SORT
-
SHELL SORT
Run on terminal using commands below:
javac sample.java
java sample