1. Welcome
2. Introduction
3. 1. Getting Started with Data Structures, Algorithms, and Complexity
4. 1. 1.1. What is DSA?
   2. 1.2. What is an Algorithms?
   3. 1.3. What is pseudocode?
   4. 1.4. Why Learn DSA?
   5. 1.5. Applications of DSA(Where It’s Used)
   6. 1.6. Impact of Using vs. Not Using DSA
   7. 1.7. Introduction to Big-O Notation
   8. 1.8. Common Big-O Complexities
   9. 1.9. What is Complexity?
   10. 1.10. Common Algorithmic Complexities with Examples
5. 2. Introduction to Recursion
6. 1. 2.1. Factorial Example
   2. 2.2. Recursion vs Iteration
   3. 2.3. Tail Recursion
7. 3. Data Structures
8. 1. 3.1. Array
   2. 1. 3.1.1. 2D Array
      2. 3.1.2. Jagged Array
   3. 3.2. Strings
   4. 1. 3.2.1. Mutable Strings
   5. 3.3. Stacks
   6. 3.4. Queues
   7. 1. 3.4.1. Priority Queue
   8. 3.5. Linked Lists
   9. 1. 3.5.1. Doubly Linked Lists
      2. 3.5.2. Circular Linked Lists
   10. 3.6. Hashing
   11. 3.7. Trees
   12. 3.8. Graphs
9. 4. Sorting Algorithms
10. 1. 4.1. Bubble Sort
    2. 4.2. Selection Sort
    3. 4.3. Insertion Sort
    4. 4.4. Merge Sort
11. 5. Searching Algorithms
12. 1. 5.1. Linear Search
    2. 5.2. Binary Search
13. 6. Recursion Problem Solving with DSA
14. 1. 6.1. BinarySearchRecursion
    2. 6.2. FactorialWithMemoization
    3. 6.3. RecursiveArraySum
    4. 6.4. ReverseStringRecursively
    5. 6.5. TowerOfHanoi
    6. 6.6. FibonacciOptimization
    7. 6.7. LinkedListTraversal
    8. 6.8. PowerFunction
    9. 6.9. RecursiveVsIterativeSum
    10. 6.10. ReverseStringComparison
    11. 6.11. FactorialConversion
    12. 6.12. ReverseStringTailRecursion
    13. 6.13. TailRecursiveListLength
    14. 6.14. TailRecursivePower
    15. 6.15. TailRecursiveSum
15. 7. Array Problem Solving with DSA
16. 1. 7.1. ArrayReversal
    2. 7.2. ArrayRotation
    3. 7.3. ArraySorting
    4. 7.4. DuplicateFinder
    5. 7.5. MaximumElement
    6. 7.6. 3DArraySummation
    7. 7.7. DiagonalElements
    8. 7.8. MatrixMultiplication
    9. 7.9. TransposeMatrix
    10. 7.10. WaveTraversal
    11. 7.11. AdjacencyListRepresentation
    12. 7.12. DynamicRowAddition
    13. 7.13. JaggedArrayTranspose
    14. 7.14. RowSorting
    15. 7.15. SparseMatrixSum
17. 8. Strings Problem Solving with DSA
18. 1. 8.1. PalindromeChecker
    2. 8.2. ReverseString
    3. 8.3. StringCompression
    4. 8.4. StringPoolExperiment
    5. 8.5. SubstringFrequency
    6. 8.6. DynamicTextBuilder
    7. 8.7. InsertAndDeleteSimulation
    8. 8.8. StringBuilderCapacityManagement
    9. 8.9. StringReversal
    10. 8.10. ThreadSafeConcatenation
19. 9. Stacks Problem Solving with DSA
20. 1. 9.1. BrowserBackButtonSimulation
    2. 9.2. InfixToPostfixConversion
    3. 9.3. ParenthesesChecker
    4. 9.4. StackMinFunction
    5. 9.5. StringBuilderCapacityManagement
21. 10. Queues Problem Solving with DSA
22. 1. 10.1. CircularQueueTest
    2. 10.2. PrintJobSimulator
    3. 10.3. QueueBasedBFS
    4. 10.4. QueueReversal
    5. 10.5. TicketCounterSimulation
    6. 10.6. DijkstrasAlgorithm
    7. 10.7. KthLargestElement
    8. 10.8. MergeKSortedLists
    9. 10.9. MinHeapToMaxHeap
    10. 10.10. TaskScheduler
23. 11. Linked Lists Problem Solving with DSA
24. 1. 11.1. CycleDetection
    2. 11.2. MergeTwoSortedLists
    3. 11.3. MiddleElementFinder
    4. 11.4. PlaylistManager
    5. 11.5. ReverseLinkedList
    6. 11.6. BidirectionalTraversal
    7. 11.7. BrowserHistorySimulator
    8. 11.8. DequeImplementation
    9. 11.9. InsertAfterValue
    10. 11.10. ReverseDoublyLinkedList
    11. 11.11. InsertAfterValueCircular
    12. 11.12. JosephusProblem
    13. 11.13. RotateCircularLinkedList
    14. 11.14. RoundRobinScheduler
    15. 11.15. SplitCircularLinkedList
25. 12. Hashing Problem Solving with DSA
26. 1. 12.1. CollisionAnalysis
    2. 12.2. CustomHashFunction
    3. 12.3. PhoneBookApplication
    4. 12.4. TwoSumProblem
    5. 12.5. WordFrequencyCounter
27. 13. Trees Problem Solving with DSA
28. 1. 13.1. BSTValidator
    2. 13.2. HeightOfBST
    3. 13.3. LowestCommonAncestor
    4. 13.4. PreorderPostorderTraversals
    5. 13.5. RangeSumQuery
29. 14. Graphs Problem Solving with DSA
30. 1. 14.1. CycleDetection
    2. 14.2. GraphConnectivity
    3. 14.3. ShortestPathUnweighted
    4. 14.4. SocialNetworkSimulation
    5. 14.5. WeightedGraphExtension
31. 15. Sorting Algorithms Problem Solving with DSA
32. 1. 15.1. BasicBubbleSort
    2. 15.2. BubbleSortEdgeCaseHandling
    3. 15.3. BubbleSortFlagOptimization
    4. 15.4. BubbleSortPerformanceAnalysis
    5. 15.5. DescendingBubbleSort
    6. 15.6. BasicSelectionSort
    7. 15.7. DescendingSelectionSort
    8. 15.8. SelectionSortMinimumSwapCount
    9. 15.9. SelectionSortPerformanceAnalysis
    10. 15.10. SelectionSortStringArray
    11. 15.11. BasicInsertionSort
    12. 15.12. DescendingInsertionSort
    13. 15.13. InsertionSortNearlySortedArrays
    14. 15.14. InsertionSortObjectSorting
    15. 15.15. InsertionSortPerformanceAnalysis
    16. 15.16. BasicMergeSort
    17. 15.17. DescendingMergeSort
    18. 15.18. MergeSortObjectSorting
    19. 15.19. MergeSortPerformanceAnalysis
    20. 15.20. MergeSortSpaceOptimization
33. 16. Searching Algorithms
34. 1. 16.1. BasicLinearSearch
    2. 16.2. LinearSearchLastOccurrence
    3. 16.3. LinearSearchMultipleTargets
    4. 16.4. LinearSearchObjectSearch
    5. 16.5. LinearSearchPerformanceAnalysis
    6. 16.6. BasicBinarySearch
    7. 16.7. BinarySearchFirstLastOccurrence
    8. 16.8. BinarySearchObjectSearch
    9. 16.9. BinarySearchPerformanceAnalysis
    10. 16.10. BinarySearchRecursiveImplementation
35. 17. Appendix-Glossary of Terms
36. 18. Appendix-Pseudocode Symbols
37. 19. Appendix-Java Code Templates