diff --git a/readme.md b/readme.md
index 80ad9cc..13a1ac9 100644
--- a/readme.md
+++ b/readme.md
@@ -32,69 +32,69 @@ The project will include examples in the following languages:
 
 The project will include examples of the following data structures:
 
-- Arrays
-  - Static Array
-  - Dynamic Array
-- Linked List
-  - Singly Linked List
-  - Doubly Linked List
-  - Circular Linked List
-- Stack (LIFO)
-- Queue (FIFO) and Deque (Doubly Ended Queue)
-- Hash Table
-  - KV Hash Table
-  - Collision Detection
-- Trees
-  - Binary Tree
-  - Binary Search Tree
-  - AVL Tree (Self-Balancing)
-  - Red-Black Tree (Self-Balancing)
-  - B-Tree (Self-Balancing)
-  - Trie (Prefix Tree)
-  - Tree algorithms
-- Graphs
-  - Adjacency List
-  - Adjacency Matrix
-  - Directed Graphs
-  - Weighted Graphs
-  - Adjacency List/Matrix
-- Disjoint Set (Union-Find)
+- [ ] Arrays
+  - [ ] Static Array
+  - [ ] Dynamic Array
+- [ ] Linked List
+  - [ ] Singly Linked List
+  - [ ] Doubly Linked List
+  - [ ] Circular Linked List
+- [ ] Stack (LIFO)
+- [ ] Queue (FIFO) and Deque (Doubly Ended Queue)
+- [ ] Hash Table
+  - [ ] KV Hash Table
+  - [ ] Collision Detection
+- [ ] Trees
+  - [ ] Binary Tree
+  - [ ] Binary Search Tree
+  - [ ] AVL Tree (Self-Balancing)
+  - [ ] Red-Black Tree (Self-Balancing)
+  - [ ] B-Tree (Self-Balancing)
+  - [ ] Trie (Prefix Tree)
+  - [ ] Tree algorithms
+- [ ] Graphs
+  - [ ] Adjacency List
+  - [ ] Adjacency Matrix
+  - [ ] Directed Graphs
+  - [ ] Weighted Graphs
+  - [ ] Adjacency List/Matrix
+- [ ] Disjoint Set (Union-Find)
 
 ## Algorithms
 
-- Sorting
-  - Bubble Sort (Maybe)
-  - Selection Sort (Maybe)
-  - Insertion Sort
-  - Merge Sort
-  - Quick Sort
-  - Heap Sort
-- Searching Algorithms
-  - Linear Search
-  - Binary Search
-- Graph Traversal
-  - Depth-First Search (DFS)
-  - Breadth-First Search (BFS)
-  - Dijkstra's Algorithm
-  - Bellman-Ford Algorithm
-  - Floyd-Warshall Algorithm
-  - Kruskal's Algorithm
-  - Prim's Algorithm
-  - Minimum Spanning Tree (MST)
-- Recursion and Backtracking
-- Dynamic Programming
-  - Memoization
-  - Tabulation
-- Greedy Algorithms
-  - Fractional Knapsack Problem
-  - Activity Selection Problem
-  - Huffman Coding
-- Sieve of Eratosthenes (Prime Number Generation)
-- Euclidean Algorithm (Greatest Common Divisor)
-- String Algorithms
-  - KMP Algorithm
-  - Rabin-Karp Algorithm
-- Bit Manipulation
+- [ ] Sorting
+  - [ ] Bubble Sort (Maybe)
+  - [ ] Selection Sort (Maybe)
+  - [ ] Insertion Sort
+  - [ ] Merge Sort
+  - [ ] Quick Sort
+  - [ ] Heap Sort
+- [ ] Searching Algorithms
+  - [ ] Linear Search
+  - [ ] Binary Search
+- [ ] Graph Traversal
+  - [ ] Depth-First Search (DFS)
+  - [ ] Breadth-First Search (BFS)
+  - [ ] Dijkstra's Algorithm
+  - [ ] Bellman-Ford Algorithm
+  - [ ] Floyd-Warshall Algorithm
+  - [ ] Kruskal's Algorithm
+  - [ ] Prim's Algorithm
+  - [ ] Minimum Spanning Tree (MST)
+- [ ] Recursion and Backtracking
+- [ ] Dynamic Programming
+  - [ ] Memoization
+  - [ ] Tabulation
+- [ ] Greedy Algorithms
+  - [ ] Fractional Knapsack Problem
+  - [ ] Activity Selection Problem
+  - [ ] Huffman Coding
+- [ ] Sieve of Eratosthenes (Prime Number Generation)
+- [ ] Euclidean Algorithm (Greatest Common Divisor)
+- [ ] String Algorithms
+  - [ ] KMP Algorithm
+  - [ ] Rabin-Karp Algorithm
+- [ ] Bit Manipulation
 
 ## License