Arrays and Strings:
1.Find the maximum sum subarray.
2. Find all substrings that are palindromes.
3. Implement the "tuwo sum" problem.
4. Implement Kadane's algorithm for maximum subarray sum.
5.Find the missing number in an array of integers.
6. Merge two sorted arrays into one sorted array.
7. Check ifa string is a palindrome.
8. Find the first non-repeating character in a string.
9. Write a program to remove duplicates from a sorted array.
Linked Lists:
10. Reverse a linked list.
11.Deteet acycle in a linked list.
12. Find the middle of a linked list.
13. Merge two sorted linked lists.
14.(mplement a stack using linked list.
15. Find the intersection point of two linked lists.
Stacks and Queues:
16. (mplement a stack using an array.
17. (mplement a stack that supports push, pop, top, and
retrieuing the minimum element.
18. Implement a circular queue.
19. Design a mox stack that supportspush, pop, top,retrieue
maximunm element.
20. Design aqueue using stacks.
Trees and Binary Search Trees:
21. Find the height of abinary tree.
22. Find the lowest common ancestor of two nodes in a binary
tree.
23. Validate if abinary tree is a valid binary search tree.
24. Serialize and deserialize a binary tree.
25. Implement an inorder traversal of a binary tree.
26. Find the diameter of a binary tree.
27. Conuert a binary tree to its mirror tree.
Graphs: (DFS).
depth-finst search
28. Implement breadth-first search (BFS).
unweighted
29.(mplement between twO nodes in an
30.Findthe shortest path
graph. undirected graph using DFS.
an
31. Detect a cycle in
bipartite.
32.Check ifagraph is connected components in an undirected
33. Find the number of
graph.
34. Find bridges in a graph.
Sorting and Searching:
(bubble, insertion, selection, merge) sort.
35. Implement
36. Implement quicksort.
37. (mplement binary search.
38. Implement interpolation search.
39. Find the kth smallest element in an array.
integers, count the number of inuersions
40. Given an array of
are
it has. An inversion occurg when two elements in the array
out of order.
Dynamic Programming (DP):
1. How do you find the nth Fibonacei number using dynamic
programming?
2. Write a dynamie programming solution for the 0/1 knapsack
problem.
3.Memoization to optimize recurnsive solutions in dynamic
programming?
4. (mplement adynamic programming algorithm to find the
longest common subsequence of two strings.
5. The coin change problem.
6.Tabulation approach in dynamic programming.
Backtracking:
7. Backtracking algorithm to solue the N-Queens problem.
8. Generate allpermutations of a given set using backtracking?
9. Implement backtracking to solve the Sudoku puzzle.
10.Subset sum problem.
11.Graph coloring problem using backtraking.
12. Write a backtracking algorithm to find the Hamiltonian
cyele in a graph.
Hashing:
13. (mplement a hash table using separate chaining.
14.Finst non-repeating character in a string using hashing.
15. Collision resolution techniques in hashing.
16. Write a function to solue the two-sum problem using
hashing.
17. How can you implement a hash set data structure?
18. Count the frequency of elements in an array using hashing.
Heap:
19. (mplement a priority queue using a min-heap.
20. How do you merge Ksorted arrays using a min-heap?
21. Write a function to perform heap sort algorithm.
22. Find the kth largest element in an array using a min-heap.
23. Implement a priority queue using amin-heap.
24. How do you build amax heap from anarray?
23. (mplement a priority queue using a min-heap.
24. How do you build a max heap from an array?
Tries:
25. Implement a trie data strueture.
26. Write a funetion to search for a word in a trie.
27. How can you implement autocomplete feature using a trie?
28.Deleting aword from atrie.
30. Write a function to find all words matching a pattern in a
trie.
Greedy Algorithms:
31.Solue the activity selection problem using a greedy
algorithm.
32. (mplement Huffman coding using a greedy algorithm.
33. Write a function to find the minimum spanning tree using
Prim's algorithm.
34. Coin change problem.
35. Dijkstra's algorithm using a greedy approach.
36. Implement the job sequencing problem using a greedy
algorithm.
37.Stack Us queue.
search (DFS)
38. breadth-finst search (BFS) and depth-finst
travensal
39. Concept of big notation.
it
40. What isan AUL tree? Explain its properties and how
operations.
maintains balance during insertion and deletion
