Scribd
Upload
18 views2 pages

DSA Core Concepts

Uploaded by

Rakesh Mirchi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views2 pages

DSA Core Concepts

Uploaded by

Rakesh Mirchi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Core Concepts

1. Time Complexity (Analysis of Algorithms).


2. Space Complexity (Memory optimization).
3. Divide and Conquer Technique.
4. Dynamic Programming Basics.
5. Greedy Algorithm Basics.

Searching Algorithms

6. Linear Search Example.


7. Binary Search Theory and Example.
8. Search in a Rotated Sorted Array.
9. Find the First and Last Occurrence of an Element in a Sorted Array.

Sorting Algorithms

10. Bubble Sort Theory.


11. Bubble Sort Code in Java.
12. Selection Sort Theory.
13. Selection Sort Code.
14. Insertion Sort Theory.
15. Insertion Sort Code.
16. Merge Sort Theory.
17. Merge Sort Code in Java.
18. Quick Sort Theory.
19. Quick Sort Code in Java.
20. Heap Sort Theory and Implementation.
21. Counting Sort.

Linked Lists

22. LinkedList Theory.


23. LinkedList Code for Adding Values.
24. AddFirst and Delete Code.
25. Reverse a Linked List.
26. Detect Cycle in a Linked List.
27. Merge Two Sorted Linked Lists.
28. Remove Duplicates from a Sorted Linked List.

Stack and Queue


29. Stack Theory.
30. Stack Operations (Push, Pop, Peek Code).
31. Evaluate Postfix Expression Using Stack.
32. Implement a Queue Using Stacks.
33. Queue Theory.
34. Queue Code (Enqueue and Dequeue).
35. Circular Queue Code.
36. Priority Queue Basics.

Trees and Graphs

37. Tree Data Structure Basics.


38. Binary Search Tree (BST) Theory.
39. Tree Implementation.
40. Breadth-First Search (BFS) and Depth-First Search (DFS) for Trees.
41. Lowest Common Ancestor in a Binary Tree.
42. Check if a Binary Tree is Balanced.
43. Serialize and Deserialize a Binary Tree.
44. Graph Representation (Adjacency Matrix, Adjacency List).
45. Topological Sort.
46. Dijkstra's Shortest Path Algorithm.
47. Detect a Cycle in a Graph.

Recursion and Dynamic Programming

48. Basics of Recursion.


49. Solve the Tower of Hanoi Problem.
50. Fibonacci Numbers Using Recursion.
51. Longest Common Subsequence.
52. Longest Increasing Subsequence.
53. Knapsack Problem.
54. Minimum Path Sum in a Grid.
55. Maximum Subarray Sum (Kadane's Algorithm).

You might also like