Data structures and algorithms basics:
- Data structures in Java
- Abstract data types in Java
- Asymptotic bounding or asymptotic analysis
- Asymptotic notations
- How to calculate time complexity of an algorithm
Stack data structure:
Basics :
Implementations :
- Stack using array and linked list
- Stack which returns the minimum element in constant time O(1) using auxiliary stack
- Stack which returns the minimum element in constant time O(1) and constant extra space O(1)
- Evaluating a reverse polish notation
- Stack using two queues
- Two stacks using an array
Queue data structure :
Basics :
Implementations :
- Queue implementation using circular array
- Queue implementation using linked list
- Queue using two stacks
HashMap in Java:
Basics:
Follow My Blog
Get new content delivered directly to your inbox.