Level: Intermediate
1. Write a program to implement a class with basic attributes and methods.
2. Write a program to implement a class with private and public members.
3. Write a program to implement a class with constructors and destructors.
4. Write a program to implement a class with copy constructor.
5. Write a program to implement a class with operator overloading.
6. Write a program to implement a class with friend functions.
7. Write a program to implement single inheritance.
8. Write a program to implement multiple inheritance.
9. Write a program to implement multilevel inheritance.
10. Write a program to implement hierarchical inheritance.
11. Write a program to implement hybrid inheritance.
12. Write a program to implement function overloading.
13. Write a program to implement virtual functions.
14. Write a program to implement pure virtual functions and abstract classes.
15. Write a program to implement function templates.
16. Write a program to implement class templates.
17. Write a program to implement exception handling using try, catch, and throw.
18. Write a program to implement stack using arrays.
19. Write a program to implement stack using linked list.
20. Write a program to implement queue using arrays.
21. Write a program to implement queue using linked list.
22. Write a program to implement circular queue.
23. Write a program to implement priority queue.
24. Write a program to implement deque.
25. Write a program to implement singly linked list.
26. Write a program to implement doubly linked list.
27. Write a program to implement circular linked list.
28. Write a program to implement binary search tree.
29. Write a program to implement AVL tree.
30. Write a program to implement heap sort.
31. Write a program to implement merge sort.
32. Write a program to implement quick sort.
33. Write a program to implement bubble sort.
34. Write a program to implement insertion sort.
35. Write a program to implement selection sort.
36. Write a program to implement radix sort.
37. Write a program to implement bucket sort.
38. Write a program to implement counting sort.
39. Write a program to implement graph using adjacency matrix.
40. Write a program to implement graph using adjacency list.
41. Write a program to implement depth-first search (DFS).
42. Write a program to implement breadth-first search (BFS).
43. Write a program to implement Dijkstra's algorithm.
44. Write a program to implement Kruskal's algorithm.
45. Write a program to implement Prim's algorithm.
46. Write a program to implement Floyd-Warshall algorithm.
47. Write a program to implement Bellman-Ford algorithm.
48. Write a program to implement topological sort.
49. Write a program to find the shortest path in a graph.
50. Write a program to detect a cycle in a graph.
