This repository contains Java implementations of Data Structures and Algorithms developed during a Data Structures Bootcamp.
It is designed to help understand core concepts through clean, readable, and beginner-friendly code.
The implementations prioritize simplicity and correctness over heavy optimization, making them suitable for learning, revision, and interview preparation.
The repository is organized into folders based on topic for better navigation and clarity.
This directory contains implementations of fundamental data structures in Java, including:
- Linked Lists:
- Singly Linked Lists.
- Circular Linked Lists.
- Stacks :
- Linear Stack.
- Queues :
- Linear Queue.
- Circular Queue.
- Trees :
- Binary Tree.
- Binary Search Tree.
- AVL Tree.
- Graphs :
- Adjaceny Matrix.
- Adjacency List.
- BFS algorithm.
- DFS algorithm.
- Dijkstra's algorithm.
- Kruskal's algorithm.
- Prim's algorithm.
This directory includes Java implementations of common searching techniques:
- Linear Search.
- Binary Search.
- Uniform Binary Search.
- Fibonacci Search.
- Interpolation Search.
The implementations demonstrate how different searching strategies behave under different conditions.
This directory contains Java implementations of basic sorting algorithms such as:
- Bubble Sort.
- Selection Sort.
- Insertion Sort.
- Quick Sort.
- Radix Sort.
- Merge Sort.
- Shell Sort.
- Heap sort.
These programs are written to clearly show algorithm flow and logic rather than micro-optimizations.
This directory contains Markdown notes created during the bootcamp sessions.
The notes explain:
- Key concepts.
- Algorithm intuition.
- Important observations.
- Day wise concepts.
- Programming Language: Java.
- Development Environment: Any Java-compatible IDE.
- License: MIT.
-
Clone the repository:
git clone https://github.com/Pranav-173/DS_Bootcamp.git
(or)
git clone https://github.com/Nullkernel/DS_Bootcamp.git