• Arrays
• Linked List
• Stacks
• Queues
• Trees
• Graphs
• Dynamic Programming
• Greedy Algorithm
• Backtracking
• Bit Manipulation
• Sorting
• Hashing
• Heaps
• Searching

Arrays

1. Reverse Array
2. Find the maximum element in an array
3. Find the minimum element in an array
4. Find the first duplicate in an array
5. Find the missing number in an array
6. Rotate an array by a given number of positions
7. Check if an array is sorted or not
8. Find the maximum sum of a subarray in an array
9. Find the pair of elements in an array that sum up to a given target
10. Find the first pair of elements in an array that sum up to a given target

Linked List

1. Reverse a linked list
2. Detect a cycle in a linked list
3. Find the middle element of a linked list
4. Find the nth node from the end of a linked list
5. Remove duplicates from a sorted linked list

Stacks

1. Implement a stack using an array
2. Implement a stack using a linked list
3. Evaluate the postfix expression using a stack
4. Implement a queue using two stacks

Queues

1. Implement a queue using an array
2. Implement a queue using a linked list
3. Implement a circular queue using an array

Trees

1. Traverse a binary tree (Inorder, Preorder, Postorder)
2. Find the height of a binary tree
3. Find the maximum element in a binary tree
4. Check if a binary tree is a BST or not
5. Find the lowest common ancestor of two nodes in a binary tree

Graphs

1. Implement a graph using an adjacency matrix
2. Implement a graph using an adjacency list
3. Perform a BFS traversal on a graph
4. perform a dFS traversal on a graph

Dynamic Programming

1. Fibonacci series using dynamic programming
2. Longest common subsequence using dynamic programming

Bit Manipulation

1. Find the first set bit in a number
2. Count the number of set bits in a number

Hashing

1. Implement a hash table using chaining

Greedy Algorithms

1. Activity selection problem using greedy algorithm

Heaps

1. Implement a max heap using an array

Sorting

1. Implement bubble sort
2. Implement selection sort
3. Implement insertion sort
4. Implement merge sort
5. Implement quick sort

Searching

1. Implement linear search
2. Implement binary search
3. implement DFS
4. implement BFS