Problem Solving in Data Structures & Algorithms Using Java

''Problem Solving in Data Structures & Algorithms'' is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like C, C++, Java, C#, Python, VB, JavaScript and PHP.Book’s CompositionThis book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained.Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, and Backtracking.In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.Table of ContentsChapter 0: How to use this book.Chapter 1: Introduction - Programming OverviewChapter 2: Algorithms AnalysisChapter 3: Approach to solve algorithm design problemsChapter 4: Abstract Data TypeChapter 5: SearchingChapter 6: SortingChapter 7: Linked ListChapter 8: StackChapter 9: QueueChapter 10: TreeChapter 11: Priority QueueChapter 12: Hash-TableChapter 13: GraphsChapter 14: String AlgorithmsChapter 15: Algorithm Design TechniquesChapter 16: Brute Force AlgorithmChapter 17: Greedy AlgorithmChapter 18: Divide & ConquerChapter 19: Dynamic ProgrammingChapter 20: BacktrackingChapter 21: Complexity TheoryChapter 22: Interview StrategyChapter 23: System Design